Pages that link to "Item:Q2013344"
From MaRDI portal
The following pages link to Nash implementation of constrained efficient stable matchings under weak priorities (Q2013344):
Displaying 12 items.
- Implementable stable solutions to pure matching problems (Q1296478) (← links)
- Implementation of college admission rules (Q1357430) (← links)
- Implementability, Walrasian equilibria, and efficient matchings (Q1672900) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Nash implementation of matching rules (Q1920914) (← links)
- Improving efficiency in school choice under partial priorities (Q2051512) (← links)
- Nash implementation on the basis of general priorities (Q2078086) (← links)
- Games implementing the stable rule of marriage problems in strong Nash equilibria (Q2568782) (← links)
- Implementing matching rules by type pretension mechanisms (Q2569387) (← links)
- Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition (Q4682746) (← links)
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (Q5095181) (← links)
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)