Allocating goods on a graph to eliminate envy

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 700-705

  Chevaleyre, Yann ^a   Endriss, Ulle ^b   Maudet, Nicolas ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; MULTI AGENT SYSTEMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

DISTRIBUTED NEGOTIATION; NEGOTIATION TOPOLOGY;

GRAPH THEORY;

EID: 36348998629     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Alkan, A.; Demange, G.; and Gale, D. 1991. Fair allocation of indivisible goods and criteria of justice. Econometrica 59(4):1023-1039.
2. Bell, A. M. 1996. Bilateral trading on a network: A simulation study. Presented at the Second International Conference on Computing in Economics and Finance.
3. Bouveret, S., and Lang, J. 2005. Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. In Proc. of IJCAI-2005.
4. Brams, S., and Taylor, A. 1996. Fair Division: From Cake-cutting to Dispute Resolution. Cambridge University Press.
5. Chevaleyre, Y.; Dunne, P.; Endriss, U.; Lang, J.; Lemaître, M.; Maudet, N.; Padget, J.; Phelps, S.; Rodríguez-Aguilar, J.; and Sousa, P. 2006. Issues in multiagent resource allocation. Informatica 30:3-31.
6. Chevaleyre, Y.; Endriss, U.; Estivie, S.; and Maudet, N. 2007. Reaching envy-free states in distributed negotiation settings, In Proc. of IJCAI-2007.
7. Dunne, P.; Wooldridge, M.; and Laurence, M. 2005. The complexity of contract negotiation. Artificial Intelligence 164(1-2):23-46.
8. Endriss, U.; Maudet, N.; Sadri, F.; and Toni, F. 2006. Negotiating socially optimal allocations of resources. Journal of Artificial Intelligence Research 25:315-348.
9. Frei, C.; Faltings, B.; and Hamdi, M. 2005. Resource allocation in communication networks using abstraction and constraint satisfaction. IEEE Journal on Selected Areas in Communication 23(2):304-320.
10. Lipton, R.; Markakis, E.; Mossel, E.; and Saberi, A. 2004. On approximately fair allocations of indivisible goods. In Proc. of ACM-EC-2004.
11. Moulin, H. 1988. Axioms of Cooperative Decision Making. Cambridge University Press.
12. Rothkopf, M.; Pekeč, A.; and Harstad, R. 1998. Computationally manageable combinational auctions. Management Science 44(8):1131-1147.
13. Sandholm, T. 1998. Contract types for satisficing task allocation: I Theoretical results. In Proc. AAAI Spring Symposium: Satisficing Models.
14. Wilhite, A. 2001. Bilateral trade and 'small-world' networks. Computational Economics 18(1):49-64.
15. Yokoo, M.; Durfee, E. H.; Ishida, T.; and Kuwabara, K. 1998. The distributed constraint satisfaction problem: Formalization and algorithms. Knowledge and Data Engineering 10(5):673-685.