Popularity, Mixed Matchings, and Self-Duality
From MaRDI portal
(Redirected from Publication:5000640)
Recommendations
- Popularity, mixed matchings, and self-duality
- The dynamics of rank-maximal and popular matchings
- Popular matchings with two-sided preferences and one-sided ties
- Popular matchings with two-sided preferences and one-sided ties
- Popular matchings: structure and algorithms
- Popular Matchings: Structure and Algorithms
- Optimal popular matchings
- Understanding popular matchings via stable matchings
- Many-to-one popular matchings with two-sided preferences and one-sided ties
Cites work
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 3558960 (Why is no real title available?)
- scientific article; zbMATH DE number 477584 (Why is no real title available?)
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A New Approach to Stable Matching Problems
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- A necessary and sufficient condition for the existence of a complete stable matching
- A new fixed point approach for stable networks and stable marriages
- A new solution to the random assignment problem.
- A solution to the random assignment problem on the full preference domain
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- An efficient algorithm for the “stable roommates” problem
- An elementary integrality proof of Rothblum's stable matching formulation
- Characterization of stable matchings as extreme points of a polytope
- College Admissions and the Stability of Marriage
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Consistent probabilistic social choice
- Integer Programming: Methods, Uses, Computations
- Linear programming brings marital bliss
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover
- Network flow and 2-satisfiability
- Odd Minimum Cut-Sets and b-Matchings
- On popular random assignments
- On the hardness of approximating minimum vertex cover
- Polyhedral aspects of stable marriage
- Popular Half-Integral Matchings.
- Popular Matchings
- Popular matchings and limits to tractability
- Popular matchings in the marriage and roommates problems
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- Popular mixed matchings
- Popularity, mixed matchings, and self-duality
- Probabilistic Social Choice Based on Simple Voting Comparisons
- Some remarks on the stable matching problem
- Stable Matchings, Optimal Assignments, and Linear Programming
- Stable matchings and linear inequalities
- The geometry of fractional stable matchings and its applications
- Two problems in max-size popular matchings
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(12)- Finding and Recognizing Popular Coalition Structures
- Understanding popular matchings via stable matchings
- Popularity, mixed matchings, and self-duality
- Matchings, relaxed popularity, and optimality
- Maximum-utility popular matchings with bounded instability
- Popular roommates in simply exponential time
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- Popular critical matchings in the many-to-many setting
- Quasi-popular matchings, optimality, and extended formulations
- Popular matchings with weighted voters
- Computational complexity of \(k\)-stable matchings
This page was built for publication: Popularity, Mixed Matchings, and Self-Duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000640)
