Extremal behaviour in multiagent contract negotiation

Journal of Artificial Intelligence Research

Volumn 23, Issue , 2005, Pages 41-78

  Dunne, Paul E ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONTRACTS; DATA TRANSFER; OPTIMIZATION; RESOURCE ALLOCATION;

NEGOTIATION PROTOCOLS; PIGOU-DALTON TRANSFERS; REALLOCATION;

MULTI AGENT SYSTEMS;

EID: 16244401828     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1526     Document Type: Article

References (26)

1. Abbott, H. L., & Katchalski, M. (1991). On the construction of snake in the box codes. Utilitas Mathematica 40, 97-116.
2. Atkinson, A. (1970). On the measurement of inequality. Jnl. Econ. Theory, 2, 244-263.
3. Chateauneaf, A., Gajdos, T., & Wilthien, P.-H. (2002). The principle of strong diminishing transfer. Jnl. Econ. Theory, 103, 311-333.
4. Dignum, F., & Greaves, M. (2000). Issues in Agent Communication, Vol. 1916 of LNCS. Springer-Verlag.
5. Dunne, P. (2003). Prevarication in dispute protocols. In Proc. Ninth International Conf. on A.I. and Law (ICAIL'03), pp. 12-21, Edinburgh. ACM Press.
6. Dunne, P. (2004). Context dependence in multiagent resource allocation. In Proc. ECAI'04, pp. 1000-01, Valencia.
7. Dunne, P., & McBurney, P. (2003). Optimal utterances in dialogue protocols. In Proc. Second International Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS'03), pp. 608-615. ACM Press.
8. Dunne, P., Wooldridge, M., & Laurence, M. (2003). The complexity of contract negotiation. Tech. rep. ULCS-03-002, Dept. of Computer Science, Univ. of Liverpool, (to appear Artificial Intelligence).
9. Endriss, U., & Maudet, N. (2004a). On the communication complexity of multilateral trading. In Proc. Third International Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS'04), pp. 622-629.
10. Endriss, U., & Maudet, N. (2004b). Welfare engineering in multiagent systems. In Omicini, A., Petta, P., &: Pitt, J. (Eds.), Proc. Fourth International Workshop on Engineering Societies in the Agents World (ESAW-2003), Vol. 3071 of LNAI, pp. 93-106. Springer-Verlag.
11. Endriss, U., Maudet, N., Sadri, F., & Toni, F. (2003). On optimal outcomes of negotiations over resources. In Proc. Second International Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS'03), pp. 177-184. ACM Press.
12. Kautz, W. H. (1958). Unit distance error checking codes. IRE Trans. on Electronic Computers, 7, 179-180.
13. Kolm, S.-C. (1976). Unequal inequalities. Jnl. Econ. Theory, 13, 82-111.
14. Kraus, S. (2001). Strategic negotiation in multiagent environments. MIT Press.
15. McBurney, P., Parsons, S., & Wooldridge, M. (2002). Desiderata for argumentation protocols. In Proc. First International. Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS'02), pp. 402-409. ACM Press.
16. Parkes, D. C., & Ungar, L. H. (2000a). Iterative combinatorial auctions: theory and practice. In Proc. 17th National Conf. on Artificial Intelligence (AAAI-00), pp. 74-81.
17. Parkes, D. C., & Ungar, L. H. (2000b). Preventing strategic manipulation in iterative auctions: proxy agents and price adjustment. In Proc. 17th National Conf. on Artificial Intelligence (AAAI-00), pp. 82-89.
18. Rosenschein, J. S., & Zlotkin, G. (1994). Rules of Encounter. MIT Press.
19. Sandholm, T. W. (1998). Contract types for satisficing task allocation: I theoretical results. In AAAI Spring Symposium: Satisficing Models.
20. Sandholm, T. W. (1999). Distributed rational decision making. In Weiß, G. (Ed.), Multiagent Systems, pp. 201-258. MIT Press.
21. Sandholm, T. W. (2002). Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135, 1-54.
22. Sandholm, T. W., & Suri, S. (2003). Bob: Improved winner determination in combinatorial auctions and generalizations. Artificial Intelligence, 145, 33-58.
23. Sandholm, T. W., Suri, S., Gilpin, A., & Levine, D. (2001). Cabob: A fast optimal algorithm for combinatorial auctions.. In Proc. IJCAI-01, pp. 1102-1108.
24. Smith, R. G. (1980). The contract net protocol: high-level communication and control in a distributed problem solver. IEEE Trans. on Computers, C-29(12), 1104-1113.
25. Tennenholz, M. (2000). Some tractable combinatorial auctions. In Proc. 17th National Conf. on Artificial Intelligence (AAAI-00).
26. Yokoo, M., Sakurai, Y., & Matsubara, S. (2004). The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. Games and Economic Behavior, 46(1), 174-188.