Envy-free matchings in bipartite graphs and their applications to fair division
DOI10.1016/j.ins.2021.11.059arXiv1901.09527MaRDI QIDQ6154777
Elad Aigner-Horev, Erel Segal-Halevi
Publication date: 16 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.09527
Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on cake cutting
- Fair assignment of indivisible objects under ordinal preferences
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- The lattice of envy-free matchings
- Envy-free matchings with lower quotas
- On the complexity of fair house allocation
- Envy-freeness in house allocation problems
- Collective choice under dichotomous preferences
- Fair multi-cake cutting
- Competitive Equilibria in Two-Sided Matching Markets with General Utility Functions
- Rank-maximal matchings
- Meta-Envy-Free Cake-Cutting Protocols
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair Enough
- Optimal Multi-Way Number Partitioning
- Competitive Equilibrium with Indivisible Goods and Generic Budgets
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Envy-free matchings in bipartite graphs and their applications to fair division
