Which Is the Fairest (Rent Division) of Them All?
From MaRDI portal
Publication:4640348
DOI10.1145/3131361zbMath1427.91144OpenAlexW2769880400MaRDI QIDQ4640348
Moshe Mash, Ariel D. Procaccia, Yair Zick, Ya'Akov Gal (Kobi)
Publication date: 17 May 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3131361
Analysis of algorithms (68W40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (13)
Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Generalized Rental Harmony ⋮ A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget ⋮ Efficient Fair Division with Minimal Sharing ⋮ Fair cake-cutting in practice ⋮ An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities ⋮ Almost Envy-Freeness with General Valuations ⋮ Equitable rent division on a soft budget ⋮ Almost envy-freeness in group resource allocation ⋮ Function and colorful extensions of the KKM theorem ⋮ Democratic fair allocation of indivisible goods ⋮ A new approach to fair distribution of welfare ⋮ Fully Polynomial-Time Approximation Schemes for Fair Rent Division
This page was built for publication: Which Is the Fairest (Rent Division) of Them All?
