arXiv (All)
open access
Top Trading Cycles with Indifferences under Matroid Constraints
We study the reallocation of indivisible objects among agents who may hold initial endowments and may be indifferent between objects. Each agent has her own set of admissible objects, and a matroid constraint specifies which combinations of assigned objects are feasible. The model contains the housi
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
- Stable Matchings with Minimum Utility Gap#1155259
- Optimization and Beyond#108435
- Order and Gorenstein properties for lattice path matroid polytopes#820127
- Allocating Common-Value Goods#1110151
- Otter: A Provably MEV-Resilient Automated Market Maker via Surplus Redistribution#926393
Record · ID 1116668
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