Assignment games satisfy the CoMa-property. (English) Zbl 1018.91006
Besides the class of convex games and the class of information games, the authors add one more class of games which satisfy the CoMa-property which means that if a game has a nonempty core, the extreme points of its core are marginal vectors.
Reviewer: Chih Chang (Hsinchu)
MSC:
| 91A12 | Cooperative games |
References:
| [1] | Bondareva, O., Some Applications of Linear Programming Methods to the Theory of Cooperative Games, Problemi Kibernet, 10, 119-139 (1963) · Zbl 1013.91501 |
| [2] | Chvátal, V., Linear Programming (1983), Freeman: Freeman New York · Zbl 0318.05002 |
| [3] | Granot, D.; Huberman, G., Minimum Cost Spanning Tree Games, Math. Programming, 21, 1-18 (1981) · Zbl 0461.90099 |
| [4] | Ichiishi, T., Super-Modularity: Applications to Convex Games and the Greedy Algorithm for LP, J. Econ. Theory, 25, 283-286 (1981) · Zbl 0478.90092 |
| [5] | Kuipers, J., On the Core of Information Graph Games, Internat. J. Game Theory, 21, 339-350 (1993) · Zbl 0801.90149 |
| [6] | Shapley, L., On Balanced Sets and Cores, Naval Res. Logist. Quart., 14, 453-460 (1967) |
| [7] | Shapley, L., Cores of Convex Games, Internat. J. Game Theory, 1, 11-26 (1971) · Zbl 0222.90054 |
| [8] | Shapley, L.; Shubik, M., The Assignment Game. I. The Core, Internat. J. Game Theory, 1, 111-130 (1972) · Zbl 0236.90078 |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
