Totally balanced combinatorial optimization games

Mathematical Programming, Series B

Volumn 87, Issue 3, 2000, Pages 441-452

  Deng, Xiaotie ^a   Ibaraki, Toshihide ^b   Nagamochi, Hiroshi ^b   Zang, Wenan ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b KYOTO UNIVERSITY   (Japan)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Combinatorial optimization; Cooperative games; Duality theory; Total balancedness

Indexed keywords

EID: 0007381610     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050005     Document Type: Article

References (12)

1. Curiel, I.J. (1988): Cooperative Game Theory and Applications. Ph.D. Dissertation, University of Nijmegen, The Netherlands
2. Dantzig, G.B. (1963): Linear Programming and Extensions. Princeton University Press, Princeton
3. Deng, X., Ibaraki, T., Nagamochi, H. (1999): Algorithms aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751-766
4. Faigle, U., Kern, W., Fekete, S., Hochstättler, W. (1998): The nucleon of cooperative games and an algorithm for matching games. Math. Program. 83, 195-211
5. Faigle, U., Kern, W. (2000): On the core of ordered submodular cost games. Math. Program., DOI 10.1007/s101070000132
6. Grötschel, M., Lovász, L., Schrijver, A. (1988): Geometric algorithms and combinatorial optimization. Springer-Verlag
7. Kalai, E., Zemel, E. (1982): Totally balanced games and games of flow. Math. Oper. Res. 7, 476-478
8. Kalai, E., Zemel, E. (1982): Generalized network problems yielding totally balanced games. Oper. Res. 30, 998-1008
9. Owen, G. (1975): On the core of linear production games. Math. Program. 9, 358-370
10. Shapley, L.S. (1967): On balanced sets and cores. Nav. Res. Logist. Quarterly 14, 453-460
11. Shapley, L.S., Shubik, M. (1969): On market games. J. Econ. Theory 1, 9-25
12. Shapley, L.S., Shubik, M. (1972): The assignment game. Int. J. Game Theory 1, 111-130