arXiv (All)
open access
Feasible approximation of matching equilibria for large-scale matching for teams problems
We propose a numerical algorithm for computing feasible and approximately optimal solutions of the matching for teams problem. Specifically, we introduce the notion of approximate matching equilibrium as a feasible approximation of a matching equilibrium with relaxed rationality, and we show that a
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
- Feasible approximation of matching equilibria for large-scale matching for teams problems#789360
- MatchWork#273000
- Asymmetric English Auctions Revisited#499835
- The Theory and Practice of Representative Negotiation#494540
- Differentiable Economics: Auctions, Data Markets, and Matching Markets#347586
Record · ID 793364
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