Stable sets and max-convex decompositions of TU games
From MaRDI portal
Publication:356514
DOI10.1007/S11750-011-0177-9zbMath1269.91010OpenAlexW2072109237MaRDI QIDQ356514
Carles Rafels, Francesc Llerena
Publication date: 26 July 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0177-9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Shapley value on some lattices of monotonic games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- On the cores of cooperative games and the stability of the Weber set
- An intersection theorem in TU cooperative game theory
- The vector lattice structure of the \(n\)-person TU games
- Cores of convex games
- A game with no solution
- Introduction to the Theory of Cooperative Games
This page was built for publication: Stable sets and max-convex decompositions of TU games
