School choice with controlled choice constraints: hard bounds versus soft bounds

From MaRDI portal
Publication:406428


DOI10.1016/j.jet.2014.03.004zbMath1309.91102OpenAlexW2116188555WikidataQ57990804 ScholiaQ57990804MaRDI QIDQ406428

Muhammed A. Yildirim, M. Bumin Yenmez, Isa E. Hafalir, Lars Ehlers

Publication date: 8 September 2014

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: http://www.cireqmontreal.com/wp-content/uploads/cahiers/13-2011-cah.pdf



Related Items

Improving the Chilean College Admissions System, Strategyproof matching with regional minimum and maximum quotas, When is the deferred acceptance mechanism responsive to priority-based affirmative action?, Fair implementation of diversity in school choice, Object allocation via deferred-acceptance: strategy-proofness and comparative statics, Interdistrict school choice: a theory of student assignment, Responsive affirmative action in school choice, The Complexity of Computing the Random Priority Allocation Matrix, Constrained random matching, Impossibility of weakly stable and strategy-proof mechanism, An analysis of the German university admissions system, Affirmative actions: the Boston mechanism case, Explicit vs. statistical targeting in affirmative action: theory and evidence from Chicago's exam schools, Matching through institutions, Strategy-proof school choice mechanisms with minimum quotas and initial endowments, Pareto optimal matchings with lower quotas, Strategy-proof Pareto-improvement, Menu mechanisms, Axiomatic characterizations of the constrained probabilistic serial mechanism, On rank dominance of tie‐breaking rules, Budget-feasible mechanisms for proportionally selecting agents from groups, Strategyproof mechanism for two-sided matching with resource allocation, School choice with preference rank classes, Fairness under affirmative action policies with overlapping reserves, Stability of an allocation of objects, A planner-optimal matching mechanism and its incentive compatibility in a restricted domain, Comparative statics for size-dependent discounts in matching markets, Stable Matching with Proportionality Constraints, Assignment Mechanisms Under Distributional Constraints, Graduate admission with financial support, Envy-free matchings with lower quotas, Stability concepts in matching under distributional constraints, Affirmative action in school choice: a new solution, The lattice of envy-free matchings, The skipping-down strategy and stability in school choice problems with affirmative action: theory and experiment, School choice with priority-based affirmative action: a responsive solution, Finding a stable matching under type-specific minimum quotas, Designing matching mechanisms under constraints: an approach from discrete convex analysis, A college admissions clearinghouse, Two further impossibility results on responsive affirmative action in school choice, On lexicographic choice, A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences, A Matroid Approach to Stable Matchings with Lower Quotas, Fairness and efficiency for allocations with participation constraints, Envy-freeness and relaxed stability: hardness and approximation algorithms, Slot-specific priorities with capacity transfers, School choice with hybrid schedules, Coalitional permutation manipulations in the Gale-Shapley algorithm, Stable matchings with covering constraints: a complete computational trichotomy, Responsive affirmative action in school choice: a comparison study, Unnamed Item, On the welfare effects of affirmative actions in school choice, College admissions with ties and common quotas: integer programming approach, College admissions with tuition transfers, Random matching under priorities: stability and no envy concepts, A comparison study on responsiveness of three mechanisms to affirmative action in school choice, Dynamic reserves in matching markets



Cites Work