arXiv (OAI Expanded)
open access
Near-Feasible Stable Matchings: Incentives and Optimality
Stable matching is a fundamental area with many practical applications, such as centralised clearinghouses for school choice or job markets. Recent work has introduced the paradigm of near-feasibility in capacitated matching settings, where agent capacities are slightly modified to ensure the existe
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
- Near-Feasible Stable Matchings: Incentives and Optimality#924507
- Stable Matchings with Minimum Utility Gap#1155259
- Reserve Systems with Match-Specific Beneficiaries#1069696
- The Popular Dimension of Matchings#971711
- Consequentialism, Constraints, and Good-Relative-to#115278
Record · ID 920276
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