Complexity of the minimum base game on matroids

Mathematics of Operations Research

Volumn 22, Issue 1, 1997, Pages 146-164

  Nagamochi, Hiroshi ^a   Zeng, Dao Zhi ^b   Kabutoya, Naohisa ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

^b KAGAWA UNIVERSITY   (Japan)

Author keywords

Computational complexity; Cooperative game; Core; Graph; Matroid; Shapley value; value

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS; SET THEORY; TREES (MATHEMATICS);

EDGE WEIGHTED GRAPH; MATROID THEORY; MINIMUM BASE GAME (MBG); MINIMUM SPANNING TREE GAME (MSTG); ORACLE POLYNOMIAL ALGORITHM;

GAME THEORY;

EID: 0031073752     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.1.146     Document Type: Article

References (16)

1. Cunningham, H. W. (1984). Testing membership in matroid polyhedra. J. Combinatorial Theory, B 36, 161-188.
2. Curiel, I. J. (1988). Cooperative Game Theory and Applications, Ph.D. Dissertation, University of Nijmegen, The Netherlands.
3. Deng, X., C. H. Papadimitriou (1994). On the complexity of cooperative solution concepts. Math. Oper. Res. 19 257-266.
4. Fredman, M. L., R. E. Tarjan (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Compu. Mach. 34 596-615.
5. Granot, D., G. Huberman (1981). On minimum cost spanning tree games. Math. Programming 21 1-18.
6. _, G. Huberman (1984). On the core and nucleolus of minimum cost spanning tree games. Math. Programming 29 323-347.
7. Grötschel, M., L. Lovász, A. Schrijver (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 169-197.
8. Jensen, P. M., B. Korte (1982). Complexity of matroid algorithms. SIAM J. Comput. 11 183-190.
9. van den Nouweland, A. (1993). Games and Graphs in Economic Situations. Ph.D. Dissertation, University of Nijmegen, The Netherlands.
10. Shapley, L. S. (1953). A value for n-person games. In Contributions to the Theory of Games, II, No. 28, Kuhn and Tucker, eds., Princeton University Press, Princeton, NJ, 307-317.
11. _ (1971). Cores of convex games, Internat. J. Game Theory 1 11-26.
12. Shubik, M. (1981). Game theory models and methods in political economy. In Handbook of Mathematical Economics, I. Arrow and Intriligator, eds., North-Holland, New York, 285-330.
13. Tarjan, R. E. (1972). Depth-first search and linear graph algorithms. SIAM J. Comput. 1 146-160.
14. Tijs, S. H. (1981). Bounds for the core and the τ-value. In Game Theory and Mathematical Economics, O. Moeschlin and D. Pallaschke, eds., North-Holland Publishing Company, Amsterdam, 123-132.
15. Valiant, L. G. (1979). The complexity of enumeration and reliability problems. SIAM J. Comput. 8 410-421.
16. Welsh, D. J. A. (1976). Matroid Theory. Academic Press, London.