arXiv (All)
open access
A Matroid Generalization of Weighted Popular Matching: Characterization and Algorithm
We study a problem that unifies two major generalizations of popular matchings in the one-sided preference model. In a bipartite graph in which each vertex, or applicant, on one side has preferences over the adjacent vertices, a matching is called popular if it does not lose a head-to-head election
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#798627
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#797214
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- The Popular Dimension of Matchings#971711
- Maximum Matching-Match: Hardness and Approximation#975248
Record · ID 1342953
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