Convex and exact games with non-transferable utility
From MaRDI portal
Publication:617519
DOI10.1016/j.ejor.2010.08.004zbMath1205.91021OpenAlexW2168654026MaRDI QIDQ617519
László Á. Kóczy, Péter Csóka, P. Jean-Jacques Herings, Miklós Pintér
Publication date: 21 January 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/34620/1/ConvexAndExactNTUFinal.pdf
Related Items (7)
On Bargaining Sets of Convex NTU Games ⋮ A cardinal convex game with empty core ⋮ Optimal coalition formation and surplus distribution: two sides of one coin ⋮ A note on the core ⋮ Balancedness conditions for exact games ⋮ Nontransferable utility bankruptcy games ⋮ The bargaining set for almost-convex games
Cites Work
- Unnamed Item
- Unnamed Item
- Stable allocations of risk
- On the core, the Weber set and convexity in games with a priori unions
- Convex multi-choice games: characterizations and monotonic allocation schemes
- Game theoretic analysis of a bankruptcy problem from the Talmud
- A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution
- Sequencing games
- Convex games without side payments
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Large cores and exactness
- A note on NTU convexity
- Punishment strategies make the \(\alpha\)-coalitional game ordinally convex and balanced
- Multi-issue allocation situations
- An extension of the \(\tau\)-value to games with coalition structures.
- A necessary and sufficient condition for non-emptiness of the core of a non-transferable utility game
- The kernel/nucleolus of a standard tree game
- Cores of convex games
- Cores of exact games. I
- Cores of Convex Games Without Side Payments
- Nonmanipulable Cores
- A Simple Expression for the Shapley Value in a Special Case
This page was built for publication: Convex and exact games with non-transferable utility
