An overview of cooperative and competitive multiagent learning
Multi-agent systems (MASs) is an area of distributed artificial intelligence that emphasizes the
joint behaviors of agents with some degree of autonomy and the complexities arising from …
joint behaviors of agents with some degree of autonomy and the complexities arising from …
[PDF][PDF] SpikeProp: backpropagation for networks of spiking neurons.
For a network of spiking neurons with reasonable postsynaptic potentials, we derive a
supervised learning rule akin to traditional error-back-propagation, SpikeProp and show how to …
supervised learning rule akin to traditional error-back-propagation, SpikeProp and show how to …
Modeling complex multi-issue negotiations using utility graphs
V Robu, DJA Somefun, JA La Poutré - Proceedings of the fourth …, 2005 - dl.acm.org
This paper presents an agent strategy for complex bilateral negotiations over many issues
with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic …
with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic …
Dynamic routing problems with fruitful regions: Models and evolutionary computation
JI Van Hemert, JA La Poutré - … on Parallel Problem Solving from Nature, 2004 - Springer
We introduce the concept of fruitful regions in a dynamic routing context: regions that have a
high potential of generating loads to be transported. The objective is to maximise the …
high potential of generating loads to be transported. The objective is to maximise the …
Maintenance of transitive closures and transitive reductions of graphs
JA La Poutré, J Van Leeuwen - … Workshop on Graph-Theoretic Concepts in …, 1987 - Springer
Let G=< V, E> be a directed graph, G*=< V, E*> its transitive closure and G-=< V, E-> its
transitive reduction (cf.[1]). Let E* and E-be represented by adjacency matrices. Suppose edges …
transitive reduction (cf.[1]). Let E* and E-be represented by adjacency matrices. Suppose edges …
Automated negotiation and bundling of information goods
DJA Somefun, EH Gerding, S Bohte… - … Electronic Commerce V …, 2004 - Springer
In this paper, we present a novel system for selling bundles of news items. Through the system,
customers bargain with the seller over the price and quality of the delivered goods. The …
customers bargain with the seller over the price and quality of the delivered goods. The …
[BOEK][B] Scientific approaches and techniques for negotiation: a game theoretic and artificial intelligence perspective
EH Gerding, DDB van Bragt, JA La Poutré - 2000 - Citeseer
Due to the rapid growth of electronic environments (such as the Internet) much research is
currently being performed on autonomous trading mechanisms. This report contains an …
currently being performed on autonomous trading mechanisms. This report contains an …
[BOEK][B] New techniques for the union-find problem
JA La Poutré - 1989 - Citeseer
A well-known result of Tarjan (cf.[10]) states that a program of up to n UNION and m FIND
instructions can be executed in O (n--mo (m, n)) time on a collection of n elements, where o (m, …
instructions can be executed in O (n--mo (m, n)) time on a collection of n elements, where o (m, …
A decommitment strategy in a competitive multi-agent transportation setting
PJ 't Hoen, JA La Poutré - Proceedings of the second international joint …, 2003 - dl.acm.org
Decommitment is the action of foregoing a contract for another (superior) offer. It has been
shown that, using decommitment, agents can reach higher utility levels in case of negotiations …
shown that, using decommitment, agents can reach higher utility levels in case of negotiations …
Optimization of online patient scheduling with urgencies and preferences
IB Vermeulen, SM Bohte, PAN Bosman… - Artificial Intelligence in …, 2009 - Springer
We consider the online problem of scheduling patients with urgencies and preferences on
hospital resources with limited capacity. To solve this complex scheduling problem effectively …
hospital resources with limited capacity. To solve this complex scheduling problem effectively …