arXiv (All)
open access
The lattice structure of the crawler
We study object reallocation problems with single-peaked preferences. On the unrestricted domain of strict preferences, top trading cycles (TTC) is the unique rule that satisfies efficiency, individual rationality, and strategy-proofness. On the single-peaked preference domain, the crawler introduce
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
- General Leader-Follower Linear-Quadratic Stochastic Graphon Games with Indefinite Control Weights#1050370
- Very Justified Envy#1123209
- Strategy-proof voting schemes under single-peaked preferences over intervals#1218170
- The Exact Welfare Guarantee of Fixed-Price Bilateral Trade#1130730
- Prime factorisation of stable-matching instances: uniqueness, simultaneous products, and an exact census#1201630
Record · ID 1217831
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