Minimal envy and popular matchings
From MaRDI portal
Publication:2242327
DOI10.1016/j.ejor.2021.03.060zbMath1490.91143arXiv1902.08003OpenAlexW3174107123MaRDI QIDQ2242327
Alexander S. Nesterov, A. Yu. Kondratiev
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.08003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- It is difficult to tell if there is a Condorcet spanning tree
- The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
- Popular mixed matchings
- Popular matchings with variable item copies
- Popular matchings: structure and algorithms
- Consistency and its converse: an introduction
- Optimal popular matchings
- Popular matchings in the weighted capacitated house allocation problem
- Extending Condorcet's rule
- Residence exchange wanted: A stable residence exchange problem
- Exact complexity of the winner problem for Young elections
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- On cores and indivisibility
- Complexity of finding Pareto-efficient allocations of highest welfare
- Popular and clan-popular \(b\)-matchings
- Paths to stable allocations
- Size versus fairness in the assignment problem
- Fairness and efficiency in strategy-proof object allocation mechanisms
- Popular ranking
- Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration
- On Popular Random Assignments
- Popular Matchings: Structure and Strategic Issues
- Random Paths to Stability in Two-Sided Matching
- Popular Matchings
- The College Admissions Problem Revisited
- Competitive Division of a Mixed Manna
- A CHARACTERIZATION OF WEIGHTED POPULAR MATCHINGS UNDER MATROID CONSTRAINTS
- Counting Popular Matchings in House Allocation Problems
- Fair Allocation of Indivisible Goods
- Popular Matchings with Ties and Matroid Constraints
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- Voting Paths
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Random Matching Under Dichotomous Preferences
- Weighted popular matchings
- College Admissions and the Stability of Marriage
This page was built for publication: Minimal envy and popular matchings