paper
Fast TTC Computation
Irene Aldridge
Description
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.
Similar Books
paper
Quantitative mode stability for the wave equation on the Kerr-Newman spacetime
Damon Civin
Quantitative mode stability for the wave equation on the Kerr-Newman spacetime
paper
Risk-Aware Objective-Based Forecasting in Inertia Management
Haipeng Zhang, Ran Li, Yan Chen, Zhongda Chu, Mingyang Sun
Risk-Aware Objective-Based Forecasting in Inertia Management
paper
Chainalysis: Geography of Cryptocurrency 2023
Chainalysis
Chainalysis: Geography of Cryptocurrency 2023
paper
Periodicity in Cryptocurrency Volatility and Liquidity
Peter Reinhard Hansen, Chan Kim, Wade Kimbrough
Periodicity in Cryptocurrency Volatility and Liquidity
paper
Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain
Saeideh Sekhavat, Mostafa Jamshidian, Adam Wittek, Karol Miller
Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain
paper
Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I
Getachew K. Befekadu
Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I