Stable and envy-free lottery allocations for affordable housing
Zhan Wang et al.
What the paper says
Affordable housing lotteries often enforce a rule preventing duplicate lottery entries that makes the model in Hylland & Zeckhauser (1979) (HZ) inapplicable. We revisit HZ and propose a new individually stable (IS) allocation that can be achieved by a Tickets algorithm and accommodate the rule. A strictly envy-free (SEF) allocation is shown to be the unique IS and Pareto-optimal allocation, the outcome of the unique strong Nash equilibrium of a congestion game, and the unique Pseudo market equilibrium allocation in HZ. The algorithm always obtains the unique SEF allocation (if any) and fixes a designed flaw of existing lotteries.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.00 × 0.4 = 0.00 |
| M · momentum | 0.20 × 0.15 = 0.03 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.