Computational complexity of necessary envy-freeness

DOI10.1016/j.mathsocsci.2023.08.002MaRDI QIDQ6125946

Haris Aziz, Ildikó Schlotter, Toby Walsh

Publication date: 9 April 2024

Published in: Mathematical Social Sciences (Search for Journal in Brave)

zbMATH Keywords

fair divisionenvy-freeness

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Fair assignment of indivisible objects under ordinal preferences
• Simultaneously achieving ex-ante and ex-post fairness
• Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
• Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
• Fair Allocation of Indivisible Goods
• The complexity of satisfiability problems

This page was built for publication: Computational complexity of necessary envy-freeness