IDEAS home Printed from https://ideas.repec.org/r/ucp/jpolec/doi10.1086-704761.html

Thickness and Information in Dynamic Matching Markets

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Itai Ashlagi & Maximilien Burq & Chinmoy Dutta & Patrick Jaillet & Amin Saberi & Chris Sholley, 2023. "Edge-Weighted Online Windowed Matching," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 999-1016, May.
  2. Gregory Z. Gutin & Daniel Karapetyan & Philip R. Neary & Alexander Vickery & Anders Yeo, 2024. "Speeding up deferred acceptance," Papers 2409.06865, arXiv.org.
  3. Jose H. Blanchet & Martin I. Reiman & Virag Shah & Lawrence M. Wein & Linjia Wu, 2022. "Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities," Operations Research, INFORMS, vol. 70(6), pages 3355-3370, November.
  4. John Pang & Weixuan Lin & Hu Fu & Jack Kleeman & Eilyan Bitar & Adam Wierman, 2022. "Transparency and Control in Platforms for Networked Markets," Operations Research, INFORMS, vol. 70(3), pages 1665-1690, May.
  5. Guiyun Feng & Guangwen Kong & Zizhuo Wang, 2021. "We Are on the Way: Analysis of On-Demand Ride-Hailing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 23(5), pages 1237-1256, September.
  6. Scott Duke Kominers & Parag A. Pathak & Tayfun Sönmez & M. Utku Ünver, 2020. "Paying It Backward and Forward: Expanding Access to Convalescent Plasma Therapy Through Market Design," Boston College Working Papers in Economics 1007, Boston College Department of Economics.
  7. Kratz, Jörgen, 2024. "Conflicting objectives in kidney exchange," Journal of Economic Theory, Elsevier, vol. 217(C).
  8. Loertscher, Simon & Muir, Ellen V. & Taylor, Peter G., 2022. "Optimal market thickness," Journal of Economic Theory, Elsevier, vol. 200(C).
  9. Nicole Immorlica & Brendan Lucier & Vahideh Manshadi & Alexander Wei, 2023. "Designing Approximately Optimal Search on Matching Platforms," Management Science, INFORMS, vol. 69(8), pages 4609-4626, August.
  10. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
  11. Mingwei Yang & Sophie H. Yu, 2026. "Online Metric Matching: Beyond the Worst Case," Operations Research, INFORMS, vol. 74(1), pages 130-140, January.
  12. Dongling Rong & Xinyu Sun & Meilin Zhang & Shuangchi He, 2025. "Satisficing Approach to On-Demand Ride Matching," INFORMS Journal on Computing, INFORMS, vol. 37(2), pages 413-427, March.
  13. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
  14. Ali Aouad & Daniela Saban, 2023. "Online Assortment Optimization for Two-Sided Matching Platforms," Management Science, INFORMS, vol. 69(4), pages 2069-2087, April.
  15. Philipp Afèche & René Caldentey & Varun Gupta, 2022. "On the Optimal Design of a Bipartite Matching Queueing System," Operations Research, INFORMS, vol. 70(1), pages 363-401, January.
  16. Haeringer, Guillaume & Iehlé, Vincent, 2021. "Gradual college admission," Journal of Economic Theory, Elsevier, vol. 198(C).
  17. Battal Doğan & M. Bumin Yenmez, 2023. "When does an additional stage improve welfare in centralized assignment?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(4), pages 1145-1173, November.
  18. Jhan-Jia Lin & Yu-Tse Lee & Ja-Ling Wu, 2021. "The Effect of Thickness-Based Dynamic Matching Mechanism on a Hyperledger Fabric-Based TimeBank System," Future Internet, MDPI, vol. 13(3), pages 1-21, March.
  19. Yeon-Koo Che, 2025. "Dynamic Market Design," Papers 2601.00155, arXiv.org.
  20. Süleyman Kerimov & Itai Ashlagi & Itai Gurvich, 2025. "On the Optimality of Greedy Policies in Dynamic Matching," Operations Research, INFORMS, vol. 73(1), pages 560-582, January.
  21. Pietro Ortoleva & Evgenii Safonov & Leeat Yariv, 2021. "Who Cares More? Allocation with Diverse Preference Intensities," Papers 2108.12025, arXiv.org.
  22. Danny Segev, 2025. "Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers," Operations Research, INFORMS, vol. 73(5), pages 2744-2760, September.
  23. Chenyin Gong & Qing Li, 2026. "A Rolling Recruitment Process Under Applicant Stochastic Departures," Manufacturing & Service Operations Management, INFORMS, vol. 28(1), pages 290-307, January.
  24. Itai Arieli & Moran Koren & Rann Smorodinsky, 2024. "Information aggregation in large collective purchases," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 78(1), pages 295-345, August.
  25. Kirill Rudov, 2024. "Fragile Stable Matchings," Papers 2403.12183, arXiv.org.
  26. Li, Manzi & Jiang, Gege & Lo, Hong K., 2023. "Optimal cancellation penalty for competing ride-sourcing platforms under waiting time uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
  27. Yanlu Zhao & Felix Papier & Chung-Piaw Teo, 2024. "Market Thickness in Online Food Delivery Platforms: The Impact of Food Processing Times," Manufacturing & Service Operations Management, INFORMS, vol. 26(3), pages 853-872, May.
  28. Tayfun Sönmez & M Utku Ünver, 2017. "Market design for living-donor organ exchanges: an economic policy perspective," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 676-704.
  29. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2020. "Optimal dynamic matching," Theoretical Economics, Econometric Society, vol. 15(3), July.
  30. Ce Liu, 2020. "Stability in Repeated Matching Markets," Papers 2007.03794, arXiv.org, revised Mar 2021.
  31. Daniel Fershtman & Alessandro Pavan, 2022. "Matching auctions," RAND Journal of Economics, RAND Corporation, vol. 53(1), pages 32-62, March.
  32. Mertikopoulos, Panayotis & Nax, Heinrich H. & Pradelski, Bary S.R., 2024. "Quick or cheap? Breaking points in dynamic markets," Journal of Mathematical Economics, Elsevier, vol. 112(C).
  33. Marco Pavone & Amin Saberi & Maximilian Schiffer & Matt Wu Tsao, 2022. "Technical Note—Online Hypergraph Matching with Delays," Operations Research, INFORMS, vol. 70(4), pages 2194-2212, July.
  34. Ruiqi Zhou & Donghao Zhu & Houcai Shen, 2026. "A Learning-Based Hybrid Decision Framework for Matching Systems with User Departure Detection," Papers 2602.22412, arXiv.org.
  35. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2023. "Task allocation and on-the-job training," Journal of Economic Theory, Elsevier, vol. 207(C).
  36. Kostas Bimpikis & Wedad J. Elmaghraby & Ken Moon & Wenchang Zhang, 2020. "Managing Market Thickness in Online Business-to-Business Markets," Management Science, INFORMS, vol. 66(12), pages 5783-5822, December.
  37. Irene Lo & Vahideh Manshadi & Scott Rodilitz & Ali Shameli, 2020. "Commitment on Volunteer Crowdsourcing Platforms: Implications for Growth and Engagement," Papers 2005.10731, arXiv.org, revised Jul 2021.
  38. Lingbo Huang & Tracy Xiao Liu & Jun Zhang, 2023. "Born to wait? A study on allocation rules in booking systems," Discussion Papers 2023-04, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
  39. Naonori Kakimura & Donghao Zhu, 2021. "Dynamic Bipartite Matching Market with Arrivals and Departures," Papers 2110.10824, arXiv.org.
  40. Guangju Wang & Hailun Zhang & Jiheng Zhang, 2024. "On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation," Operations Research, INFORMS, vol. 72(3), pages 1278-1297, May.
  41. Johannes Baumler & Martin Bullinger & Stefan Kober & Donghao Zhu, 2022. "Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets," Papers 2206.10287, arXiv.org, revised Nov 2025.
  42. Manjunath, Vikram & Westkamp, Alexander, 2021. "Strategy-proof exchange under trichotomous preferences," Journal of Economic Theory, Elsevier, vol. 193(C).
  43. Kim, Jaehong & Li, Mengling & Xu, Menghan, 2021. "Organ donation with vouchers," Journal of Economic Theory, Elsevier, vol. 191(C).
  44. Gad Allon & Joseph Carlstein & Yonatan Gur, 2025. "Leveraging Consensus Effect to Optimize Ranking in Online Discussion Boards," Manufacturing & Service Operations Management, INFORMS, vol. 27(6), pages 1701-1720, November.
  45. René Caldentey & Lisa Aoki Hillas & Varun Gupta, 2025. "Designing Service Menus for Bipartite Queueing Systems," Operations Research, INFORMS, vol. 73(3), pages 1496-1534, May.
  46. SHIMIZU, Chihiro, 2026. "Information Disclosure and Welfare in Housing Markets : A Search-Theoretic Framework with Endogenous Participation and Broker Exit," RCESR Discussion Paper Series DP26-4, Research Center for Economic and Social Risks, Institute of Economic Research, Hitotsubashi University.
  47. Sushil Mahavir Varma & Pornpawee Bumpensanti & Siva Theja Maguluri & He Wang, 2023. "Dynamic Pricing and Matching for Two-Sided Queues," Operations Research, INFORMS, vol. 71(1), pages 83-100, January.
  48. Ali Aouad & Ömer Sarıtaç, 2022. "Dynamic Stochastic Matching Under Limited Time," Operations Research, INFORMS, vol. 70(4), pages 2349-2383, July.
  49. Saharsh Agarwal & Deepa Mani & Rahul Telang, 2023. "The Impact of Ride-Hailing Services on Congestion: Evidence from Indian Cities," Manufacturing & Service Operations Management, INFORMS, vol. 25(3), pages 862-883, May.
  50. Afshin Nikzad & Philipp Strack, 2024. "Equity and Efficiency in Dynamic Matching: Extreme Waitlist Policies," Management Science, INFORMS, vol. 70(8), pages 5187-5207, August.
  51. Zhiyuan Chen & Rui & Chen & Ming Hu & Yun Zhou, 2026. "Dynamic Matching Under Patience Imbalance," Papers 2602.03995, arXiv.org.
  52. Doval, Laura & Szentes, Balázs, 2025. "On the efficiency of queueing in dynamic matching markets," Games and Economic Behavior, Elsevier, vol. 150(C), pages 106-130.
  53. Süleyman Kerimov & Itai Ashlagi & Itai Gurvich, 2024. "Dynamic Matching: Characterizing and Achieving Constant Regret," Management Science, INFORMS, vol. 70(5), pages 2799-2822, May.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.