A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget

Velez, Rodrigo A.

doi:10.1007/s00355-021-01386-z

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Book1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our paper tackles the problem left open by Procaccia et al [17] of what solution to propose when no envy-free solution exists. To the best of our knowledge the work of Velez [21] is the only other paper considering budgets. The solution proposed is to lift the assumption of quasi-linearity of preferences and ask agents to report their marginal disutility for exceeding their budget.…”

Section: Related Workmentioning

confidence: 99%

Fair Rent Division on a Budget Revisited

Airiau,

Gilbert,

Grandi

et al. 2023

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

Rent division consists in simultaneously computing an allocation of rooms to agents and a payment, starting from an individual valuation of each room by each agent. When agents have budget limits, it is known that envy-free solutions do not necessarily exist. We propose two solutions to overcome this problem. In the first one, we relax envy-freeness to account for budget disparities. In the second one, we allow fractional allocations, in which agents may change rooms during the duration of the lease.

show abstract

Section: Related Workmentioning

confidence: 99%