Multiagent resource allocation in k-additive domains: Preference representation and complexity

Annals of Operations Research

Volumn 163, Issue 1, 2008, Pages 49-62

  Chevaleyre, Yann ^a   Endriss, Ulle ^b   Estivie, Sylvia ^c   Maudet, Nicolas ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

Computational complexity; Multiagent systems; Negotiation; Preference representation; Resource allocation

Indexed keywords

EID: 49249103879     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0335-0     Document Type: Article

References (34)

1. Arrow, K. J., Sen, A. K., & Suzumura, K. (Eds.) (2002). Handbook of social choice and welfare (Vol. 1), Amsterdam: North-Holland.
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (1999). Complexity and approximation: combinatorial optimization problems and their approximability properties. Berlin: Springer.
3. E. Boros P. L. Hammer 2002 Pseudo-boolean optimization Discrete Applied Mathematics 123 1-3 155 225
4. Boutilier, C., Brafman, R. I., Geib, C., & Poole, D. (1997). A constraint-based approach to preference elicitation and decision making. In Proc. AAAI spring symposium on qualitative decision theory.
5. Bouveret, S., & Lang, J. (2005). Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. In Proc. 19th international joint conference on artificial intelligence (IJCAI-2005). San Mateo: Morgan Kaufmann.
6. Brams, S. J., & Taylor, A. D. (1996). Fair division: from cake-cutting to dispute resolution. Cambridge: Cambridge University Press.
7. Chevaleyre, Y., Endriss, U., Estivie, S., & Maudet, N. (2004). Multiagent resource allocation with k-additive utility functions. In Proc. DIMACS-LAMSADE workshop on computer science and decision theory. Annales du LAMSADE 3.
8. Chevaleyre, Y., Endriss, U., Lang, J., & Maudet, N. (2005). Negotiating over small bundles of resources. In Proc. 4th international joint conference on autonomous agents and multiagent systems (AAMAS-2005). New York: ACM Press.
9. Y. Chevaleyre P. E. Dunne U. Endriss J. Lang M. Lemaître N. Maudet J. Padget S. Phelps J. A. Rodríguez-Aguilar P. Sousa 2006 Issues in multiagent resource allocation Informatica 30 3 31
10. Conitzer, V., Sandholm, T. W., & Santi, P. (2005). Combinatorial auctions with k-wise dependent valuations. In Proc. 20th national conference on artificial intelligence (AAAI-05). Menlo Park: AAAI Press.
11. Coste-Marquis, S., Lang, J., Liberatore, P., & Marquis, P. (2004). Expressive power and succinctness of propositional languages for preference representation. In Proc. of the 9th international conference on principles of knowledge representation and reasoning (KR-2004). Menlo Park: AAAI Press.
12. Cramton, P., Shoham, Y., & Steinberg, R. (Eds.) (2006). Combinatorial auctions. Cambridge: MIT Press.
13. P. E. Dunne M. Wooldridge M. Laurence 2005 The complexity of contract negotiation Artificial Intelligence 164 1-2 23 46
14. U. Endriss N. Maudet 2005 On the communication complexity of multilateral trading: extended report Journal of Autonomous Agents and Multiagent Systems 11 1 91 107
15. U. Endriss N. Maudet F. Sadri F. Toni 2006 Negotiating socially optimal allocations of resources Journal of Artificial Intelligence Research 25 315 348
16. H. Fargier J. Lang M. Lemaître G. Verfaillie 2004 Partage équitable de ressources communes: (2) Éléments de complexité et d'algorithmique Technique et Science Informatique 23 9 1219 1238
17. Fishburn, P. C. (1970). Utility theory for decision making. New York: Wiley.
18. Fujishima, Y., Leyton-Brown, K., & Shoham, Y. (1999). Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In Proc. 16th international joint conference on artificial intelligence (IJCAI-1999). San Mateo: Morgan Kaufman.
19. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.
20. Gonzales, C., & Perny, P. (2004). GAI networks for utility elicitation. In Proc. of the 9th international conference on principles of knowledge representation and reasoning (KR-2004). Menlo Park: AAAI Press.
21. M. Grabisch 1997 k-order additive discrete fuzzy measures and their representation Fuzzy Sets and Systems 92 167 189
22. Keeney, R. L., & Raiffa, H. (1993). Decisions with multiple objectives: preferences and value trade-offs. Cambridge: Cambridge University Press.
23. Lang, J. (2005). Some representation and computational issues in social choice. In Proc. 8th European conference on symbolic and quantitative approaches to reasoning with uncertainty (ECSQARU-2005). Berlin: Springer.
24. Moulin, H. (1988). Axioms of cooperative decision making. Cambridge: Cambridge University Press.
25. Nisan, N. (2000). Bidding and allocation in combinatorial auctions. In Proc. ACM conference on electronic commerce (EC-2000). New York: ACM Press.
26. Papadimitriou, C. H. (1994). Computational complexity. Reading: Addison-Wesley.
27. Papadimitriou, C. H. (2001). Algorithms, games, and the Internet. In Proc. 33rd annual ACM symposium on theory of computing (STOC-2001). New York: ACM Press.
28. G. C. Rota 1964 On the foundations of combinatorial theory I: Theory of Möbius functions Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 2 4 340 368
29. M. H. Rothkopf A. Pekeĉ R. M. Harstad 1998 Computationally manageable combinational auctions Management Science 44 8 1131 1147
30. Sandholm, T. W. (1998). Contract types for satisficing task allocation: I. Theoretical results. In Proc. AAAI spring symposium: satisficing models.
31. T. W. Sandholm 2002 Algorithm for optimal winner determination in combinatorial auctions Artificial Intelligence 135 1-2 1 54
32. Sandholm, T. W., & Boutilier, C. (2006). Preference elicitation in combinatorial auctions. In P. Cramton et al. (Eds.), Combinatorial auctions. New York: MIT Press.
33. Wooldridge, M. (2002). An introduction to multiagent systems. New York: Wiley.
34. Zinkevich, M. A., Blum, A., & Sandholm, T. W. (2003). On polynomial-time preference elicitation with value queries. In Proc. ACM conference on electronic commerce (EC-2003). New York: ACM Press.