arXiv (All)
open access
Stable Matchings with Minimum Utility Gap
We introduce the Stable Matching Problem with Minimum Utility Gap, which seeks a stable matching in which the utilities received by individual agents are as balanced as possible. Our framework can handle many-to-many matchings and general utility functions on partner sets that are consistent with th
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
- 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
- Near-Feasible Stable Matchings: Incentives and Optimality#924507
- Near-Feasible Stable Matchings: Incentives and Optimality#920276
- Stable Matching with Deviators and Conformists#670470
Record · ID 1155259
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