On the complexity of core, kernel, and bargaining set

Artificial Intelligence

Volumn 175, Issue 12-13, 2011, Pages 1877-1910

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

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Bounded treewidth; Coalitional games; Compact representations; Computational complexity; Solution concepts

Indexed keywords

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); POLYNOMIAL APPROXIMATION; SIGNAL ENCODING;

ARBITRARY POLYNOMIAL; BOUNDED TREEWIDTH; BOUNDED-TREEWIDTH GRAPHS; COALITIONAL GAME; COMPACT REPRESENTATION; MARGINAL CONTRIBUTION; OPTIMIZATION PROBLEMS; SOLUTION CONCEPTS;

COMPLEX NETWORKS;

EID: 79959777489     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2011.06.002     Document Type: Article

References (79)

1. T. Ågotnes, W. van der Hoek, and M. Wooldridge Reasoning about coalitional games Artificial Intelligence 173 2009 45 79
2. S. Arnborg, J. Lagergren, and D. Seese Easy problems for tree-decomposable graphs Journal of Algorithms 12 1991 308 340
3. R.J. Aumann, and M. Maschler The bargaining set for cooperative games Advances in Game Theory 1964 Princeton University Press Princeton, NJ 443 476
4. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties 1999 Springer-Verlag Berlin, Heidelberg, Germany
5. H. Aziz, F. Brandt, and P. Harrenstein Monotone cooperative games and their threshold versions M. Luck, S. Sen, W. van der Hoek, G.A. Kaminka, Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada 2010 1017 1024
6. Y. Bachrach, E. Elkind, R. Meir, D.V. Pasechnik, M. Zuckerman, J. Rothe, and J.S. Rosenschein The cost of stability in coalitional games M. Mavronicolas, V.G. Papadopoulou, Algorithmic Game Theory, Proceedings of the Second International Symposium, SAGT 2009 Paphos, Cyprus, October 18-20, 2009 Lecture Notes in Computer Science vol. 5814 2009 Springer-Verlag Berlin, Germany 122 134
7. Y. Bachrach, R. Meir, K. Jung, P. Kohli, Coalitional structure generation in skill games, in: M. Fox, D. Poole (Eds.), Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10), Atlanta, GA, USA, 2010, pp. 703-708.
8. Y. Bachrach, E. Porat, Path disruption games, in: M. Luck, S. Sen, W. van der Hoek, G.A. Kaminka (Eds.), Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, 2010, pp. 1123-1130.
9. Y. Bachrach, J.S. Rosenschein, Coalitional skill games, in: L. Padgham, D.C. Parkes, J. Müller, S. Parsons (Eds.), Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, 2008, pp. 1023-1030.
10. Y. Bachrach, J.S. Rosenschein, E. Porat, Power and stability in connectivity games, in: L. Padgham, D.C. Parkes, J. Müller, S. Parsons (Eds.), Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, 2008, pp. 999-1006.
11. P. Bernstein, and N. Goodman The power of natural semijoins SIAM Journal on Computing 10 1981 751 771
12. J.M. Bilbao Cooperative Games on Combinatorial Structures Theory and Decision Library C vol. 26 2000 Kluwer Academic Publishers Reading, MA, USA
13. H.L. Bodlaender A linear-time algorithm for finding tree-decompositions of small treewidth SIAM Journal on Computing 25 1996 1305 1317 (Pubitemid 126584672)
14. A. Brøndsted An Introduction to Convex Polytopes Graduate Texts in Mathematics vol. 90 1983 Springer-Verlag New York, NY, USA
15. T. Calamoneri, The L (h, k) -labelling problem: An updated survey and annotated bibliography, The Computer Journal (2011), doi:10.1093/comjnl/bxr037, in press.
16. A. Condon The complexity of stochastic games Information and Computation 96 1992 203 224
17. V. Conitzer, T. Sandholm, Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains, in: D.L. McGuinness, G. Ferguson (Eds.), Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), San Jose, CA, USA, 2004, pp. 219-225.
18. V. Conitzer, and T. Sandholm Complexity of constructing solutions in the core based on synergies among coalitions Artificial Intelligence 170 2006 607 619
19. B. Courcelle Graph rewriting: An algebraic and logic approach J. van Leeuwen, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics 1990 The MIT Press Cambridge, MA, USA 193 242
20. S. Dasgupta, C.H. Papadimitriou, and U. Vazirani Algorithms 2006 McGraw-Hill New York, NY, USA
21. C. Daskalakis, C.H. Papadimitriou, Computing pure Nash equilibria in graphical games via Markov random fields, in: J. Feigenbaum, J. Chuang, D.M. Pennock (Eds.), Proceedings of the 7th ACM Conference on Electronic Commerce (EC06), Ann Arbor, MI, USA, 2006, pp. 91-99. (Pubitemid 44393628)
22. M. Davis, and M. Maschler The kernel of a cooperative game Naval Research Logistics Quarterly 12 1965 223 259
23. R. Dechter Constraint Processing 2003 Morgan Kaufmann Publishers San Francisco, CA, USA
24. X. Deng, Q. Fang, and X. Sun Finding nucleolus of flow game Journal of Combinatorial Optimization 18 2009 64 86
25. X. Deng, T. Ibaraki, and H. Nagamochi Algorithmic aspects of the core of combinatorial optimization games Mathematics of Operations Research 24 1999 751 766 (Pubitemid 30501676)
26. X. Deng, and C.H. Papadimitriou On the complexity of cooperative solution concepts Mathematics of Operations Research 19 1994 257 266
27. F.Y. Edgeworth Mathematical Psychics: An Essay on the Mathematics to the Moral Sciences 1881 C. Kegan Paul & Co. London
28. E. Elkind, L.A. Goldberg, P.W. Goldberg, and M. Wooldridge On the computational complexity of weighted voting games Annals of Mathematics and Artificial Intelligence 56 2009 109 131
29. E. Elkind, L.A. Goldberg, P.W. Goldberg, and M. Wooldridge A tractable and expressive class of marginal contribution nets and its applications Mathematical Logic Quarterly 55 2009 362 376
30. E. Elkind, D. Pasechnik, Computing the nucleolus of weighted voting games, in: C. Mathieu (Ed.), Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA09), New York, NY, USA, 2009, pp. 327-335.
31. U. Faigle, S.P. Fekete, W. Hochstättler, and W. Kern On approximately fair cost allocation in euclidean TSP games OR Spektrum 20 1998 29 37
32. U. Faigle, and W. Kern On some approximately balanced combinatorial cooperative games ZOR - Methods and Models of Operations Research 38 1993 141 152
33. U. Faigle, W. Kern, S.P. Fekete, and W. Hochstättler On the complexity of testing membership in the core of min-cost spanning tree games International Journal of Game Theory 26 1997 361 366
34. Z. Galil Efficient algorithms for finding maximum matching in graphs ACM Computing Surveys 18 1986 23 38 (Pubitemid 17464491)
35. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman & Co. New York, NY, USA
36. D.B. Gillies Solutions to general non-zero-sum games A.W. Tucker, R.D. Luce, Contributions to the Theory of Games, vol. IV Annals of Mathematics Studies vol. 40 1959 Princeton University Press Princeton, NJ, USA 47 85
37. M.X. Goemans, and M. Skutella Cooperative facility location games Journal of Algorithms 50 2004 194 214
38. G. Greco, E. Malizia, L. Palopoli, F. Scarcello, On the complexity of compact coalitional games, in: C. Boutilier (Ed.), Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), Pasadena, CA, USA, 2009, pp. 147-152.
39. G. Greco, E. Malizia, L. Palopoli, and F. Scarcello Non-transferable utility coalitional games via mixed-integer linear constraints Journal of Artificial Intelligence Research 38 2010 633 685
40. G. Greco, E. Malizia, L. Palopoli, F. Scarcello, On the complexity of the core over coalition structures, in: T. Walsh (Ed.), Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Spain, pp. 216-221.
41. G. Greco, and F. Scarcello On the power of structural decompositions of graph-based representations of constraint problems Artificial Intelligence 174 2010 382 409
42. B. Grünbaum Convex Polytopes Pure and Applied Mathematics vol. XVI 1967 Wiley New York, NY, USA
43. E. Helly Über Mengen konvexer Körper mit gemeinschaftlichen Punkten Jahresbericht der Deutschen Mathematiker-Vereinigung 32 1923 175 176
44. S. Ieong, Y. Shoham, Marginal contribution nets: a compact representation scheme for coalitional games, in: J. Riedl, M.J. Kearns, M.K. Reiter (Eds.), Proceedings of the 6th ACM Conference on Electronic Commerce (EC05), Vancouver, BC, Canada, 2005, pp. 193-202. (Pubitemid 43048679)
45. S. Ieong, Y. Shoham, Multi-attribute coalitional games, in: J. Feigenbaum, J. Chuang, D.M. Pennock (Eds.), Proceedings of the 7th ACM Conference on Electronic Commerce (EC06), Ann Arbor, MI, USA, 2006, pp. 170-179. (Pubitemid 44393634)
46. D.S. Johnson A catalog of complexity classes J. van Leeuwen, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity 1990 The MIT Press Cambridge, MA, USA 67 161
47. E. Kalai, and W. Stanford Finite rationality and interpersonal complexity in repeated games Econometrica 56 1988 397 410
48. E. Kalai, E. Zemel, On totally balanced games and games of flow, Discussion Paper 413, Northwestern University, Center for Mathematical Studies in Economics and Management Science, Evanston, IL, USA, 1980.
49. W. Kern, and D. Paulusma Matching games: The least core and the nucleolus Mathematics of Operations Research 28 2003 294 308
50. R. Klasing, A. Kosowski, and A. Navarra Cost minimization in wireless networks with a bounded and unbounded number of interfaces Networks 53 2009 266 275
51. A. Kosowski, A. Navarra, and C.M. Pinotti Exploiting multi-interface networks: Connectivity and cheapest paths Wireless Networks 16 2010 1063 1073
52. M.W. Krentel, The complexity of optimization problems, in: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC86), Berkeley, CA, USA, pp. 69-76.
53. E. Malizia, L. Palopoli, F. Scarcello, Infeasibility certificates and the complexity of the core in coalitional games, in: M.M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), Hyderabad, India, 2007, pp. 1402-1407.
54. M. Maschler The inequalities that determine the bargaining set M 1 (i) Israel Journal of Mathematics 4 1966 127 134
55. M. Maschler The bargaining set, kernel, and nucleolus R.J. Aumann, S. Hart, Handbook of Game Theory, vol. 1 Handbooks in Economics vol. 11 1992 North-Holland Amsterdam, The Netherlands 591 667
56. M. Maschler, B. Peleg, and L.S. Shapley Geometric properties of the kernel, nucleolus, and related solution concepts Mathematics of Operations Research 4 1979 303 338
57. N. Megiddo Computational complexity of the game theory approach to cost allocation for a tree Mathematics of Operations Research 3 1978 189 196
58. S. Muroga Threshold Logic and Its Applications 1971 Wiley-Interscience New York, NY, USA
59. J. von Neumann, and O. Morgenstern Theory of Games and Economic Behavior 3rd ed. 1953 Princeton University Press Princeton, NJ, USA
60. N. Ohta, V. Conitzer, R. Ichimura, Y. Sakurai, A. Iwasaki, and M. Yokoo Coalition structure generation utilizing compact characteristic function representations I.P. Gent, Principles and Practice of Constraint Programming - CP 2009, Proceedings of the 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Lecture Notes in Computer Science vol. 5732 2009 Springer-Verlag Berlin, Germany 623 638
61. Y. Okamoto Traveling salesman games with the Monge property Discrete Applied Mathematics 138 2004 349 369
62. M.J. Osborne, and A. Rubinstein A Course in Game Theory 1994 The MIT Press Cambridge, MA, USA
63. G. Owen On the core of linear production games Mathematical Programming 9 1975 358 370
64. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley Reading, MA, USA
65. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 2nd ed. 1998 Dover Publications
66. C.H. Papadimitriou, and M. Yannakakis The complexity of facets (and some facets of complexity) Journal of Computer and System Sciences 28 1984 244 259
67. J. Pearson, P. Jeavons, A survey of tractable constraint satisfaction problems, Technical Report CSD-TR-97-15, Royal Holloway, University of London, 1997.
68. K. Prased, and J. Kelly Np-completeness of some problems concerning voting games International Journal of Game Theory 19 1990 1 9
69. M. Rabin A note on Hellys theorem Pacific Journal of Mathematics 5 1955 363 366
70. N. Robertson, and P. Seymour Graph minors III: Planar tree-width Journal of Combinatorial Theory, Series B 36 1984 49 64
71. W. Saad, Z. Han, M. Debbah, A. Hjørungnes, and T. Başar Coalitional game theory for communication networks: A tutorial IEEE Signal Processing Magazine 26 2009 77 97
72. M. Schaefer Graph Ramsey theory and the polynomial hierarchy Journal of Computer and System Sciences 62 2001 290 322 (Pubitemid 32334553)
73. D. Schmeidler The nucleolus of a characteristic function game SIAM Journal of Applied Mathematics 17 1969 1163 1170
74. A.L. Selman A taxonomy of complexity classes of functions Journal of Computer and System Sciences 48 1994 357 381 (Pubitemid 124013296)
75. L.S. Shapley, and M. Shubik The assignment game I: The core International Journal of Game Theory 1 1971 111 130
76. H.A. Simon Theories of bounded rationality C.B. McGuire, R. Radner, Decision and Organization Studies in Mathematical and Managerial Economics vol. 12 1972 North-Holland Amsterdam, The Netherlands 161 176
77. S.H. Tijs, T. Parthasarathy, J.A.M. Potters, and V. Rajendra Prasad Permutation games: Another class of totally balanced games OR Spektrum 6 1984 119 123
78. T. Voice, M. Polukarov, N.R. Jennings, Graph coalition structure generation, CoRR, arXiv:1102.1747 [abs], 2011.
79. M. Yannakakis Equilibria, fixed points, and complexity classes Computer Science Review 3 2009 71 85