Non-transferable utility coalitional games via mixed-integer linear constraints

Journal of Artificial Intelligence Research

Volumn 38, Issue , 2010, Pages 633-685

  Greco, Gianluigi ^a   Malizia, Enrico ^a   Palopoli, Luigi ^a   Scarcello, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SCENARIO; APPLICATION-ORIENTED; COALITIONAL GAME; DISTRIBUTION PROBLEM; LINEAR CONSTRAINTS; MIXED-INTEGER; NON-TRANSFERABLE UTILITIES; SOLUTION CONCEPTS; TU GAMES;

COMPUTATIONAL COMPLEXITY;

EID: 77957858352     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3060     Document Type: Article

References (53)

1. Agotnes, T., van der Hoek, W., & Wooldridge, M. ( 2006). Temporal qualitative coalitional games. In Nakashima, H., Wellman, M. P., Weiss, G., & Stone, P. (Eds.), Proceedings of the 5th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), pp. 177-184, Hakodate, Japan.
2. Aumann, R. J. (1961). The core of a cooperative game without side payments. Transactions of the American Mathematical Society, 98, 539-552.
3. Aumann, R. J. (1985). An axiomatization of the non-transferable utility value. Econometrica, 53(3), 599-612.
4. Aumann, R. J., & Dreze, J. H. (1974). Cooperative games with coalition structures. International Journal of Game Theory, 3(4), 217-237.
5. Aumann, R. J., & Hart, S. (Eds.). (1992, 1994, 2002). Handbook of Game Theory With Economic Applications, Volume 1,2 and 3, Vol.11 of Handbooks in Economics. North-Holland, Amsterdam, The Netherlands.
6. Aumann, R. J., & Maschler, M. (1964). The bargaining set for cooperative games. In Advances in Game Theory, pp. 443-476. Princeton University Press, Princeton, NJ, USA.
7. Aumann, R. J., & Peleg, B. (1960). Von Neumann-Morgenstern solutions to cooperative games without side payments. Bulletin of the American Mathematical Society, 66(3), 173-179.
8. Bachrach, Y., & Rosenschein, J. S. (2008). Coalitional skill games. In Padgham, L., Parkes, D. C., Müller, J., & Parsons, S. (Eds.), Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1023-1030, Estoril, Portugal.
9. Bilbao, J. M. (2000). Cooperative Games on Combinatorial Structures, Vol.26 of Theory and Decision Library C. Kluwer Academinc Publishers, Reading, MA, USA.
10. Byford, M. C. (2007). A constrained coalitional approach to price formation. In North American Summer Meetings of the Econometric Society, Durham, NC, USA.
11. Charnes, A. (1953). Constrained games and linear programming. Proceedings of the National Academy of Sciences of the United States of America, 39(7), 639-641.
12. Conitzer, V., & Sandholm, T. (2004). Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In McGuinness, D. L., & Ferguson, G. (Eds.), Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), pp. 219-225, San Jose, CA, USA.
13. Davis, M., & Maschler, M. (1965). The kernel of a cooperative game.. Naval Research Logistics Quarterly, 12, 223-259.
14. Deng, X., & Papadimitriou, C. H. (1994). On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19(2), 257-266.
15. Dunne, P. E., van der Hoek, W., Kraus, S., & Wooldridge, M. (2008). Cooperative boolean games. In Padgham, L., Parkes, D. C., Müller, J., & Parsons, S. (Eds.), Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1015-1022, Estoril, Portugal.
16. Edgeworth, F. Y. (1881). Mathematical Psychics: An essay on the mathematics to the moral sciences. C. Kegan Paul & Co., London.
17. Elkind, E., Goldberg, L. A., Goldberg, P. W., & Wooldridge, M. (2009). On the computational complexity of weighted voting games. Annals of Mathematics and Artificial Intelligence, 56(2), 109-131.
18. Elkind, E., & Pasechnik, D. (2009). Computing the nucleolus of weighted voting games. In Mathieu, C. (Ed.), Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA09), pp. 327-335, New York, NY, USA.
19. Gillies, D. B. (1959). Solutions to general non-zero-sum games. In Tucker, A. W., & Luce, R. D. (Eds.), Contributions to the Theory of Games, Volume IV, Vol.40 of Annals of Mathematics Studies, pp. 47-85. Princeton University Press, Princeton, NJ, USA.
20. Greco, G., Malizia, E., Palopoli, L., & Scarcello, F. (2009a). Constrained coalitional games: Formal framework, properties, and complexity results (extended abstract). In Sierra, C., Castelfranchi, C., Decker, K. S., & Sichman, J. S. (Eds.), Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AA- MAS 2009), pp. 1295-1296, Budapest, Hungary.
21. Greco, G., Malizia, E., Palopoli, L., & Scarcello, F. (2009b). On the complexity of compact coalitional games. In Boutilier, C. (Ed.), Proceedings of the 21th InternationalJoint Conference on Artificial Intelligence (IJCAI-09), pp. 147-152, Pasadena, CA, USA. An extended version is available as the technical report arXiv:0810.3136 (http://arxiv.org/abs/0810.3136).
22. Hart, S. (2004). A comparison of non-transferable utility values. Theory and Decision, 56(1-2), 35-46.
23. Ieong, S., & Shoham, Y. (2005). Marginal contribution nets: A compact representation scheme for coalitional games. In Riedl, J., Kearns, M. J., & Reiter, M. K. (Eds.), Proceedings of the 6th ACM Conference on Electronic Commerce (EC'05), pp. 193-202, Vancouver, BC, Canada.
24. Ieong, S., & Shoham, Y. (2006). Multi-attribute coalitional games. In Feigenbaum, J., Chuang, J., & Pennock, D. M. (Eds.), Proceedings of the 7th ACM Conference on Electronic Commerce (EC'06), pp. 170-179, Ann Arbor, MI, USA.
25. Ieong, S., & Shoham, Y. (2008). Bayesian coalitional games. In Fox, D., & Gomes, C. P. (Eds.), Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI- 08), pp. 95-100, Chicago, IL, USA.
26. Jiang, T., & Baras, J. S. (2007). Fundamental tradeoffs and constrained coalitional games in autonomic wireless networks. In Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'07), pp. 1-8, Limassol, Cyprus.
27. Johnson, D. S. (1990). A catalog of complexity classes. In van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp. 67-161. The MIT Press, Cambridge, MA, USA.
28. Kalai, E. (1975). Excess functions for cooperative games without sidepayments. SIAM Journal of Applied Mathematics, 29(1), 60-71.
29. Malizia, E., Palopoli, L., & Scarcello, F. (2007). Infeasibility certificates and the complexity of the core in coalitional games. In Veloso, M. M. (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pp. 1402-1407, Hyderabad, India.
30. Maschler, M. (1992). The bargaining set, kernel, and nucleolus. In Aumann, R. J., & Hart, S. (Eds.), Handbook of Game Theory, Volume 1, Vol.11 of Handbooks in Economics, chap. 18. North-Holland, Amsterdam, The Netherlands.
31. McLean, R. P. (2002). Values of non-transferable utility games. In Aumann, R. J., & Hart, S. (Eds.), Handbook of Game Theory, Volume 3, Vol.11 of Handbooks in Economics, chap. 55. North-Holland, Amsterdam, The Netherlands.
32. Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. Wiley- Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, NY, USA.
33. Orshan, G., & Zarzuelo, J. M. (2000). The bilateral consistent prekernel for ntu games. Games and Economic Behavior, 32(1), 67-84.
34. Osborne, M. J., & Rubinstein, A. (1994). A Course in Game Theory. The MIT Press, Cambridge, MA, USA.
35. Owen, G. (1975). On the core of linear production games. Mathematical Programming, 9(1), 358-370.
36. Papadimitriou, C., & Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity (2nd edition). Dover Publications.
37. Peleg, B. (1963). Bargaining sets of cooperative games without side payments. Israel Journal of Mathematics, 1(4), 197-200.
38. Peleg, B., & Sudhölter, P. (2007). Introduction to the Theory of Cooperative Games (2nd edition). Theory and Decision Library. Springer, Berlin, Germany.
39. Rahwan, T., Ramchurn, S. D., Jennings, N. R., & Giovannucci, A. (2009). Anytime algorithm for optimal coalition structure generation. Journal of Artificial Intelligence Research, 34, 521-567.
40. Ryan, M. J. (1998). Constrained games, intervening duality and experimenter-experiment interactions. European Journal of Operational Research, 110(2), 326-341.
41. Schmeidler, D. (1969). The nucleolus of a characteristic function game. SIAM Journal of Applied Mathematics, 17(6), 1163-1170.
42. Selman, A. L. (1994). A taxonomy of complexity classes of functions. Journal of Computer and System Sciences, 48(2), 357-381.
43. Semple, J. (1997). Constrained games for evaluating organizational performance. European Journal of Operational Research, 96(1), 103-112.
44. Serrano, R. (1997). Reinterpreting the kernel. Journal of Economic Theory, 77(1), 58-80.
45. Shapley, L. S. (1953). A value for n-person games. In Kuhn, H. W., & Tucker, A. W. (Eds.), Contributions to the Theory of Games, Volume II, Vol.28 of Annals of Mathematics Studies, pp. 307-317. Princeton University Press, Princeton, NJ, USA.
46. Shapley, L. S. (1969). Utility comparison and the theory of games. In La Décision, pp. 251-263. Editions du Centre National de le Recherche Scientifique, Paris.
47. Shoham, Y. (2008). Computer science and game theory. Communications of the ACM, 51(8), 74-79.
48. Simon, H. A. (1972). Theories of bounded rationality. In McGuire, C. B., & Radner, R. (Eds.), Decision and Organization, Vol.12 of Studies in Mathematical and Managerial Economics, pp. 161-176. North-Holland, Amsterdam, The Netherlands.
49. von Neumann, J., & Morgenstern, O. (1944). Theory of Games and Economic Behavior (1st edition). Princeton University Press, Princeton, NJ, USA.
50. Weber, R. J. (1994). Games in coalitional form. In Aumann, R. J., & Hart, S. (Eds.), Handbook of Game Theory, Volume 2, Vol.11 of Handbooks in Economics, chap. 36. North-Holland, Amsterdam, The Netherlands.
51. Winter, E. (2002). The shapley value. In Aumann, R. J., & Hart, S. (Eds.), Handbook of Game Theory, Volume 3, Vol.11 of Handbooks in Economics, chap. 53. North-Holland, Amsterdam, The Netherlands.
52. Wooldridge, M., & Dunne, P. E. (2004). On the computational complexity of qualitative coalitional games. Artificial Intelligence, 158(1), 27-73.
53. Wooldridge, M., & Dunne, P. E. (2006). On the computational complexity of coalitional resource games. Artificial Intelligence, 170(10), 835-871.