Pages that link to "Item:Q1069868"
From MaRDI portal
The following pages link to A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution (Q1069868):
Displaying 16 items.
- Strong convexity of NTU games (Q444126) (← links)
- Convex and exact games with non-transferable utility (Q617519) (← links)
- Cores and large cores when population varies (Q752022) (← links)
- An axiomatization of the weighted NTU value (Q806695) (← links)
- Comparative cooperative game theory (Q922303) (← links)
- Computing the cores of strategic games with punishment-dominance relations (Q933749) (← links)
- von Neumann-Morgenstern stable sets of income tax rates in public good economies (Q943346) (← links)
- Stability of topological effectivity functions (Q1096517) (← links)
- A consistent bargaining set (Q1124543) (← links)
- Core equivalence theorems for infinite convex games (Q1371185) (← links)
- Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof (Q1645200) (← links)
- On the sensitivity of von Neumann and Morgenstern abstract stable sets: The stable and the individual stable bargaining set (Q2367179) (← links)
- Von Neumann-Morgenstern stable sets in matching problems (Q2373788) (← links)
- On Bargaining Sets of Convex NTU Games (Q3459301) (← links)
- STABILITY OF THE CORE IN A CLASS OF NTU GAMES: A CHARACTERIZATION (Q4797300) (← links)
- Cooperative Games (Von Neumann-Morgenstern Stable Sets) (Q5149725) (← links)
