Abstract
If marginal worth vector of a game for an ordering is in the core, the game does not have to be a p.c. game.
Similar content being viewed by others
References
Granot, D. and Huberman, G.: 1982, ‘The relationship between convex games and minimum spanning tree games: A case for permutationally convex games’,SIAM Journal of Algebra and Discrete Methods 3, 288–292.
Ichiishi, T.: 1981, ‘Super-modularity: Application to Convex Games and to Greedy Algorithm for LP’,Journal of Economic Theory 25, 283–286.
Shapley, L. S.: 1971, ‘Core of Convex Games’,Int. J. Game Theory,1, 11–26.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Alidaee, B. A note on the permutationally convex games. Theor Decis 30, 109–111 (1991). https://doi.org/10.1007/BF00134118
Issue Date:
DOI: https://doi.org/10.1007/BF00134118