Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
Tomomi Matsui, Takayoshi Hamaguchi
TL;DR
This paper provides a simple characterization of popular matchings with ties in preference lists and introduces a polynomial-time algorithm for finding the minimum cost popular matching.
Contribution
It offers a novel, straightforward characterization of popular matchings with ties and a polynomial algorithm for minimum cost solutions.
Findings
Characterization simplifies understanding of popular matchings with ties.
Polynomial-time algorithm efficiently finds minimum cost popular matchings.
Results facilitate practical applications in matching markets with ties.
Abstract
In this paper, we give a simple characterization of a set of popular matchings defined by preference lists with ties. By employing our characterization, we propose a polynomial time algorithm for finding a minimum cost popular matching.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Game Theory and Applications · Bayesian Modeling and Causal Inference