Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Constraint-directed negotiation of resource reallocations
Distributed artificial intelligence: vol. 2
Introduction to algorithms
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Predicting tradeoffs in contract-based distributed scheduling
Predicting tradeoffs in contract-based distributed scheduling
Empirical methods for artificial intelligence
Empirical methods for artificial intelligence
Frontiers of electronic commerce
Frontiers of electronic commerce
Leveled Commitment Contracting among Myopic Individually Rational Agents
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Advantages of a Leveled Commitment Contracting Protocol
Advantages of a Leveled Commitment Contracting Protocol
Negotiation among self-interested computationally limited agents
Negotiation among self-interested computationally limited agents
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Time-quality tradeoffs in reallocative negotiation with combinatorial contract types
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Bid Evaluation and Selection in the MAGNET Automated Contracting System
AMET '98 Selected Papers from the First International Workshop on Agent Mediated Electronic Trading on Agent Mediated Electronic Commerce
| Hi-index | 0.00 |
Task (re)allocation is a key problem in multiagent systems. Several different contract types have been introduced to be used for task reallocation: original, cluster, swap, and multiagent contracts. Instead of only using one of these contract types, they can be interleaved in a sequence of contract types. This is a powerful way of constructing algorithms that find the best solution reachable in a bounded amount of time. The experiments in this paper study how to best sequence the different contract types. We show that the number of contracts performed using any one contract type does not necessarily decrease over time as one might expect. The reason is that contracts often play the role of enabling further contracts. The results also show that it is clearly profitable for the agents to mix contract types in the sequence. Sequences of different contract types reach a solution significantly closer to the global optimum and in a shorter amount of time than sequences with only one contract type. However, the best sequences consist only of two interleaved contract types: original and cluster contracts. This allows us to provide a clear prescription about protocols for anytime task reallocation.