Pages that link to "Item:Q2373788"

The following pages link to Von Neumann-Morgenstern stable sets in matching problems (Q2373788):

Displaying 25 items.

• Responsive affirmative action in school choice (Q308606) (← links)
• Dominance invariant one-to-one matching problems (Q480857) (← links)
• On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm (Q485776) (← links)
• Dynamic stable set as a tournament solution (Q892846) (← links)
• von Neumann-Morgenstern stable sets of income tax rates in public good economies (Q943346) (← links)
• The foundation of stability in extensive games with perfect information (Q1049232) (← links)
• Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof (Q1645200) (← links)
• A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733) (← links)
• Subgame perfect equilibria under the deferred acceptance algorithm (Q2041080) (← links)
• Weak stability and Pareto efficiency in school choice (Q2061119) (← links)
• Farsighted stability with heterogeneous expectations (Q2173388) (← 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)
• Stability of networks under horizon-\(K\) farsightedness (Q2323294) (← links)
• Stable sets in matching problems with coalitional sovereignty and path dominance (Q2399671) (← links)
• Absorbing sets in roommate problems (Q2436304) (← links)
• Von Neumann-Morgenstern solutions in the assignment market (Q2447069) (← links)
• Stability properties of the core in a generalized assignment problem (Q2667248) (← links)
• Stability against robust deviations in the roommate problem (Q2667273) (← links)
• Farsighted objections and maximality in one-to-one matching problems (Q2675403) (← links)
• The minimum set of \(\mu\)-compatible subgames for obtaining a stable set in an assignment game (Q2689422) (← links)
• Political mergers as coalition formation: An analysis of the<i>Heisei</i>municipal amalgamations (Q4586176) (← 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)