On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5783 LNAI, Issue , 2009, Pages 98-110

  De Keijzer, Bart ^a   Bouveret, Sylvain ^b   Klos, Tomas ^a   Zhang, Yingqian ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b ONERA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; EFFICIENCY AND FAIRNESS; FREE ALLOCATION; INDIVISIBLE GOOD; PARETO-OPTIMAL; RESOURCE ALLOCATION PROBLEM;

GAME THEORY; RESOURCE ALLOCATION;

DECISION THEORY;

EID: 71549161491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04428-1_9     Document Type: Conference Paper

References (13)

1. Chevaleyre, Y., Dunne, P.E., Endriss, U., Lang, J., Lemǎitre, M., Maudet, N., Padget, J., Phelps, S., Rodríguez-Aguilar, J.A., Sousa, P.: Issues in multiagent resource allocation. Informatica 30, 3-31 (2006); Survey paper
2. Brams, S.J., Taylor, A.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge Univ. Press, Cambridge (1996)
3. Demko, S., Hill, T.P.: Equitable distribution of indivisible items. Mathematical Social Sciences 16, 145-158 (1998)
4. Shehory, O., Kraus, S.: Methods for Task Allocation via Agent Coalition Formation. Artificial Intelligence 101(1-2), 165-200 (1998)
5. Modi, P.J., Jung, H., Tambe, M., Shen, W.M., Kulkarni, S.: A dynamic distributed constraint satisfaction approach to resource allocation. In:Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 685-700. Springer, Heidelberg (2001)
6. de Weerdt, M.M., Zhang, Y., Klos, T.B.: Distributed task allocation in social networks. In: Huhns, M., Shehory, O. (eds.) Proceedings of the 6th International Conference on Autonomous Agents and Multiagent Systems, Bradford, UK, pp. 488-495. IFAAMAS, Research Publishing Services (2007)
7. Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC 2004: Proceedings of the 5th ACM conference on Electronic commerce, pp. 125-131. ACM Press, New York (2004)
8. Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research (JAIR) 32, 525-564 (2008)
9. Dunne, P.E., Wooldridge, M., Laurence, M.: The complexity of contract negotiation. Artificial Intelligence 164(1-2), 23-46 (2005)
10. Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation with k-additive utility functions. In: Proceedings of the First International Workshop on Computer Science and Decision Theory, Paris, France, pp. 83-100 (2004)
11. Conitzer, V., Sandholm, T., Santi, P.: Combinatorial auctions with k-wise dependent valuations. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 248-254. AAAI Press, Menlo Park (2005)
12. Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: a compendium. SIGACT News (September 2002)
13. Brams, S.J., King, D.L.: Efficient fair division: Help the worst off or avoid envy? Rationality and Society 17(4), 387-421 (2005)