Solution concepts for games with general coalitional structure
From MaRDI portal
Publication:2452810
DOI10.1016/j.mathsocsci.2013.12.004zbMath1291.91017OpenAlexW3123651353MaRDI QIDQ2452810
Adolphus J. J. Talman, Gleb A. Koshevoy
Publication date: 5 June 2014
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2013.12.004
Related Items (6)
Stable Cooperation in a Game with a Major Player ⋮ Games with nested constraints given by a level structure ⋮ Cooperative games with partial information ⋮ Cooperative games with restricted formation of coalitions ⋮ The average covering tree value for directed graph games ⋮ The average tree value for hypergraph games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid polytopes, nested sets and Bergman fans
- Nested complexes and their polyhedral realizations
- Monge extensions of cooperation and communication structures
- Generalized polymatroids and submodular flows
- The Shapley value for cooperative games under precedence constraints
- The Myerson value for union stable structures
- The Shapley value on convex geometries
- Cores of cooperative games, superdifferentials of functions, and the Minkowski difference of sets
- Hierarchical organization structures and constraints on coalition formation
- The average tree solution for cooperative games with communication structure
- Mathematics of Plott choice functions
- Introduction to Toric Varieties. (AM-131)
- Graphs and Cooperation in Games
This page was built for publication: Solution concepts for games with general coalitional structure
