Algorithmic cooperative game theory

Springer Optimization and Its Applications

Volumn 17, Issue , 2008, Pages 159-185

  Deng, Xiaotie ^a   Fang, Qizhi ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b OCEAN UNIVERSITY OF CHINA   (China)

Author keywords

Computational complexity; Cooperative game; Core; Linear program; LP duality; NP hard; Nucleolus

Indexed keywords

EID: 84976508848     PISSN: 19316828     EISSN: 19316836     Source Type: Book Series    
DOI: 10.1007/978-0-387-77247-9_7     Document Type: Chapter

References (73)

1. Aumann, R. J., Maschler, M.: Game Theoretic Analysis of a Bankruptcy Problem from the Talmud. Journal of Economic Theory, 36, 195-396 (1985).
2. Bird, C. G.: Cost-Allocation for a Spanning Tree. Networks, 6, 335-350 (1976).
3. Bondareva, O. N.: Some Applications of Linear Programming Methods to the Theory of Cooperative Games. Problemy Kibernetiki, 10, 119-139 (1963).
4. Brânzei, R., Solymosi, T., Tijs, S. H.: Strongly Essential Coalitions and the Nucleolus of Peer Group Games. CentER Discussion Paper, 19 (2003).
5. Chvátal, V.: Rational Behavior and Computational Complexity. Technical Report SOCS-78. 9, School of Computer Science, McGill University, Montreal (1978).
6. Claus, A., Granot, D.: Game Theory Application to Cost Allocation for a Spanning Tree. Working Paper No 402, Faculty of Commerce and Business Administration, University of British Columbia, June (1976).
7. Claus, A., Kleitman, D. J.: Cost Allocation for a Spanning Tree. Networks, 3, 289-304 (1973).
8. Cornuéjols, G., Liu, X., Vušković, K.: A Polynomial Algorithm for Recognizing Perfect Graphs. Proceeding of 44th FOCS, 20-27 (2003).
9. Curiel, I. J.: Cooperative Game Theory and Applications: Cooperative Games ArisingfromCombinatorialOptimizationProblems. KluwerAcademicPublishers, Dordrecht (1997).
10. Deng, X.: Mathematical Programming: Complexity and Algorithms. PhD Thesis, Department of Operations Research, Stanford University, California (1989).
11. Deng, X., Fang, Q., Sun, X.: Finding Nucleolus of Flow Game, Symposium on Discrete Algorithms, 124-131 (2006).
12. Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic Aspects of the Core of Combinatorial Optimization Games. Mathematics of Operations Research, 24, 751-766 (1999).
13. Deng, X., Ibaraki, T., Nagamochi, H., Zang, W.: Totally Balanced Combinatorial Optimization Games. Mathematical Programming, 87, 441-452 (2000).
14. Deng, X., Papadimitriou, C.: On the Complexity of Cooperative Game Solution Concepts. Mathematics of Operations Research, 19, 257-266 (1994).
15. Dror, M.: Cost Allocation: The Traveling Salesman, Binpacking, and the Knapsack. Technical Report, INRS Telecommuincations, Quebac, Canada (1987).
16. Dubey, P., Shapley, L. S.: Totally Balanced Games Arising from Controlled Programming Problems. Mathematical Programming, 29, 245-267 (1984).
17. Edmonds, J.: Path, Tree, and Flowers. Canadian Journal of Mathematics, 17, 449-469 (1965).
18. Faigle, U., Fekete, S., Hochstättler, W., Kern, W.: On the Complexity of Testing Membership in the Core of Min-Cost Spanning Tree Games. International Journal of Game Theory, 26, 361-366 (1997).
19. Faigle, U., Kern, W., Kuipers, J.: Computing the Nucleolus of Min-Cost Spanning Tree Games is NP-Hard. International Journal of Game Theory, 27, 443-450 (1998).
20. Faigle, U., Kern, W., Fekete, S. P., Hochstättler, W.: The Nucleon of Cooperative Games and an Algorithm for Matching Games. Mathematical Programming, 83, 195-211 (1998).
21. Faigle, U., Kern, W., Kuipers, J.: On the Computation of the Nucleolus of a Cooperative Game. International Journal of Game Theory, 30, 79-98 (2001).
22. Faigle, U., Kern, W.: On Some Approximately Balanced Combinatorial Cooperative Games. ZOR Methods and Models of Operations Research, 38, 141-152 (1998).
23. Faigle, U., Kern, W.: Partition Games and the Core of Hierarchically Convex Cost Games. Universiteit Twente, Faculteit der Toegepaste Wiskunde, Memorandum, No. 1269, June (1995).
24. Fang, Q., Zhu, S., Cai, M., Deng, X.: On Computational Complexity of Membership Test in Flow Games and Linear Production Games. International Journal of Game Theory, 31, 39-45 (2002).
25. Fang, Q., Cai, M., Deng, X.: Total Balancedness Condition for Steiner Tree Games. Discrete Applied Mathematics, 127, 555-563 (2003).
26. Ford, L. R., Fulkerson, D. R.: Flows in Networks. Princeton University Press, Princeton (1962).
27. Galil, Z.: Applications of Efficiently Mergeable Heaps for Optimization Problems on Trees. Acta Informatica, 13, 53-58 (1980).
28. Gillies, D.: Solutions to General Nonzero Sum Games. Annals of Mathematical Studies, 40, 47-85 (1959).
29. Goemans, M. X., Skutella, M.: Cooperative Facility Location Games. Journal of Algorithms, 50, 194-214 (2004).
30. Granot, D.: A Note on the Roommate Problem and a Related Revenue Allocation Problem. Management Science, 30, 633-643 (1984).
31. Granot, D.: A Generalized Linear Production Model: A Unified Model. Mathematical Programming, 34, 212-222 (1986).
32. Granot, D., Granot, F.: Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem. Mathematics of Operations Research, 17, 765-780 (1992).
33. Granot, D., Huberman, G.: Minimum Cost Spanning Tree Games. Mathematical Programming, 21, 1-18 (1981).
34. Granot, D., Huberman, G.: On the Core and Nucleolus of Minimum Cost Spanning Tree Games. Mathematical Programming, 29, 323-347 (1984).
35. Granot, D., Maschler, M., Owen, G., Zhu, W. R.: The Kernel/Nucleolus of a Standard Tree Game. International Journal of Game Theory, 25, 219-244 (1996).
36. Granot, D., Granot, F., Zhu, W. R.: Characterization Sets for the Nucleolus. International Journal of Game Theory, 27, 359-374 (1998).
37. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Hong Kong (1988).
38. Hallefjord, Å., Helming, R., Jornsten, K.: Computing the Nucleolus when the Characteristic Function is Given Implicitly: A Constraint Generation Approach. International Journal of Game Theory, 24, 357-372 (1995).
39. Hamers, H., Granot, D., Tijs, S.: On Some Balanced, Totally Balanced and Submodular Delivery Games. Program and Abstract of 16th International Symposium on Mathematical Programming, 118 (1997).
40. Kalai, E., Zemel, E.: Totally Balanced Games and Games of Flow. Mathematics of Operations Research, 7, 476-478 (1982).
41. Kalai, E., Zemel, E.: Generalized Network Problems Yielding Totally Balanced Games. Operations Research, 30, 998-1008 (1982).
42. Kern, W., Paulusma, D.: Matching Games: The Least Core and the Nucleolus. Mathematics of Operation Research, 28, 294-308 (2003).
43. Kolen, A. J. W.: Solving Covering Problems and the Uncapacitated Plant Location Problem on Trees. European Journal of Operational Research, 12, 266-278 (1983).
44. Kopelowitz, A.: Computation of the Kernels of Simple Games and the Nucleolus of n-Person Games. RM-31, Math. Dept., The Hebrew University of Jerusalem (1967).
45. Kuipers, J.: Minimum Cost Forest Games. International Journal of Game Theory, 26, 367-377 (1997).
46. Kuipers, J.: A Polynomial Time Algorithm for Computing the Nucleolus of Convex Games. Program and Abstracts of the 16th International Symposium on Mathematical Programming, 156 (1997).
47. Lemaire, J.: AnApplicationofGameTheory: CostAllocation. ASTINBulletin, 14, 61-81 (1984).
48. Littlechild, S. C.: A Simple Epression for the Nucleolus in a Special Case. International Journal of Game Theory, 3, 21-29 (1974).
49. Malkevitch, J.: Resolving Bankruptcy Claims. Feature Column, Monthly Essays on Mathematical Topics, AMS, March (2005). Available at: http://www. ams. org/featurecolumn/index. html.
50. Megiddo, N.: Computational Complexity and the Game Theory Approach to Cost Allocation for a Tree. Mathematics of Operations Research, 3, 189-196 (1978).
51. Megiddo, N.: Cost Allocation for Steiner Trees. Networks, 8, 1-6 (1978).
52. Maschler, M., Peleg, B., Shapley, L. S.: Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts. Mathematics of Operations Research, 4, 303-338 (1979).
53. Nagamochi, H., Zeng, D., Kabutoya, N., Ibaraki, T.: Complexity of the Minimum Base Games on Matroids. Mathematics of Operations Research, 22, 146-164 (1997).
54. Neyman, A.: Bounded Complexity Justifies Cooperation in the Finitely Repeated Prisoner's Dilemma. Economics Letters, 19, 227-229 (1985).
55. Okamoto, Y.: Fair Cost Allocations under Conflicts: A Game-Theoretic Point of View. International Symposium on Algorithms and Computation (ISAAC), 686-695 (2003).
56. Owen, G.: On the Core of Linear Production Games. Mathematical Programming, 9, 358-370 (1975).
57. Papadimitriou, C. H., Yannakakis, M.: On complexity as Bounded Rationality. Proceedings of the 26th ACM Symposium on the Theory of Computing, 726-733 (1994).
58. Potters, J., Curiel, I., Tijs, S.: Traveling Salesman Games. Mathematical Programming, 53, 199-211 (1992).
59. Potters, J., Reijnierse, J. H., Ansing, M.: Computing the Nucleolus by Solving a Prolonged Simplex Algorithm. Mathematics of Operation Research, 21, 757-768 (1996).
60. Raghavan, T. E. S., Solymosi, T.: An Algorithm to Locate the Nucleolus Prices for a Real Estate Game. GPI XII (1998).
61. Schmeidler, D.: The Nucleolus of a Characteristic Function Game. SIAM Journal of Applied Mathematics, 17, 1163-1170 (1969).
62. Shapley, L. S.: On Balanced Sets and Cores. Naval Research Logistics Quarterly, 14, 453-460 (1967).
63. Shapley, L. S., Shubik, M.: The Assignment Game. International Journal of Game Theory, 1, 111-130 (1972).
64. Shapley, L., Shubik, M.: Quasi-Cores in a Monetary Economy with Nonconvex Preference. Econometrica, 34, 805-827 (1966).
65. Shubik, M.: Game Theory Models and Methods in Political Economy. In Arrow, Intriligator (eds) Handbook of Mathematical Economics, Vol. I, 285-330. North-Holland, New York (1981).
66. Simon, H. A.: Theories of Bounded Rationality. In: Radner, C., Radner, R. (eds.) Decision and Organization. Amsterdam: North-Holland. 161-176 (1972).
67. Solymosi, T., Raghavan, T. E. S.: An Algorithm for Finding the Nucleolus of Assignment Games. International Journal of Game Theory, 23, 119-143 (1994).
68. Tamir, A.: On the Core of Cost Allocation Games Defined on Location Problems. Transportation Science, 27, 81-86 (1992).
69. Tamir, A.: On the Core of Network Synthesis Games. Mathematical Programming, 50, 123-135 (1991).
70. Tamir, A.: On the Core of a Traveling Salesman Cost Allocation Game. Operations Research Letters, 8, 31-34 (1989).
71. Tamir, A., Mitchell, J. S. B.: A Maximum b-Matching Problem Arising from Median Location Models with Applications to the Roommate Problem. Mathematical Programming, 80, 171-194 (1998).
72. Tijs, S., Driessen, T.: Extensions of Solution Concepts by Means of Multiplicative ε-Tax Games. Mathematical Social Sciences, 12, 9-20 (1986).
73. Velzen, B. V.: Dominating Set Game. Operations Research Letters, 32, 565-573 (2004).