Strong Core Theorems with Nonconvex Preferences
From MaRDI portal
Recommendations
- Strong subdifferentials: theory and applications in nonconvex optimization
- Strong convergence theorems for nonexpansive mapping
- On strong pseudoconvexity in nonlinear programming duality
- Strongly semi-G-preinvexity and nonlinear programming
- scientific article; zbMATH DE number 5296125
- Strong duality for standard convex programs
- Strong duality in cone constrained nonconvex optimization
- Strong convexity and separation theorems
- On strong and total Lagrange duality for convex optimization problems
- Non-convex strong duality via subdifferential
Cited in
(19)- Walrasian analysis via two-player games
- The coalitional approach to core theory
- Gap-minimizing prices and quadratic core convergence
- Core convergence without monotone preferences and free disposal
- Theorems on correspondences and stability of the core
- On the core of normal form games with a continuum of players
- The core and the hedonic core: Equivalence and comparative statics
- Market games and Walrasian equilibria
- Modeling large societies: why countable additivity is necessary
- STRATEGIC EQUILIBRIA WITH PARTIALLY CONSUMABLE WITHHOLDINGS
- A Nonstandard Approach to Option Pricing
- Loeb extension and Loeb equivalence
- The weak-core of a game in normal form with a continuum of players
- Quasi-Cores in a Monetary Economy with Nonconvex Preferences
- A limit theorem on the core
- Clubs and the market: Large finite economies
- Loeb extension and Loeb equivalence II
- On existence of Berk-Nash equilibria in misspecified Markov decision processes with infinite spaces
- Core allocations and small income transfers
This page was built for publication: Strong Core Theorems with Nonconvex Preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718447)
