On the complexity of fair house allocation
From MaRDI portal
Publication:2060606
DOI10.1016/j.orl.2021.06.006OpenAlexW3169332944MaRDI QIDQ2060606
Pasin Manurangsi, Naoyuki Kamiyama, Warut Suksompong
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.06925
Computer science (68-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)
Related Items (1)
Cites Work
- Unnamed Item
- On a conjecture by Gale about one-sided matching problems
- Size versus truthfulness in the house allocation problem
- Envy-freeness in house allocation problems
- Graph expansion and the unique games conjecture
- Relations between average case complexity and approximation complexity
- On the power of unique 2-prover 1-round games
- A Stab at Approximating Minimum Subadditive Join
- The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Bicovering: Covering edges with two small subsets of vertices
- Hardness of Bipartite Expansion.
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
- Fair Allocation of Indivisible Goods
- Algorithms and Computation
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
This page was built for publication: On the complexity of fair house allocation
