Popular matchings with two-sided preference lists and matroid constraints
From MaRDI portal
Publication:2290635
DOI10.1016/J.TCS.2019.12.017zbMATH Open1436.91086OpenAlexW2995436168WikidataQ126538569 ScholiaQ126538569MaRDI QIDQ2290635FDOQ2290635
Authors: Naoyuki Kamiyama 
Publication date: 29 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.017
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- College Admissions and the Stability of Marriage
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Exchange systems, matchings, and transversals
- Popular matchings in the marriage and roommates problems
- A matroid approach to stable matchings with lower quotas
- The popular matching and condensation problems under matroid constraints
- Popular Matchings
- A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis
- Popular Matchings in the Capacitated House Allocation Problem
- Weighted popular matchings
- Popular matchings in the weighted capacitated house allocation problem
- Comments on bases in dependence structures
- Popular matchings with multiple partners
- Popular matchings in the stable marriage problem
- On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
- Stable matchings with ties, master preference lists, and matroid constraints
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
- Popular matchings with ties and matroid constraints
- Popular matchings with two-sided preferences and one-sided ties
- Popular and clan-popular \(b\)-matchings
- Popularity in the generalized hospital residents setting
Cited In (9)
- A characterization of weighted popular matchings under matroid constraints
- Solving the maximum popular matching problem with matroid constraints
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Reallocation mechanisms under distributional constraints in the full preference domain
- Finding strongly popular \(b\)-matchings in bipartite graphs
- The popular matching and condensation problems under matroid constraints
- Popular matchings with ties and matroid constraints
- The popular matching and condensation problems under matroid constraints
- Quasi-popular Matchings, Optimality, and Extended Formulations
This page was built for publication: Popular matchings with two-sided preference lists and matroid constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290635)
