arXiv (All)
open access
A Minimax Perspective on Almost-Stable Matchings
Stability is crucial in matching markets, yet in many real-world settings - from hospital residency allocations to roommate assignments - full stability is either unachievable or comes at the cost of leaving agents unmatched. In these cases, algorithmicists and market designers face a critical quest
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
- A Minimax Perspective on Almost-Stable Matchings#920263
- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem#924397
- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem#920166
- Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings#820398
- Optimal Capacity Modification for Stable Matchings with Ties#141671
Record · ID 924494
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