arXiv 22 Mar 2024 · Econometrics
arXiv:2403.15111 · PDF · DOI · OpenAlex · Extracted main text
This paper proposes a fast Markov Matrix-based methodology for computing Top Trading Cycles (TTC) that delivers O(1) computational speed, that is speed independent of the number of agents and objects in the system. The proposed methodology is well suited for complex large-dimensional problems like housing choice. The methodology retains all the properties of TTC, namely, Pareto-efficiency, individual rationality and strategy-proofness.
appendix boundary found by none_found · 100% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | Zhong Sun, Giacomo Pedretti, Elia Ambrosi, Alessandro Bricalli, and… (2020) In-memory eigenvector computation in time o(1) | 0.644 | 2 | 2 | 100% |
| 2 | Atila Abdulkadiroglu and Tayfun Sönmez (1998) Random serial dictatorship and the core from random endowments in house allocation problems | 0.405 | 1 | 1 | 100% |
| 3 | Atila Abdulkadiroglu and Tayfun Sönmez (2003) School choice: A mechanism design approach | 0.405 | 1 | 1 | 100% |
| 4 | Anna Bogomolnaia and Hervé Moulin (2001) A new solution to the random assignment problem | 0.405 | 1 | 1 | 100% |
| 5 | Irene Aldridge and Marco Avellaneda (2021) Big Data Science in Finance self | 0.405 | 1 | 1 | 100% |
| 6 | Anna Bogomolnaia and Herve Moulin (2004) Random matching under dichotomous preferences | 0.405 | 1 | 1 | 100% |
| 7 | Lloyd Shapley and Herbert Scarf (1974) On cores and indivisibility | 0.405 | 1 | 1 | 100% |
| 8 | Daniela Saban and Jay Sethuraman (2013) School choice: A mechanism design approach | 0.405 | 1 | 1 | 100% |
Showing the top 8 of 8 scored citations.