Pages that link to "Item:Q4682746"
From MaRDI portal
The following pages link to Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition (Q4682746):
Displaying 26 items.
- On the correspondence of contracts to salaries in (many-to-many) matching (Q423776) (← links)
- Stability concepts in matching under distributional constraints (Q508390) (← links)
- Impossibility of stable and nonbossy matching mechanisms (Q969481) (← links)
- Top dominance and the possibility of strategy-proof stable solutions to matching problems (Q1341500) (← links)
- Lone wolves in infinite, discrete matching markets (Q1651278) (← links)
- Finding a stable matching under type-specific minimum quotas (Q1757561) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Nash implementation of constrained efficient stable matchings under weak priorities (Q2013344) (← links)
- Slot-specific priorities with capacity transfers (Q2049501) (← links)
- Local stability constraints (Q2099323) (← links)
- Interdistrict school choice: a theory of student assignment (Q2138086) (← links)
- Entering classes in the college admissions model (Q2212783) (← links)
- The equivalence between costly and probabilistic voting models (Q2435899) (← links)
- An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems (Q2452262) (← links)
- A necessary and sufficient condition for stable matching rules to be strategy-proof (Q2513288) (← links)
- Menu mechanisms (Q2675411) (← links)
- School choice with preference rank classes (Q2681516) (← links)
- Stable Matching with Proportionality Constraints (Q5129207) (← links)
- Market Design (Q5150291) (← links)
- Cutoff stability under distributional constraints with an application to summer internship matching (Q6120933) (← links)
- Fairness under affirmative action policies with overlapping reserves (Q6146437) (← links)
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)
- Student-optimal interdistrict school choice: district-based versus school-based admissions (Q6188257) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6201324) (← links)
- Efficient matching under general constraints (Q6565039) (← links)
- Reallocation mechanisms under distributional constraints in the full preference domain (Q6609180) (← links)
