Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow
暂无分享,去创建一个
Jian Li | Lingxiao Huang | Pingzhong Tang | Yicheng Liu | J. Li | Pingzhong Tang | Yicheng Liu | Lingxiao Huang
[1] James B. Orlin,et al. A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..
[2] Roger Latham. Lorenz-Dominating Income Tax Functions , 1988 .
[3] Chi Wan Sung. Achieving log-utility fairness in CDMA systems via majorization theory , 2009, IEEE Communications Letters.
[4] I. Olkin,et al. Inequalities: Theory of Majorization and Its Applications , 1980 .
[5] M. Utku Ünver,et al. Efficient Kidney Exchange: Coincidence of Wants in a Markets with Compatibility-Based Preferences , 2009 .
[6] Robert E. Tarjan,et al. A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..
[7] W. Cunningham,et al. A primal algorithm for optimum matching , 1978 .
[8] Ariel D. Procaccia,et al. Price of fairness in kidney exchange , 2014, AAMAS.
[9] David C. Parkes,et al. A random graph model of kidney exchanges: efficiency, individual-rationality and incentives , 2011, EC '11.
[10] Piotr Sankowski,et al. Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[11] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[12] Ariel D. Procaccia,et al. Dynamic Matching via Weighted Myopia with Application to Kidney Exchange , 2012, AAAI.
[13] Alvin E. Roth,et al. Pairwise Kidney Exchange , 2004, J. Econ. Theory.
[14] Ariel D. Procaccia,et al. Optimizing kidney exchange with transplant chains: theory and reality , 2012, AAMAS.
[15] D. Gamarnik,et al. The Need for (Long) Chains in Kidney Exchange , 2012 .
[16] Arie Tamir,et al. Least Majorized Elements and Generalized Polymatroids , 1995, Math. Oper. Res..
[17] M. Utku Ünver,et al. A Kidney Exchange Clearinghouse in New England. , 2005, The American economic review.
[18] D. Segev,et al. Kidney paired donation and optimizing the use of live donor organs. , 2005, JAMA.
[19] John McGregor,et al. Mix and Match , 2008, J. Object Technol..
[20] Hervé Moulin,et al. A New Solution to the Random Assignment Problem , 2001, J. Econ. Theory.
[21] Robert A Montgomery,et al. A Comparison of Populations Served by Kidney Paired Donation and List Paired Donation , 2005, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.
[22] Satoru Iwata,et al. A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.
[23] Özgür Yilmaz,et al. Kidney exchange: An egalitarian mechanism , 2011, J. Econ. Theory.
[24] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[25] Satoru Iwata,et al. A simple combinatorial algorithm for submodular function minimization , 2009, SODA.
[26] Shimon Even,et al. An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[27] Avrim Blum,et al. Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.
[28] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[29] M. Utku Ünver,et al. Increasing the Opportunity of Live Kidney Donation by Matching for Two- and Three-Way Exchanges , 2006, Transplantation.
[30] Itai Ashlagi,et al. Individual rationality and participation in large scale, multi-hospital kidney exchange , 2011, EC '11.