Fully Polynomial-Time Approximation Schemes for Fair Rent Division

DOI10.1137/1.9781611975482.121zbMath1435.91104arXiv1807.04163OpenAlexW2857646897MaRDI QIDQ5236307

Siddharth Barman, Nidhi Rathi, Eshwar Ram Arunachaleswaran

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.04163

zbMATH Keywords

fully polynomial-time approximation algorithmsroom allocationfair rent division

Mathematics Subject Classification ID

Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (3)

A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget ⋮ An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities ⋮ Fair and efficient cake division with connected pieces

This page was built for publication: Fully Polynomial-Time Approximation Schemes for Fair Rent Division