2018
DOI: 10.48550/arxiv.1807.04163
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Fully Polynomial-Time Approximation Schemes for Fair Rent Division

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…We construct a family of polynomial algorithms, with the same fixed parameters of Arunachaleswaran et al (2018), that compute allocations selected by the maxmin and minmax utility and maxmin and minmax money linear selections of the envy-free set (Theorem 1). Sec.…”
Section: Our Contributionmentioning
confidence: 99%
See 4 more Smart Citations
“…We construct a family of polynomial algorithms, with the same fixed parameters of Arunachaleswaran et al (2018), that compute allocations selected by the maxmin and minmax utility and maxmin and minmax money linear selections of the envy-free set (Theorem 1). Sec.…”
Section: Our Contributionmentioning
confidence: 99%
“…Second, at a technical level, we bridge two independent branches of the literature on envy-free rent division. On the one hand, we work on the algorithmic framework developed by Gal et al (2017) and Arunachaleswaran et al (2018). On the other hand, we manage to exploit from a computational perspective the topological properties of the envy-free set that economists have used in unrestricted continuous economies to understand the normative and structural properties of these allocations (c.f., Alkan et al, 1991;Velez, , 2018.…”
Section: Significance For Cs and Economicsmentioning
confidence: 99%
See 3 more Smart Citations