von Neumann-Morgenstern farsightedly stable sets in two-sided matching
From MaRDI portal
Publication:3095018
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)- Full farsighted rationality
- Matching with myopic and farsighted players
- Horizon-\(K\) farsightedness in criminal networks
- Stability against robust deviations in the roommate problem
- Von Neumann-Morgenstern stable sets in matching problems
- A bargaining set for roommate problems
- Trading votes for votes: a laboratory study
- Minimal farsighted instability
- Implementation in largest consistent set via rights structures
- An existence result for farsighted stable sets of games in characteristic function form
- Von Neumann-Morgenstern stable set rationalization of choice functions
- Fair stable sets of simple games
- Cooperative games (von Neumann-Morgenstern stable sets)
- Dynamically stable matching
- Social rationalizability with mediation
- Assortative matching with externalities and farsighted agents
- Farsighted stability in patent licensing: an abstract game approach
- Network formation with myopic and farsighted players
- Farsightedly stable tariffs
- Stable sets in matching problems with coalitional sovereignty and path dominance
- Competition and networks of collaboration
- Single-payoff farsighted stable sets in strategic games with dominant punishment strategies
- Stable matching and protocol-free equilibrium
- Close-knit neighborhoods: stability of cooperation in networks
- Dynamic stable set as a tournament solution
- Farsighted stability with heterogeneous expectations
- Coalition formation under dominance invariance
- Dominance invariant one-to-one matching problems
- Local farsightedness in network formation
- Maximin, minimax, and von Neumann-Morgenstern farsighted stable sets
- Farsighted objections and maximality in one-to-one matching problems
- Farsighted house allocation
- Stability of networks under horizon-\(K\) farsightedness
- Limited farsightedness in R\&D network formation
- A behavioral test and classification of solution concepts in games
- Stable allocations in discrete exchange economies
- School choice with farsighted students
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)
