Computing welfare-maximizing fair allocations of indivisible goods
From MaRDI portal
Publication:6109821
DOI10.1016/j.ejor.2022.10.013arXiv2012.03979OpenAlexW3171327889MaRDI QIDQ6109821
Nicholas Mattei, Unnamed Author, Haris Aziz, Erel Segal-Halevi
Publication date: 4 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.03979
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequity averse optimization in operational research
- Maximizing Nash product social welfare in allocating indivisible goods
- The efficiency of fair division
- Two-player fair division of indivisible items: comparison of algorithms
- Price of fairness in two-agent single-machine scheduling problems
- Price of fairness for allocating a bounded resource
- Complexity of finding Pareto-efficient allocations of highest welfare
- Finding fair and efficient allocations when valuations don't add up
- Non-monetary coordination mechanisms for time slot allocation in warehouse delivery
- Fair resource allocation: using welfare-based dominance constraints
- A robust disaster preparedness model for effective and fair disaster response
- Improving fairness in ambulance planning by time sharing
- Multi-objective vehicle routing problems
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Optimal bounds on the price of fairness for indivisible goods
- Fair division with binary valuations: one rule to rule them all
- On fairness via picking sequences in allocation of indivisible goods
- The Price of Fairness for a Small Number of Indivisible Items
- Fairness and Efficiency in Multiportfolio Optimization
- Approximating the Nash Social Welfare with Indivisible Items
- Rank-maximal matchings
- NON-NULL RANKING MODELS. I
- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
- `` Strong NP-Completeness Results
- Fair Allocation of Indivisible Goods
- Fairly allocating contiguous blocks of indivisible items
This page was built for publication: Computing welfare-maximizing fair allocations of indivisible goods