zbMATH — the first resource for mathematics

Super-modularity: Applications to convex games and to the greedy algorithm for LP. (English) Zbl 0478.90092

91A12 Cooperative games
91B50 General equilibrium theory
90C05 Linear programming
Full Text: DOI
[1] Edmonds, J, Submodular functions, matroids, and certain polyhedra, (), 69-87
[2] Shapley, L.S, A value for n-person games, (), 307-317 · Zbl 0050.14404
[3] Shapley, L.S, Cores of convex games, Internat. J. game theory, 1, 11-26, (1971) · Zbl 0222.90054
[4] Weber, R.J, Probabilistic values for games, (1978), Yale University, mineo
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.