von Neumann-Morgenstern farsightedly stable sets in two-sided matching
From MaRDI portal
Publication:3095018
DOI10.3982/TE527zbMATH Open1278.91106OpenAlexW2109900293MaRDI QIDQ3095018FDOQ3095018
Authors: Ana Mauleon, Wouter Vergote, Vincent Vannetelbosch 
Publication date: 28 October 2011
Published in: Theoretical Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3982/te527
Recommendations
- Von Neumann-Morgenstern stable sets in matching problems
- On a characterization of stable matchings
- Probabilistic stable rules and Nash equilibrium in two-sided matching problems
- Stable matchings and linear inequalities
- Maximin, minimax, and von Neumann-Morgenstern farsighted stable sets
- Stable matchings through fixed points and graphs
- A further note on the stable matching problem
- A generalization of the stable matching problem
- On the set of many-to-one strongly stable fractional matchings
- A note on stable matchings
Cited In (37)
- Close-knit neighborhoods: stability of cooperation in networks
- Trading votes for votes: a laboratory study
- Farsighted stability with heterogeneous expectations
- Local farsightedness in network formation
- Farsighted house allocation
- An existence result for farsighted stable sets of games in characteristic function form
- Limited farsightedness in R\&D network formation
- Minimal farsighted instability
- Matching with myopic and farsighted players
- Single-payoff farsighted stable sets in strategic games with dominant punishment strategies
- Cooperative Games (Von Neumann-Morgenstern Stable Sets)
- Stability of networks under horizon-\(K\) farsightedness
- Assortative matching with externalities and farsighted agents
- Stable sets in matching problems with coalitional sovereignty and path dominance
- Implementation in largest consistent set via rights structures
- Social rationalizability with mediation
- A bargaining set for roommate problems
- Fair stable sets of simple games
- Farsighted stability in patent licensing: an abstract game approach
- Farsightedly stable tariffs
- Full farsighted rationality
- Horizon-\(K\) farsightedness in criminal networks
- Dominance invariant one-to-one matching problems
- Farsighted objections and maximality in one-to-one matching problems
- Network formation with myopic and farsighted players
- Stability against robust deviations in the roommate problem
- Dynamic stable set as a tournament solution
- Competition and networks of collaboration
- Coalition formation under dominance invariance
- Dynamically stable matching
- A behavioral test and classification of solution concepts in games
- Stable allocations in discrete exchange economies
- School choice with farsighted students
- Von Neumann-Morgenstern stable sets in matching problems
- Stable matching and protocol-free equilibrium
- Maximin, minimax, and von Neumann-Morgenstern farsighted stable sets
- Von Neumann-Morgenstern stable set rationalization of choice functions
This page was built for publication: von Neumann-Morgenstern farsightedly stable sets in two-sided matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095018)
