Efficient Near-optimal Algorithms for Barter Exchange
暂无分享,去创建一个
Ruosong Wang | Zhipeng Jia | Pingzhong Tang | Hanrui Zhang | Hanrui Zhang | Pingzhong Tang | Ruosong Wang | Zhipeng Jia
[1] João Pedro Pedroso. Maximizing Expectation on Vertex-Disjoint Cycle Packing , 2014, ICCSA.
[2] David Manlove,et al. Position-Indexed Formulations for Kidney Exchange , 2016, EC.
[3] Ross P. Anderson,et al. Stochastic models and data driven simulations for healthcare operations , 2014 .
[4] D. Gamarnik,et al. Finding long chains in kidney exchange using the traveling salesman problem , 2015, Proceedings of the National Academy of Sciences.
[5] Vicky H. Mak-Hau. On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches , 2017, J. Comb. Optim..
[6] Tuomas Sandholm,et al. Online Stochastic Optimization in the Large: Application to Kidney Exchange , 2009, IJCAI.
[7] A. Roth,et al. Free riding and participation in large scale, multi‐hospital kidney exchange , 2014 .
[8] Miguel Constantino,et al. New insights on integer-programming models for the kidney exchange problem , 2013, Eur. J. Oper. Res..
[9] Ariel D. Procaccia,et al. Optimizing kidney exchange with transplant chains: theory and reality , 2012, AAMAS.
[10] Simai He,et al. A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs , 2018, Oper. Res..
[11] Simai He,et al. A Non-asymptotic Approach to Analyzing Kidney Exchange Graphs , 2015, EC.
[12] Jian Li,et al. Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow , 2014, AAMAS.
[13] Péter Biró,et al. Inapproximability of the kidney exchange problem , 2007, Inf. Process. Lett..
[14] Ariel D. Procaccia,et al. Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries , 2014, EC.
[15] John P. Dickerson,et al. A Unified Approach to Dynamic Matching and Barter Exchange , 2016 .
[16] D. Gamarnik,et al. The Need for (Long) Chains in Kidney Exchange , 2012 .
[17] Pingzhong Tang,et al. Digital Good Exchange , 2016, IJCAI.
[18] M. Utku Ünver,et al. Dynamic Kidney Exchange , 2007 .
[19] Avrim Blum,et al. Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.
[20] T. Pruett,et al. A Nonsimultaneous, Extended, Altruistic-Donor Chain , 2010 .
[21] Atila Abdulkadiroglu,et al. HOUSE ALLOCATION WITH EXISTING TENANTS , 1999 .
[22] Xenia Klimentova,et al. A New Branch-and-Price Approach for the Kidney Exchange Problem , 2014, ICCSA.
[23] M. Utku Ünver,et al. A Kidney Exchange Clearinghouse in New England. , 2005, The American economic review.
[24] Jianyang Zeng,et al. Approximation of barter exchanges with cycle length constraints , 2016, ArXiv.
[25] Pingzhong Tang,et al. Mechanism Design and Implementation for Lung Exchange , 2015, IJCAI.
[26] David C. Parkes,et al. Design and analysis of multi-hospital kidney exchange mechanisms using random graphs , 2015, Games Econ. Behav..
[27] Itai Ashlagi,et al. Mix and match: A strategyproof mechanism for multi-hospital kidney exchange , 2013, Games Econ. Behav..
[28] Ariel D. Procaccia,et al. Failure-Aware Kidney Exchange , 2019, Manag. Sci..
[29] Atila Abdulkadiroglu,et al. RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .
[30] M. Utku Ünver,et al. Utilizing List Exchange and Nondirected Donation through ‘Chain’ Paired Kidney Donations , 2006, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.
[31] Alvin E. Roth,et al. Pairwise Kidney Exchange , 2004, J. Econ. Theory.
[32] Mohammad Akbarpour,et al. Dynamic matching market design , 2014, EC.
[33] Pingzhong Tang,et al. Internally Stable Matchings and Exchanges , 2014, AAAI.
[34] Ariel D. Procaccia,et al. Opting Into Optimal Matchings , 2016, SODA.
[35] Ariel D. Procaccia,et al. Dynamic Matching via Weighted Myopia with Application to Kidney Exchange , 2012, AAAI.
[36] Kristiaan M. Glorie,et al. Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price , 2014, Manuf. Serv. Oper. Manag..
[37] Tuomas Sandholm,et al. Fast Optimal Clearing of Capped-Chain Barter Exchanges , 2016, AAAI.
[38] David Manlove,et al. Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs , 2009, Discret. Math. Algorithms Appl..
[39] L. Shapley,et al. On cores and indivisibility , 1974 .
[40] Itai Ashlagi,et al. Kidney exchange in dynamic sparse heterogenous pools , 2013, EC '13.
[41] F T Rapaport,et al. The case for a living emotionally related international kidney donor exchange registry. , 1986, Transplantation proceedings.
[42] Toby Walsh,et al. PrefLib: A Library for Preferences http://www.preflib.org , 2013, ADT.
[43] Ariel D. Procaccia,et al. Price of fairness in kidney exchange , 2014, AAMAS.
[44] Tayfun Sönmez,et al. Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy , 2013 .
[45] Tuomas Sandholm,et al. FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments , 2015, AAAI.
[46] Ariel D. Procaccia,et al. Harnessing the power of two crossmatches , 2013, EC '13.
[47] D. Segev,et al. Domino paired kidney donation: a strategy to make best use of live non-directed donation , 2006, The Lancet.
[48] Xenia Klimentova,et al. A compact formulation for maximizing the expected number of transplants in kidney exchange programs , 2015 .
[49] M. Utku Ünver,et al. Efficient Kidney Exchange: Coincidence of Wants in a Markets with Compatibility-Based Preferences , 2009 .
[50] Marek Cygan,et al. Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[51] David Manlove,et al. Paired and Altruistic Kidney Donation in the UK , 2012, ACM J. Exp. Algorithmics.
[52] Rapaport Ft,et al. The case for a living emotionally related international kidney donor exchange registry. , 1986 .