Pages that link to "Item:Q1959733"
From MaRDI portal
The following pages link to A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733):
Displaying 12 items.
- On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm (Q485776) (← links)
- Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof (Q1645200) (← links)
- Subgame perfect equilibria under the deferred acceptance algorithm (Q2041080) (← links)
- Weak stability and Pareto efficiency in school choice (Q2061119) (← links)
- Essentially stable matchings (Q2178028) (← links)
- Von Neumann-Morgenstern stable set rationalization of choice functions (Q2202240) (← links)
- Matching with myopic and farsighted players (Q2220937) (← links)
- Stable sets in matching problems with coalitional sovereignty and path dominance (Q2399671) (← links)
- Stability properties of the core in a generalized assignment problem (Q2667248) (← links)
- The minimum set of \(\mu\)-compatible subgames for obtaining a stable set in an assignment game (Q2689422) (← links)
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (Q5095181) (← links)
- Cooperative Games (Von Neumann-Morgenstern Stable Sets) (Q5149725) (← links)
