Which is the fairest (rent division) of them all?
From MaRDI portal
Publication:4640348
DOI10.1145/3131361zbMATH Open1427.91144OpenAlexW2769880400MaRDI QIDQ4640348FDOQ4640348
Authors: Ya'Akov Gal (Kobi), Moshe Mash, Ariel D. Procaccia, Yair Zick 
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
Recommendations
Analysis of algorithms (68W40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cited In (21)
- The problem of fair division for a hybrid resource
- Fair cake-cutting in practice
- Equitable rent division on a soft budget
- Efficient Fair Division with Minimal Sharing
- Three persons, two cuts: a new cake-cutting algorithm
- Generalized rental harmony
- An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities
- Function and colorful extensions of the KKM theorem
- Room assignment-rent division: a market approach
- One quarter each (on average) ensures proportionality
- Competitive envy-free division
- Almost envy-freeness with general valuations
- Fully polynomial-time approximation schemes for fair rent division
- Almost envy-freeness in group resource allocation
- Democratic fair allocation of indivisible goods
- Rent division among groups
- A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget
- A new approach to fair distribution of welfare
- Achieving rental harmony with a secretive roommate
- Sharing an increase of the rent fairly
- Fully polynomial-time approximation schemes for fair rent division
This page was built for publication: Which is the fairest (rent division) of them all?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640348)
