ACM Home Page
Please provide us with feedback. Feedback
Trajectories of goods in distributed allocation
Full text PdfPdf (2.02 MB)
Source
International Conference on Autonomous Agents archive
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 table of contents
Estoril, Portugal
SESSION: Economic paradigms table of contents
Pages 1111-1118  
Year of Publication: 2008
ISBN:978-0-9817381-1-6
Authors
Yann Chevaleyre  Université Paris-Dauphine
Ulle Endriss  University of Amsterdam
Nicolas Maudet  Université Paris-Dauphine
Sponsors
AAAI : Association for the Advancement of Artifical Intelligence
ACM: Association for Computing Machinery
Publisher
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 36,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging resources. It is no surprise that restrictions on potential deals also restrict the reachability of some desirable states, for instance states where goods are efficiently allocated. In particular topological restrictions make any attempt to guarantee asymptotic convergence to an optimal allocation impossible in most cases. In this paper, we concentrate on the dynamics of such systems; more precisely we study the trajectories of goods in such iterative reallocative processes. Our first contribution is to propose an upper bound on the length of the trajectories of goods, when agent utility functions are modular. The second innovative aspect of the paper is then to discuss how this affects, on average, the quality of the states that are reached. Finally, a preliminary study of the non-modular case is proposed, examining how synergetic effects between items can affect their trajectories.


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
D. Aldous and P. Diaconis. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc., 36:413--432, 1999.
 
2
Y. Chevaleyre, P. Dunne, U. Endriss, J. Lang, M. Lemaître, N. Maudet, J. Padget, S. Phelps, J. Rodríguez-Aguilar, and P. Sousa. Issues in multiagent resource allocation. Informatica, 30, 2006.
 
3
Y. Chevaleyre, U. Endriss, and N. Maudet. Allocating goods on a graph to eliminate envy. In Proc. 22nd AAAI Conference on Artificial Intelligence (AAAI-2007). AAAI Press, 2007.
 
4
 
5
 
6
D. Dolgov and E. Durfee. Resource allocation among agents with MDP-induced preferences. Journal of Artificial Intelligence Research, 27:505--549, 2006.
 
7
P. E. Dunne. Extremal behaviour in multiagent contract negotiation. Journal of Artif. Intell. Research, 23:41--78, 2005.
 
8
 
9
 
10
U. Endriss, N. Maudet, F. Sadri, and F. Toni. Negotiating socially optimal allocations of resources. Journal of Artif. Intell. Research, 25:315--348, 2006.
 
11
R. A. Fisher and L. H. Tippett. On the estimation of the frequency distributions of the largest or smallest member of a sample. Proc. Cambridge Phil. Soc., 24:180--190, 1928.
 
12
 
13
J. Jensen. Sur les fonctions convexes et les inégalités entre les valeurs moyennes. Acta Math., 30:175--193, 1906.
 
14
 
15
H. Moulin. Axioms of Cooperative Decision Making. Cambridge University Press, 1988.
16
 
17
J. S. Rosenschein and G. Zlotkin. Rules of Encounter. MIT Press, 1994.
 
18
T. Sandholm. Contract types for satisficing task allocation: I Theoretical results. In Proc. AAAI Spring Symposium: Satisficing Models, 1998.
 
19
 
20
 
21

Collaborative Colleagues:
Yann Chevaleyre: colleagues
Ulle Endriss: colleagues
Nicolas Maudet: colleagues