On the core of ordered submodular cost games

Mathematical Programming, Series B

Volumn 87, Issue 3, 2000, Pages 483-499

  Faigle, Ulrich ^a   Kern, Walter ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Core; Greedy algorithm; Monge property; N person game; Order; Polymatroid; Poset; Submodular

Indexed keywords

EID: 29044441372     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050008     Document Type: Article

References (21)

1. Birkhoff, G. (1967): Lattice Theory. 3rd ed. American Mathematical Society Colloquium Publication 25, Providence, R.I.
2. Bondareva, O.N. (1963): Some applications of linear programming to the theory of cooperative games. Problemy Kibernet 10, 119-139 (in Russian)
3. Burkard, R.E., Klinz, B., Rudolf, R. (1996): Perspectives of Monge properties in optimization. Discrete Appl. Math. 70, 95-161
4. Deng, X., Papadimitriou, C.H. (1994): On the complexity of cooperative solution concepts. Math. Oper. Res. 19, 257-266
5. Dilworth, R.P. (1950): A decomposition theorem for partially ordered sets. Ann. Math. 51, 161-166
6. Edmonds, J. (1970): Submodular functions, matroids, and certain polyhedra. In: Guy, R., et al., eds., Combinatorial Structures and their Applications, 69-87. Gordon and Breach
7. Edmonds, J., Giles, R. (1977): A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185-204
8. Faigle, U. (1989): Cores of games with restricted cooperation. ZOR - Methods Models Oper. Res. 33, 405-422
9. Faigle, U., Kern, W. (1996): Submodular linear programs on forests. Math. Program. 72, 195-206
10. Fujishige, S. (1991): Submodular Functions and Optimization. Ann. Discrete Math. 47, North-Holland, Amsterdam
11. Garey, M.R., Johnson, D.S. (1979): Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, New York
12. Greene, C. (1976): Some partitions associated with a partially ordered set. J. Comb. Theory Ser. A 20, 69-79
13. Hoffman, A.J. (1963): On simple linear programming problems. In: Klee, V., ed., Convexity. Proc. of Symposia in Pure Mathematics, vol. 7, Amer. Math. Soc., Providence, RI
14. Hoffman, A.J. (1982): Ordered sets and linear programming. In: Rival, I., ed., Ordered Sets, pp. 619-654. Reidel
15. Ichishi, T. (1981): Super-modularity: Applications to convex games and to the greedy algorithm for LP. J. Econ. Theory 25, 283-286
16. von Neumann, J., Morgenstern, O. (1944): Theory of Games and Economic Behavior. Princeton University Press, 1944, 1947
17. Queyranne, M., Spieksma, F., Tardella, F. (1993): A general class of greedily solvable linear programs. In: Faigle, U., Hoede, C., eds., 3rd Twente Workshop on Graphs and Combinatorial Optimization. Memorandum No. 1132, Dept. of Applied Mathematics, University of Twente
18. Schrijver, A. (1986): Theory of Linear and Integer Programming. Wiley-Interscience, Chichester
19. Shapley, L.S. (1967): On balanced sets and cores. Nav. Res. Log. Quarterly 14, 453-460
20. Shapley, L.S. (1971): Cores and convex games. Int. J. Game Theory 1, 1-26
21. Sharkey, W.W. (1990): Cores of games with fixed costs and shared facilities. Int. Econ. Rev. 30, 245-262