Fair cost allocations under conflicts - A game-theoretic point of view

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 686-695

  Okamoto, Yoshio ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COST ACCOUNTING;

CONFLICT SITUATION; COOPERATIVE GAME; COST ALLOCATION; COST ALLOCATION PROBLEM; GAME-THEORETIC; SHAPLEY VALUE;

GAME THEORY;

EID: 33748414457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_70     Document Type: Review

References (25)

1. I.J. Curiel: Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems. Kluwer Academic Publishers, Dordrecht, 1997.
2. X. Deng, T. Ibaraki and H. Nagamochi: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24 (1999) 751-766.
3. X. Deng, T. Ibaraki, H. Nagamochi and W. Zang: Totally balanced combinatorial optimization games. Math. Program. 87 (2000) 441-452.
4. T. Driessen: Cooperative Games, Solutions and Applications. Kluwer Academic Publishers, Dordrecht, 1988.
5. U. Faigle and W. Kern: The Shapley value for cooperative games under precedence constraints. Internat. J. Game Theory 21 (1992) 249-266.
6. U. Faigle, W. Kern and J. Kuipers: Computing the nucleolus of min-cost spanning tree games is NP-hard. Internat. J. Game Theory 27 (1998) 443-450.
7. U. Faigle, W. Kern and J. Kuipers: On the computation of the nucleolus of a cooperative game. Internat. J. Game Theory 30 (2001) 79-98.
8. D.R. Fulkerson and O.A. Gross: Incidence matrices and interval graphs. Pacific J. Math. 15 (1965) 835-855.
9. D.B. Gillies: Some theorems on n-person games. Ph.D. Thesis, Princeton University, 1953.
10. M.C. Golumbic: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
11. M. Grötschel, L. Lovász and A. Schrijver: Geometric algorithms and combinatorial optimization. Second edition. Springer-Verlag, Berlin, 1993.
12. A. Kopelowitz: Computation of the kernels of simple games and the nucleolus of n-person games. RM 31, Research Program in Game Theory and Mathematical Economics, The Hebrew University of Jerusalem, 1967.
13. J. Kuipers: A polynomial time algorithm for computing the nucleolus of convex games. Report M 96-12, Maastricht University, 1996.
14. L. Lovász: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2 (1972) 253-267.
15. M. Maschler, B. Peleg and L.S. Shapley: Geometric properties of the kernel, nucleolus and related solution concepts. Math. Oper. Res. 4 (1979) 303-338.
16. T. Matsui and Y. Matsui: A survey of algorithms for calculating power indices of weighted majority games. J. Oper. Res. Soc. Japan 43 (2000) 71-86.
17. N. Megiddo: Computational complexity and the game theory approach to cost allocation for a tree. Math. Oper. Res. 3 (1978) 189-196.
18. H. Mohri and Y. Okamoto: Discrete optimization and cooperative games (2). (In Japanese.) Comm. Oper. Res. Soc. Japan 48 (2003) 114-120.
19. J.S. Provan and M.O. Ball: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12 (1983) 777-788.
20. Y. Okamoto: Submodularity of some classes of the combinatorial optimization games. Math. Methods Oper. Res. 58 (2003), to appear.
21. D. Schmeidler: The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17 (1969) 1163-1170.
22. L.S. Shapley: Cores of convex games. Internat. J. Game Theory 1 (1971) 11-26. Errata is in the same volume, 1972, pp. 199.
23. L.S. Shapley: A value for n-person games. In: H. Kuhn and A.W. Tucker eds., Contributions to the Theory of Games II, Princeton University Press, Princeton, New Jersey, 1953, 307-317.
24. T. Solymosi and T.E.S. Raghavan: An algorithm for finding the nucleolus of assignment games. Internat. J. Game Theory 23 (1994) 119-143.
25. S.H. Tijs: Bounds for the core and the τ-value. In: O. Moeshlin and P. Pallaschke, eds., Game Theory and Mathematical Economics, North Holland, Amsterdam, 1981, 123-132.