arXiv (All)
open access
Minimally rational reallocation of objects
Matching theory has largely evolved around two canonical rules: deferred acceptance (DA) in the marriage problem and top trading cycles (TTC) in the object reallocation problem. Although the two rules operate through different procedures, we show that they rest on a common axiomatic foundation. In t
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
- The Augmented Matching Law#287739
- The Theory of "Involuntary" Contracts: The Judicial Rewriting of Unreasonable Covenants Not to Compete#1022094
- A Suppositional Theory of Conditionals#707964
- Equality, priority, and positional goods#703067
- Marriage Confirmation: Secret Marriage And Division Of Joint Assets#245197
Record · ID 1064718
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