Efficient Dynamic Barter Exchange
暂无分享,去创建一个
Itai Ashlagi | Yashodhan Kanoria | David Gamarnik | Ross Anderson | D. Gamarnik | I. Ashlagi | Yashodhan Kanoria | Ross Anderson
[1] S. Wittevrongel,et al. Queueing systems , 2019, Autom..
[2] Amy R. Ward,et al. On the dynamic control of matching queues , 2014 .
[3] Leonard Kleinrock,et al. Theory, Volume 1, Queueing Systems , 1975 .
[4] Yu Wang,et al. Timeshare Exchange Mechanisms , 2006, Manag. Sci..
[5] L. Shapley,et al. On cores and indivisibility , 1974 .
[6] Itai Ashlagi,et al. Kidney exchange in dynamic sparse heterogenous pools , 2013, EC '13.
[7] Gideon Weiss,et al. Fcfs infinite bipartite matching of servers and customers , 2009, Advances in Applied Probability.
[8] F. G. Foster. On the Stochastic Matrices Associated with Certain Queuing Processes , 1953 .
[9] M. Pycia,et al. Incentive Compatible Allocation and Exchange of Discrete Resources , 2015 .
[10] Mohammad Akbarpour,et al. Thickness and Information in Dynamic Matching Markets , 2018, Journal of Political Economy.
[11] M. Utku Ünver,et al. Dynamic Kidney Exchange , 2007 .
[12] E. Samuel-Cahn. Asymptotic Distributions for Occupancy and Waiting Time Problems with Positive Probability of Falling Through the Cells , 1974 .
[13] D. Gamarnik,et al. The Need for (Long) Chains in Kidney Exchange , 2012 .
[14] H. Mendelson. MARKET BEHAVIOR IN A CLEARING HOUSE , 1982 .
[15] J. Little. A Proof for the Queuing Formula: L = λW , 1961 .
[16] Ariel D. Procaccia,et al. Optimizing kidney exchange with transplant chains: theory and reality , 2012, AAMAS.
[17] Itai Ashlagi,et al. Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted , 2015, Interfaces.
[18] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[19] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[20] A. Roth. Incentive compatibility in a market with indivisible goods , 1982 .
[21] P. Glynn,et al. Bounding Stationary Expectations of Markov Processes , 2008 .
[22] Benny Sudakov,et al. Longest cycles in sparse random digraphs , 2011, Random Struct. Algorithms.
[23] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[24] M. Utku Ünver,et al. Efficient Kidney Exchange: Coincidence of Wants in a Markets with Compatibility-Based Preferences , 2009 .
[25] D. Gamarnik,et al. Validity of heavy traffic steady-state approximations in generalized Jackson networks , 2004, math/0410066.
[26] Andrew Postlewaite,et al. Weak Versus Strong Domination in a Market with Indivisible Goods , 1977 .
[27] A. Roth,et al. Free riding and participation in large scale, multi‐hospital kidney exchange , 2014 .
[28] Patrick Jaillet,et al. Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..
[29] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[30] Eric Budish,et al. The High-Frequency Trading Arms Race: Frequent Batch Auctions as a Market Design Response , 2015 .
[31] Ross P. Anderson,et al. Stochastic models and data driven simulations for healthcare operations , 2014 .
[32] M. Utku Ünver,et al. Incentive Compatible Allocation and Exchange of Discrete Resources , 2015 .
[33] W. Jevons. Money and the Mechanism of Exchange , 2001 .
[34] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[35] János Komlós,et al. The longest path in a random graph , 1981, Comb..
[36] A. Hordijk,et al. On the convergence of moments in stationary markov chains : (prepublication) , 1974 .
[37] Atila Abdulkadiroglu,et al. RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .
[38] Leeat Yariv,et al. Optimal Dynamic Matching , 2015, Theoretical Economics.
[39] Gideon Weiss,et al. Exact FCFS Matching Rates for Two Infinite Multitype Sequences , 2012, Oper. Res..
[40] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[41] R. Tweedie. The existence of moments for stationary Markov chains , 1983, Journal of Applied Probability.
[42] S. Asmussen,et al. Applied Probability and Queues , 1989 .
[43] Alvin E. Roth,et al. Pairwise Kidney Exchange , 2004, J. Econ. Theory.