Popular Matchings with Ties and Matroid Constraints
From MaRDI portal
Publication:5351863
DOI10.1137/15M104918XzbMath1372.91072OpenAlexW2749918632MaRDI QIDQ5351863
Publication date: 31 August 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m104918x
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Matching models (91B68)
Related Items (4)
Minimal envy and popular matchings ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Envy-free matchings with one-sided preferences and matroid constraints ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints
Cites Work
- The popular matching and condensation problems under matroid constraints
- Popular mixed matchings
- Popular matchings with variable item copies
- Popular matchings: structure and algorithms
- Optimal popular matchings
- Popular matchings in the weighted capacitated house allocation problem
- Popularity at minimum cost
- An Optimal Algorithm for the Popular Condensation Problem
- The Generalized Popular Condensation Problem
- Rank-maximal matchings
- Coverings of Bipartite Graphs
- Popular Matchings
- Improved Bounds for Matroid Partition and Intersection Algorithms
- A weighted matroid intersection algorithm
- Paths, Trees, and Flowers
- MATROID INTERSECTION WITH PRIORITY CONSTRAINTS
- Popular Matchings in the Capacitated House Allocation Problem
- Weighted popular matchings
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Algorithms and Computation
- Combinatorial optimization. Theory and algorithms.
- Matrices and matroids for systems analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Popular Matchings with Ties and Matroid Constraints
