On Matching and Thickness in Heterogeneous Dynamic Markets

Published Online:https://doi.org/10.1287/opre.2018.1826

References

  • Adan I, Weiss G (2012) Exact FCFS matching rates for two infinite multitype sequences. Oper. Res. 60(2):475–489.LinkGoogle Scholar
  • Agarwal N, Ashlagi I, Azevedo E, Featherstone C, Karaduman O (2018) Market failure in kidney exchange. Working Paper No. 24775, National Bureau of Economic Research, Cambridge.Google Scholar
  • Akbarpour M, Li S, Oveis Gharan S (2014) Dynamic matching market design. Working paper, Stanford University, Stanford, CA.Google Scholar
  • Anderson R, Ashlagi I, Kanoria Y, Gamarnik D (2017) Efficient dynamic barter exchange. Oper. Res. 65(6):1446–1459.LinkGoogle Scholar
  • Anderson R, Ashlagi I, Gamarnik D, Rees M, Roth A, Sönmez T, Ünver M (2015) Kidney exchange and the alliance for paired donation: Operations research changes the way kidneys are transplanted. Interfaces 45(1):26–42.LinkGoogle Scholar
  • Ashlagi I, Roth A (2012) New challenges in multi-hospital kidney exchange. Amer. Econom. Rev. 102(3):354–359.CrossrefGoogle Scholar
  • Ashlagi I, Gamarnik D, Rees M, Roth A (2012) The need for (long) chains in kidney exchange. Technical report, National Bureau of Economic Research, Cambridge, MA.CrossrefGoogle Scholar
  • Ashlagi I, Bingaman A, Burq M, Manshadi V, Melcher M, Murphey M, Roth AE, Rees M (2017) The effect of match-run frequencies on the number of transplants and waiting times in kidney exchange. Amer. J. Transplantation 18(5):1177–1186.CrossrefGoogle Scholar
  • Ashlagi I, Roth AE (2014) Free riding and participation in large scale, multi-hospital kidney exchange. Theoret. Econom. 9(3):817–863.CrossrefGoogle Scholar
  • Baccara M, Lee S, Yariv L (2015) Optimal dynamic matching. Working paper, Olin School of Business, Washington University, St. Louis.Google Scholar
  • Biro P, Burnapp L, Bernadette H, Hemke A, Johnson R, van de Klundert J, Manlove D (2017) First Handbook of the COST Action CA15210: European Network for Collaboration on Kidney Exchange Programmes (ENCKEP) (European Cooperation in Science and Technology, Brussels).Google Scholar
  • Bloch F, Cantala D (2014) Dynamic allocation of objects to queuing agents: The discrete model Working paper, Université Paris 1 and Paris School of Economics, Paris.Google Scholar
  • Böhmig GA, Fronek J, Slavcev A, Fischer GF, Berlakovich G, Viklicky O (2017) Czech-Austrian kidney paired donation: First European cross-border living donor kidney exchange. Transplant Internat. 30(6):638–639.CrossrefGoogle Scholar
  • Caldentey R, Kaplan EH, Weiss G (2009) FCFS infinite bipartite matching of servers and customers. Adv. Appl. Prob. 41(3):695–730.CrossrefGoogle Scholar
  • Dickerson JP, Procaccia AD, Sandholm T (2012a) Dynamic matching via weighted myopia with application to kidney exchange. Proc. Twenty-Sixth AAAI Conf. Artificial Intelligence (AAAI, Toronto), 1340–1346.Google Scholar
  • Dickerson JP, Procaccia AD, Sandholm T (2012b) Optimizing kidney exchange with transplant chains: Theory and reality. Proc. 11th Internat. Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Valencia, Spain), 808–815.Google Scholar
  • Ding Y, Ge D, He S, Ryan CT (2015) A non-asymptotic approach to analyzing kidney exchange graphs. Proc. 16th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 257–258.CrossrefGoogle Scholar
  • Doval L (2014) A theory of stability in dynamic matching markets. Technical report, California Institute of Technology, Pasadena.Google Scholar
  • Feldman J, Mehta A, Mirrokni VS, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. Proc. 50th Annual IEEE Sympos. Foundations Comput. Sci. (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 117–126.CrossrefGoogle Scholar
  • Ferrari P, Weimar W, Johnson RJ, Lim W, Tinckam K (2014) Kidney paired donation: Principles, protocols and programs. Nephrology Dialysis Transplantation 30(8):1276–1285.CrossrefGoogle Scholar
  • Ferrari P, Fidler S, Holdsworth R, Woodroffe C, Tassone G, Watson N, Cantwell L, et al.. (2012) High transplant rates of highly sensitized recipients with virtual crossmatching in kidney paired donation. Transplantation 94(7):744–749.CrossrefGoogle Scholar
  • Fershtman D, Pavan A (2015) Re-matching, experimentation, and cross-subsidization. Working paper, Northwestern University, Evanston, IL.Google Scholar
  • Glorie KM, van de Klundert JJ, Wagelmans AP (2014) Kidney exchange with long chains: An efficient pricing algorithm for clearing barter exchanges with branch-and-price. Manufacturing Service Oper. Management 16(4):498–512.LinkGoogle Scholar
  • Goel G, Mehta A (2008) Online budgeted matching in random input models with applications to Adwords. Proc. 19th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, San Francisco), 982–991.Google Scholar
  • Gurvich I, Ward A (2014) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.LinkGoogle Scholar
  • Jaillet P, Lu X (2013) Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39(3):624–646.LinkGoogle Scholar
  • Johnson R, Allen J, Fuggle S, Bradley JA, Rudge C (2008) Early experience of paired living kidney donation in the United Kingdom. Transplantation 86(12):1672–1677.CrossrefGoogle Scholar
  • Kadam S, Kotowski M (2018) Multiperiod matching. Internat. Econom. Rev. 59(4):1927–1947.CrossrefGoogle Scholar
  • Karp RM, Vazirani Uv, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. Theory Comput. (ACM, New York), 352–358.CrossrefGoogle Scholar
  • Leshno J (2014) Dynamic matching in overloaded waiting lists. Working paper, University of Chicago Booth School of Business, Chicago.Google Scholar
  • Malik S, Cole E (2014) Foundations and principles of the Canadian living donor paired exchange program. Canadian J. Kidney Health Disease 1:6.CrossrefGoogle Scholar
  • Manshadi VH, Oveis-Gharan S, Saberi A (2011) Online stochastic matching: Online actions based on offline statistics. Proc. 22nd Annual ACM-SIAM Sympos. Discrete Algorithms (ACM, San Francisco), 1285–1294.CrossrefGoogle Scholar
  • Nikzad A, Akbarpour M, Rees MA, Roth AE (2017) Financing transplants’ costs of the poor: A dynamic model of global kidney exchange. Working paper, Stanford University, Stanford, CA.Google Scholar
  • National Kidney Registry (2017) Paired exchange results quarterly report. Technical report, National Kidney Registry, Babylon, NY.Google Scholar
  • Rees MA, Kopke JE, Pelletier RP, Segev DL, Rutter ME, Fabrega AJ, Rogers J, et al.. (2009) A non-simultaneous extended altruistic donor chain. New England J. Medicine 360(11):1096–1101.CrossrefGoogle Scholar
  • Roth AE (2008) What have we learned from market design? Econom. J. 118(527):285–310.CrossrefGoogle Scholar
  • Roth AE, Sönmez T, Ünver MU (2004) Kidney exchange. Quart. J. Econom. 119(2):457–488.CrossrefGoogle Scholar
  • Roth AE, Sönmez T, Ünver MU (2005) Pairwise kidney exchange. J. Econom. Theory 125(2):151–188.CrossrefGoogle Scholar
  • Roth AE, Sönmez T, Ünver MU (2007) Efficient kidney exchange: Coincidence of wants in markets with compatibility-based preferences. Amer. Econom. Rev. 97(3):828–851.CrossrefGoogle Scholar
  • Roth AE, Sönmez T, Ünver MU, Delmonico FL, Saidman SL (2006) Utilizing list exchange and nondirected donation through chain kidney paired donations. Amer. J. Transplantation 6(11):2694–2705.CrossrefGoogle Scholar
  • Siegel-Itzkovich J (2017) Israel and Cyprus sign accord for sharing kidneys from live donors. Jerusalem Post (June 20), http://www.jpost.com/Israel-News/Israel-and-Cyprus-sign-accord-for-sharing-kidneys-from-live-donors-497422.Google Scholar
  • Sönmez T, Unver MU, Yenmez MB (2017) Incentivized kidney exchange. Technical report, Department of Economics, Boston College, Boston.Google Scholar
  • Ünver MU (2010) Dynamic kidney exchange. Rev. Econom. Stud. 77(1):372–414.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.