Finding nucleolus of flow game

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 124-131

  Deng, Xiaotie ^a   Fang, Qizhi ^b   Sun, Xiaoxun ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b OCEAN UNIVERSITY OF CHINA   (China)

Author keywords

Efficient algorithm; Flow game; LP duality; NP hard; Nucleolus

Indexed keywords

ALGORITHMS; CALCULATIONS; LINEAR PROGRAMMING; POLYNOMIALS;

EFFICIENT ALGORITHM; FLOW GAME; LP DUALITY; NP-HARD; NUCLEOLUS;

GAME THEORY;

EID: 33244479158     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109572     Document Type: Conference Paper

References (28)

1. R. J. Aumann and M. Maschler, Game theoretic analysis of a bankruptcy problem from the Talmud, Journal of Economic Theory, 36 (1985), pp. 195-396.
2. Branzei, R., Solymosi, T. and Tijs, S.H. Strongly Essential Coalitions and the Nucleolus of Peer Group Games, CentER Discussion Paper 2003-19.
3. X. Deng, T. Ibaraki and H. Nagamochi, Algorithmic aspects of the core of combinatorial optimization games, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, (1997), pp. 720-729.
4. X. Deng and C. H. Papadimitriou , On the complexity of cooperative solution concepts, Mathematics of Operations Research, 19 (1994), pp. 257-266.
5. J. Edmonds, Paths, Trees, and Flowers, Canadian Journal of Mathematics, 17 (1965), pp. 449-467.
6. Q. Fang, S. Zhu, M. Cai, X. Deng, Membership for core of LP games and other games, Lecture notes in computer science 2108, (2001), pp. 247-256.
7. U. Faigle and W. Kern, Partition games and the core of hierarchically convex cost games, Universiteit Twente, faculteit der toegepaste wiskunde, Memorandum, No. 1269, 1995.
8. U. Faigle, W. Kern and J. Kuipers, Computing the nucleolus of min-cost spanning tree games isNP-hard, International Journal of Game Theory, 27 (1998), pp. 443-450.
9. U. Faigle, W. Kern and J. Kuipers, On the computation of the nucleolus of a cooperative game, International Journal of Game Theory, 30 (2001), pp. 79-98.
10. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
11. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1993.
12. M. X. Goemans and M. Skutella, Cooperative facility location games, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, (2000), pp. 76-85.
13. D. Granot, F. Granot and W. R. Zhu, Characterization sets for the nucleolus, International Journal of Game Theory, 27 (1998), pp. 359-374.
14. D. Granot, M. Maschler, G. Owen and W. R. Zhu, The kernel/nucleolus of a standard tree game, International Journal of Game Theory, 25 (1996), pp. 219-244.
15. G. Huberman, The nucleolus and the essential coalitions, In: Analysis and Optimizations of Systems, pp. 416-422, Springer, Berlin, 1980.
16. E. Kalai and E. Zemel, Totally balanced games and games of flow, Mathematics of Operations Research, 7 (1982), pp. 476-478.
17. E. Kalai and E. Zemel, Generalized network problems yielding totally balanced games, Operations Research, 30 (1982), pp. 498-1008.
18. W. Kern and D. Paulusma, Matching games: the least core and the nucleolus, Mathematics of Operations Research, 28 (2003), pp. 294-308.
19. A. Kopelowitz, Computation of the kernels of simple games and the nucleolus of n-person games, RM-31, Math. Dept., The Hebre University of Jerusalem, 1967.
20. J. Kuipers T. Solymosi and H. Aarts , Computing the nucleolus of some combinatorially structured games, Mathematical Programming, 88 (2000), pp. 541-563.
21. Jean Lemaire, Lemaire, Jean, An Application of Game Theory: Cost Allocation, ASTIN Bulletin 14, 1 (1984), pp. 61-81.
22. Joe Malkevitch, Resolving Bankruptcy Claims, Feature Column, Monthly Essays on Mathematical Topics, AMS, March 2005. http://www.ams.org/ featurecolumn/index.html.
23. N. Megiddo, Computational complexity and the game theory approach to cost allocation for ta tree, Mathematics of Operations Research, 3 (1978), pp. 189-196.
24. G. Owen, On the core of linear production games, Mathematical Programming, 9 (1975), pp. 358-370.
25. T.E.S. Raghavan, T. Solymosi, An Algorithm to Locate the Nucleolus Prices for a Real Estate Game, GPI XII, 1998.
26. D. Schmeidler, The nucleolus of a characteristic function game, SIAM Journal of Applied Mathematics, 17 (1969), pp. 1163-1170.
27. T. Solymosi and T. E. S. Raghavan, An algorithm for finding the nucleolus of assignment games, International Journal of Game Theory, 23 (1994), pp. 119-143.
28. L. S. Shapley and M. Shubik, The assignment game, International Journal of Game Theory, 1 (1972), pp. 111-130.