The boundary of the core of a balanced game: face games
From MaRDI portal
Publication:776857
DOI10.1007/s00182-019-00703-2zbMath1471.91018OpenAlexW2999862204MaRDI QIDQ776857
Miguel Ángel Mirás Calvo, Carmen Quinteiro Sandomingo, Estela Sánchez Rodríguez
Publication date: 13 July 2020
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-019-00703-2
Cites Work
- Unnamed Item
- A precedence constraint value revisited
- Airport games: the core and its center
- An average lexicographic value for cooperative games
- Balancedness conditions for exact games
- Assignment games satisfy the CoMa-property
- On the reduced game property and its converse
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The Shapley value for cooperative games under precedence constraints
- On extreme points of the core and reduced games
- Large cores and exactness
- Characterization of the extreme core allocations of the assignment game.
- A bankruptcy approach to the core cover
- Cores of convex and strictly convex games
- Cores of convex games
This page was built for publication: The boundary of the core of a balanced game: face games
