Convex and exact games with non-transferable utility
From MaRDI portal
Publication:617519
DOI10.1016/J.EJOR.2010.08.004zbMATH Open1205.91021OpenAlexW2168654026MaRDI QIDQ617519FDOQ617519
Authors: Péter Csóka, P. Jean-Jacques Herings, László Á. Kóczy, 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
Recommendations
- Undominated nonnegative excesses and core extensions of transferable utility games
- A note on solution concepts for nontransferable utility games
- Existence of solutions of games with some non-convexity
- Almost Pure Nash Equilibria in Convex Noncooperative Games
- Some characterizations of convex games
- Non-convexity in noncooperative game theory
- scientific article; zbMATH DE number 722173
- A new axiomatization of the core of games with transferable utility
- scientific article; zbMATH DE number 3062461
- On constructing games with a convex set of equilibrium strategies
Cites Work
- Game theoretic analysis of a bankruptcy problem from the Talmud
- A Simple Expression for the Shapley Value in a Special Case
- Sequencing games
- The kernel/nucleolus of a standard tree game
- Cores of convex games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- A necessary and sufficient condition for non-emptiness of the core of a non-transferable utility game
- On the core, the Weber set and convexity in games with a priori unions
- An extension of the \(\tau\)-value to games with coalition structures.
- Cores of exact games. I
- Stable allocations of risk
- Convex multi-choice games: characterizations and monotonic allocation schemes
- Multi-issue allocation situations
- Convex games without side payments
- A note on NTU convexity
- Cores of Convex Games Without Side Payments
- Title not available (Why is that?)
- Large cores and exactness
- Title not available (Why is that?)
- A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution
- Punishment strategies make the \(\alpha\)-coalitional game ordinally convex and balanced
- Nonmanipulable Cores
Cited In (14)
- Nontransferable utility bankruptcy games
- A note on the convergence of transfer sequences in \(n\)-person games
- Optimal coalition formation and surplus distribution: two sides of one coin
- Existence of solutions of games with some non-convexity
- Minimal exact balancedness
- A NOTE ON NTU CONVEXITY AND POPULATION MONOTONIC ALLOCATION SCHEMES
- The bargaining set for almost-convex games
- Strong convexity of NTU games
- Consistent extensions and subsolutions of the core for the multichoice transferable-utility games
- A note on the core
- A cardinal convex game with empty core
- On Bargaining Sets of Convex NTU Games
- Balancedness conditions for exact games
- A note on NTU convexity
This page was built for publication: Convex and exact games with non-transferable utility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617519)
