Optimal Control of a Paired-Kidney Exchange Program
Management Science
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges
Proceedings of the 8th ACM conference on Electronic commerce
Regrets only! online stochastic optimization under time constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Expressive banner ad auctions and model-based online optimization for clearing
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Waiting and relocation strategies in online stochastic vehicle routing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Amsaa: an anticipatory algorithm for online stochastic combinatorial optimization
Amsaa: an anticipatory algorithm for online stochastic combinatorial optimization
What about wednesday? approximation algorithms for multistage stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Online stochastic reservation systems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Dynamic Matching with a Fall-back Option
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Matching, cardinal utility, and social welfare
ACM SIGecom Exchanges
Optimizing kidney exchange with transplant chains: theory and reality
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Proceedings of the fourteenth ACM conference on Electronic commerce
Hi-index | 0.02 |
Kidneys are the most prevalent organ transplants, but demand dwarfs supply. Kidney exchanges enable willing but incompatible donor-patient pairs to swap donors. These swaps can include cycles longer than two pairs as well, and chains triggered by altruistic donors. Current kidney exchanges address clearing (deciding who gets kidneys from whom) as an offline problem: they optimize the current batch. In reality, clearing is an online problem where patient-donor pairs and altruistic donors appear and expire over time. In this paper, we study trajectory-based online stochastic optimization algorithms (which use a recent scalable optimal offline solver as a subroutine) for this. We identify tradeoffs in these algorithms between different parameters. We also uncover the need to set the batch size that the algorithms consider an atomic unit. We develop an experimental methodology for setting these parameters, and conduct experiments on real and generated data. We adapt the REGRETS algorithm of Bent and van Hentenryck for the setting. We then develop a better algorithm. We also show that the AMSAA algorithm of Mercier and van Hentenryck does not scale to the nationwide level. Our best online algorithm saves significantly more lives than the current practice of solving each batch separately.