Fair assignment of indivisible objects under ordinal preferences
From MaRDI portal
Publication:899158
DOI10.1016/j.artint.2015.06.002zbMath1346.68106arXiv1312.6546OpenAlexW2107944092WikidataQ28111603 ScholiaQ28111603MaRDI QIDQ899158
Haris Aziz, Simon MacKenzie, Toby Walsh, Serge Gaspers
Publication date: 21 December 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.6546
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (19)
Envy-free allocations respecting social networks ⋮ Ordinal Maximin Share Approximation for Goods ⋮ Multi resource allocation with partial preferences ⋮ Almost Envy-Freeness with General Valuations ⋮ On fair division with binary valuations respecting social networks ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ Computational complexity of necessary envy-freeness ⋮ Envy-free matchings in bipartite graphs and their applications to fair division ⋮ Allocation of indivisible items with individual preference graphs ⋮ A note on the undercut procedure ⋮ Allocating indivisible items with minimum dissatisfaction on preference graphs ⋮ Proportional Borda allocations ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ Obtaining a proportional allocation by deleting items ⋮ Borda-induced hedonic games with friends, enemies, and neutral players ⋮ Size versus truthfulness in the house allocation problem ⋮ Computing a small agreeable set of indivisible items ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ Serial rules in a multi-unit Shapley-Scarf market
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing Nash product social welfare in allocating indivisible goods
- ``Almost stable matchings in the roommates problem with bounded preference lists
- A solution to the random assignment problem on the full preference domain
- Equitable distribution of indivisible objects
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fair division of indivisible items
- Assigning papers to referees
- Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- On Popular Random Assignments
- Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
- Assignment Problem Based on Ordinal Preferences
- Assignment Using Choice Lists
- Reducibility among Combinatorial Problems
- Algorithmics of Matching Under Preferences
- An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
- Algorithms and Computation
- A new solution to the random assignment problem.
This page was built for publication: Fair assignment of indivisible objects under ordinal preferences
