Pages that link to "Item:Q508390"
From MaRDI portal
The following pages link to Stability concepts in matching under distributional constraints (Q508390):
Displaying 32 items.
- Strategyproof matching with regional minimum and maximum quotas (Q274410) (← links)
- Dynamic reserves in matching markets (Q785541) (← links)
- Finding all stable matchings with couples (Q908185) (← links)
- Matching with contracts, substitutes and two-unit demand (Q1668513) (← links)
- The lattice of envy-free matchings (Q1753285) (← 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)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Some further properties of the cumulative offer process (Q2013375) (← links)
- Fairness and efficiency for allocations with participation constraints (Q2044984) (← links)
- Slot-specific priorities with capacity transfers (Q2049501) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Interdistrict school choice: a theory of student assignment (Q2138086) (← links)
- Constrained random matching (Q2155237) (← links)
- Impossibility of weakly stable and strategy-proof mechanism (Q2159837) (← links)
- Matching through institutions (Q2173398) (← links)
- Optimizing reserves in school choice: a dynamic programming approach (Q2294355) (← links)
- Random matching under priorities: stability and no envy concepts (Q2325654) (← links)
- On the number of employed in the matching model (Q2425191) (← links)
- The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- Assignment Mechanisms Under Distributional Constraints (Q5131470) (← links)
- (Q5136288) (← links)
- Market Design (Q5150291) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
- Reallocation with priorities and minimal envy mechanisms (Q6074836) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6113860) (← 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)
- Singles monotonicity and stability in one-to-one matching problems (Q6188681) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6201324) (← links)
