Cores of convex games

@article{Shapley1971CoresOC,
  title={Cores of convex games},
  author={L. S. Shapley},
  journal={International Journal of Game Theory},
  year={1971},
  volume={1},
  pages={11-26}
}
  • L. S. Shapley
  • Published 1971
  • Mathematics
  • International Journal of Game Theory
  • The core of ann-person game is the set of feasible outcomes that cannot be improved upon by any coalition of players. A convex game is defined as one that is based on a convex set function. In this paper it is shown that the core of a convex game is not empty and that it has an especially regular structure. It is further shown that certain other cooperative solution concepts are related in a simple way to the core: The value of a convex game is the center of gravity of the extreme points of the… CONTINUE READING
    1,470 Citations
    Largeness of the Core of k-Convex Symmetric Games
    • A. Biswas
    • Mathematics, Computer Science
    • IGTR
    • 2013
    Characterization of the extreme core allocations of the assignment game
    • 33
    • PDF
    A Hierarchical Model for Cooperative Games
    • 7
    The Core for Games with Cooperation Structure
    ALL CONVEX GAMES ARE DIRECTIONALLY CONVEX MEASURE GAMES
    Some properties of the core on convex geometries
    • Y. Okamoto
    • Computer Science, Mathematics
    • Math. Methods Oper. Res.
    • 2003
    • 4
    • PDF
    The Shapley value and average convex games
    • 33
    • Highly Influenced

    References

    SHOWING 1-10 OF 12 REFERENCES
    COMPOSITION OF GENERAL SUM GAMES.
    • 1
    Theory of Games and Economic Behavior.
    • 15,185
    • PDF
    Theory of capacities
    • 3,527
    • PDF
    A game with no solution
    • 116
    • PDF
    3. Solutions to General Non-Zero-Sum Games
    • 563
    Cores of Exact Games, I*
    • 209
    Games And Decisions
    • 2,920