Submodularity of some classes of the combinatorial optimization games

Mathematical Methods of Operations Research

Volumn 58, Issue 1, 2003, Pages 131-139

  Okamoto, Yoshio ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Combinatorial optimization; Game theory; Submodularity

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

COMBINATORIAL OPTIMIZATION; FREQUENCY BANDS; SUBMODULAR MINIMUM COLORING GAMES; SUBMODULARITY;

GAME THEORY;

EID: 1642611386     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860300284     Document Type: Article

References (18)

1. Bilbao JM (2000) Cooperative Games on Combinatorial Structures, Kluwer Academic Publishers, Boston
2. Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1998) Combinatorial Optimization, John Wiley and Sons, New York
3. Curiel IJ (1997) Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems. Kluwer Academic Publishers, Dordrecht
4. Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research 24:751-766
5. Deng X, Ibaraki T, Nagamochi H, Zang W (2000) Totally balanced combinatorial optimization games. Mathematical Programming 87:441-452
6. Diestel R (2000) Graph Theory 2nd edn., Springer-Verlag, New York, 1997
7. Edmonds J (1971) Matroids and the greedy algorithm. Mathematical Programming 1:127-136
8. Fujishige S (1991) Submodular functions and optimization, North-Holland, Amsterdam
9. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum Press, New York, 85-103
10. Korte B, Vygen J (2000) Combinatorial Optimization. Springer-Verlag, Berlin
11. Kuiper J (1996) A polynomial time algorithm for computing the nucleolus of convex games. Report M 96-12, Maastricht University
12. Maschler M, Peleg B, Shapley L (1972) The kernel and bargaining set of convex games. International Journal of Game Theory 2:73-93
13. Murota K (2000) Matrices and Matroids for Systems Analysis. Springer-Verlag, Berlin
14. Oxley J (1992) Matroid Theory. Oxford University Press, New York
15. Rado R (1957) Note on independence functions. Proceedings of the London Mathematical Society 7:300-320
16. Shapley L (1972) Cores of convex games. International Journal of Game Theory. 1:11-26. Errata is in the same volume, 1972, pp. 199
17. Shapley L, Shubik M (1972) Assignment games I. the core. International Journal of Game Theory 1:111-130
18. Tijs S (1981) Bounds for the core and the τ-value. In: Moeschlin O, Pallaschke P (eds) Game Theory and Mathematical Economics. North Holland, Amsterdam, 123-132