Core equivalence theorems for infinite convex games
From MaRDI portal
Publication:1371185
DOI10.1006/JETH.1997.2304zbMATH Open0883.90136OpenAlexW1976389051MaRDI QIDQ1371185FDOQ1371185
Authors: Ezra Einy, Ron Holzman, Dov Monderer, Benyamin Shitovitz
Publication date: 28 October 1997
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/22e2462354d8e11bfddf1d6409a3e446f35dafb6
Recommendations
- Convex semi-infinite games
- Cores of convex and strictly convex games
- A saddle‐point theorem for a class of infinite games
- Cores of convex games
- Equilibria and approximate equilibria in infinite potential games
- Non-convex infinite games
- The core of continuous convex games with countable many players
- An axiomatization of the core for finite and continuum games
- Noncompact infinite optimization and equilibria of constrained games in generalized convex spaces
- Invariant equilibria and classes of equivalent games
von Neumann-Morgenstern stable setMas-Colell bargaining setmeasurable space of playerscore of a continuous convex game
Cites Work
- Title not available (Why is that?)
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Cores of convex games
- The kernel and bargaining set for convex games
- Title not available (Why is that?)
- An equivalence theorem for a bargaining set
- Title not available (Why is that?)
- Markets with a Continuum of Traders
- Finitely Additive Measures
- On general minimax theorems
- Convex games and extreme points
- The theory of social situations. A game-theoretic approach.
- Integral Representation Without Additivity
- Cores of exact games. I
- Canonical Representation of Set Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex games and stable sets
- Equivalence between bargaining sets and the core in simple games
- On the sensitivity of von Neumann and Morgenstern abstract stable sets: The stable and the individual stable bargaining set
- A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution
- Title not available (Why is that?)
- Core and stable sets of large games arising in economics
- Nonmanipulable Cores
- Title not available (Why is that?)
- A consistent bargaining set
- The bargaining set and the core in mixed markets with atoms and an atomless sector
Cited In (14)
- On the least core and the Mas-Colell bargaining set
- Representation of the core of convex measure games via Kantorovich potentials
- Convex vNM-stable sets for linear production games
- Some generalizations of Kajii's theorem to games with infinitely many players
- On the equal treatment imputations subset in the bargaining set for smooth vector-measure games with a mixed measure space of players
- A generalization of the Shapley-ichiishi result
- The bargaining set for almost-convex games
- A game-theoretic equivalence to the Hahn-Banach theorem
- Invariant equilibria and classes of equivalent games
- The core of continuous convex games with countable many players
- The bargaining set of a large game
- A new class of convex games on \(\sigma\)-algebras and the optimal partitioning of measurable spaces
- Von Neumann-Morgenstern stable sets in matching problems
- von Neumann-Morgenstern stable sets of income tax rates in public good economies
This page was built for publication: Core equivalence theorems for infinite convex games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371185)