scientific article
From MaRDI portal
Publication:2921653
zbMath1297.91117MaRDI QIDQ2921653
Mohammad Mahdian, Nicole Immorlica
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Asymptotic existence of proportionally fair allocations ⋮ Stable matching mechanisms are not obviously strategy-proof ⋮ New techniques and tighter bounds for local computation algorithms ⋮ College admissions with stable score-limits ⋮ Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets ⋮ Incentives in the probabilistic serial mechanism ⋮ The object allocation problem with random priorities ⋮ Matching in the large: an experimental study ⋮ Suboptimal behavior in strategy-proof mechanisms: evidence from the residency match ⋮ Improving schools through school choice: a market design approach ⋮ On the equivalence of two competing affirmative actions in school choice ⋮ Recent studies of agent incentives in Internet resource allocation and pricing ⋮ Stability in Large Matching Markets with Complementarities ⋮ Fairness and partial coercion in land assembly ⋮ The graphs of stably matchable pairs ⋮ Fictitious students creation incentives in school choice problems ⋮ Coalitional stability in matching problems with externalities and random preferences ⋮ Finding all stable matchings with couples ⋮ Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor ⋮ Efficient resource allocation under multi-unit demand ⋮ Sisterhood in the Gale-Shapley matching algorithm ⋮ Entering classes in the college admissions model ⋮ What matters in school choice tie-breaking? How competition guides design ⋮ Recent studies of agent incentives in internet resource allocation and pricing ⋮ Optimal truncation in matching markets ⋮ Stability and immunity to capacity manipulation in large matching markets ⋮ Stability concepts in matching under distributional constraints ⋮ Large roommate problem with non-transferable random utility ⋮ Non-manipulability of uniform price auctions with a large number of objects ⋮ Deferred acceptance algorithms: history, theory, practice, and open questions ⋮ Obvious manipulations ⋮ Truncation strategies in two-sided matching markets: theory and experiment ⋮ An improved bound to manipulation in large stable matches ⋮ Convergence of the Core in Assignment Markets ⋮ Stable Matching in Large Economies ⋮ Coalitional permutation manipulations in the Gale-Shapley algorithm ⋮ Stable matchings with covering constraints: a complete computational trichotomy ⋮ Closing Gaps in Asymptotic Fair Division ⋮ On the welfare effects of affirmative actions in school choice ⋮ Verifiability and group formation in markets ⋮ Matching of like rank and the size of the core in the marriage problem ⋮ How Good Are Popular Matchings
