The envy-free matching problem with pairwise preferences
From MaRDI portal
Publication:2234784
Recommendations
Cites work
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- Algorithms and Computation
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- College Admissions and the Stability of Marriage
- Envy-free matchings with lower quotas
- Envy-freeness in house allocation problems
- Fair Allocation of Indivisible Goods
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Parameterized algorithms
- Popular Matchings
- Preference structures and their numerical representations
- Rank-maximal matchings
- Reducibility among combinatorial problems
- Stable marriage with general preferences
- The lattice of envy-free matchings
Cited in
(6)- Minimal envy and popular matchings
- scientific article; zbMATH DE number 7278072 (Why is no real title available?)
- Repeatedly matching items to agents fairly and efficiently
- On envy-free perfect matching
- Envy-free matchings in bipartite graphs and their applications to fair division
- Envy-freeness and relaxed stability: hardness and approximation algorithms
This page was built for publication: The envy-free matching problem with pairwise preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234784)
