Popular matchings with two-sided preference lists and matroid constraints

DOI10.1016/J.TCS.2019.12.017MaRDI QIDQ2290635zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

matroidstable matchingpopular matching

Mathematics Subject Classification ID

Matching models (91B68)

Recommendations

• Popular matchings with ties and matroid constraints
• A characterization of weighted popular matchings under matroid constraints
• The popular matching and condensation problems under matroid constraints
• The popular matching and condensation problems under matroid constraints
• Popular matchings

Cites work

• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• A Fixed-Point Approach to Stable Matchings and Some Applications
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• A Size-Popularity Tradeoff in the Stable Marriage Problem
• A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis
• A matroid approach to stable matchings with lower quotas
• College Admissions and the Stability of Marriage
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Comments on bases in dependence structures
• Exchange systems, matchings, and transversals
• On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
• Popular Matchings
• Popular Matchings in the Capacitated House Allocation Problem
• Popular and clan-popular \(b\)-matchings
• Popular matchings in the marriage and roommates problems
• Popular matchings in the stable marriage problem
• Popular matchings in the weighted capacitated house allocation problem
• Popular matchings with multiple partners
• Popular matchings with ties and matroid constraints
• Popular matchings with two-sided preferences and one-sided ties
• Popularity in the generalized hospital residents setting
• Stable matchings with ties, master preference lists, and matroid constraints
• The popular matching and condensation problems under matroid constraints
• Weighted popular matchings

Cited in

(9)

• A characterization of weighted popular matchings under matroid constraints
• Finding strongly popular \(b\)-matchings in bipartite graphs
• Solving the maximum popular matching problem with matroid constraints
• 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)