ACM Home Page
Please provide us with feedback. Feedback
Negotiating over small bundles of resources
Full text PdfPdf (348 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems table of contents
The Netherlands
SESSION: Papers: negotiation and agreement I table of contents
Pages: 296 - 302  
Year of Publication: 2005
ISBN:1-59593-093-0
Authors
Yann Chevaleyre  Université Paris-Daupine (France)
Ulle Endriss  Imperial College London (UK)
Jérôme Lang  Université Paul Sabatier, Toulouse (France)
Nicolas Maudet  Université Paris-Daupine (France)
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 19,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1082473.1082518
What is a DOI?

ABSTRACT

When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socially optimal allocation in the general case. This paper addresses this issue by analysing how the confinement to certain classes of utility functions can enable agents to move to an optimal allocation by negotiating over small bundles of items at a time. In particular, we consider so-called k-separable domains, where the full set of resources can be divided into several preferentially independent bundles of limited cardinality.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
K. J. Arrow, A. K. Sen, and K. Suzumura, editors. Handbook of Social Choice and Welfare, volume 1. North-Holland, 2002.
 
2
Y. Chevaleyre, U. Endriss, S. Estivie, and N. Maudet. Multiagent resource allocation with k-additive utility functions. In Proc. DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, Annales du LAMSADE 3, 2004.
 
3
Y. Chevaleyre, U. Endriss. and N. Maudet. On maximal classes of utility functions for efficient one-to-one negotiation. In Proc. IJCAI-2005. Morgan Kaufmann Publishers, 2005.
 
4
 
5
P. E. Dunne. Extremal behaviour in multiagent contract negotiation. Journal of Artificial Intelligence Research, 23:41--78, 2005.
 
6
 
7
8
 
9
P. C. Fishburn. Utility Theory for Decision Making. John Wiley and Sons, 1970.
 
10
 
11
 
12
H. Moulin. Axioms of Cooperative Decision Making. Cambridge University Press, 1988.
 
13
J. S. Rosenschein and G. Zlotkin. Rules of Encounter. MIT Press, 1994.
 
14
T. W. Sandholm. Contract types for satisficing task allocation: I Theoretical results. In Proc. AAAI Spring Symposium: Satisficing Models, 1998.
 
15
M. Wooldridge and S. Parsons. Languages for negotiation. In Proc. ECAI-2000. IOS Press, 2000.

CITED BY  7

Collaborative Colleagues:
Yann Chevaleyre: colleagues
Ulle Endriss: colleagues
Jérôme Lang: colleagues
Nicolas Maudet: colleagues