arXiv (All)
open access
On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
Popular matchings provide a model of matching under preferences in which a solution corresponds to a Condorcet winner in voting systems. In a bipartite graph in which the vertices have preferences over their neighbours, a matching is defined to be popular if it does not lose in a majority vote again
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#797214
- Maximum Matching-Match: Hardness and Approximation#975248
- The Perversity of Weighted Voting#80676
- Democracy and the Common Good: A Study of the Weighted Majority Rule#762540
- Optimal impartial correspondences#367001
Record · ID 798627
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive