Ichiishi, Tatsuro Super-modularity: Applications to convex games and to the greedy algorithm for LP. (English) Zbl 0478.90092 J. Econ. Theory 25, 283-286 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 109 Documents MSC: 91A12 Cooperative games 91B50 General equilibrium theory 90C05 Linear programming Keywords:sub-modularity; convex game; core; Shapley value; marginal worth vector; super-modularity; greedy algorithm; super-modular function PDF BibTeX XML Cite \textit{T. Ichiishi}, J. Econ. Theory 25, 283--286 (1981; Zbl 0478.90092) Full Text: DOI References: [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.