IDEAS home Printed from https://ideas.repec.org/r/cpr/ceprdp/12986.html

Optimal Dynamic Matching

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. 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.
  3. 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.
  4. Ming Hu & Yun Zhou, 2022. "Dynamic Type Matching," Manufacturing & Service Operations Management, INFORMS, vol. 24(1), pages 125-142, January.
  5. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
  6. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2023. "Task allocation and on-the-job training," Journal of Economic Theory, Elsevier, vol. 207(C).
  7. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
  8. 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.
  9. Jingwen Tang & Izak Duenyas & Cong Shi & Nan Yang, 2026. "Multiproduct Inventory Systems with Upgrading: Replenishment, Allocation, and Online Learning," Manufacturing & Service Operations Management, INFORMS, vol. 28(2), pages 537-557, March.
  10. 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.
  11. Jerry Anunrojwong & Krishnamurthy Iyer & Vahideh Manshadi, 2023. "Information Design for Congested Social Services: Optimal Need-Based Persuasion," Management Science, INFORMS, vol. 69(7), pages 3778-3796, July.
  12. Yeon-Koo Che, 2025. "Dynamic Market Design," Papers 2601.00155, arXiv.org.
  13. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
  14. Niclas Boehmer & Markus Brill & Ulrike Schmidt-Kraepelin, 2021. "Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space," Papers 2102.07441, arXiv.org.
  15. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2020. "Optimal dynamic matching," Theoretical Economics, Econometric Society, vol. 15(3), July.
  16. Ramesh Johari & Vijay Kamble & Yash Kanoria, 2021. "Matching While Learning," Operations Research, INFORMS, vol. 69(2), pages 655-681, March.
  17. Jose H. Blanchet & Martin I. Reiman & Viragh Shah & Lawrence M. Wein & Linjia Wu, 2020. "Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities," Papers 2002.03205, arXiv.org, revised Jun 2021.
  18. Ce Liu, 2020. "Stability in Repeated Matching Markets," Papers 2007.03794, arXiv.org, revised Mar 2021.
  19. 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).
  20. Combe, Julien & Nora, Vladyslav & Tercieux, Olivier, 2025. "Dynamic assignment without money: optimality of spot mechanisms," Theoretical Economics, Econometric Society, vol. 20(1), January.
  21. 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.
  22. Lei, Xiaochang, 2023. "Optimal queue to minimize waste," Mathematical Social Sciences, Elsevier, vol. 123(C), pages 87-94.
  23. Nick Arnosti & Peng Shi, 2020. "Design of Lotteries and Wait-Lists for Affordable Housing Allocation," Management Science, INFORMS, vol. 66(6), pages 2291-2307, June.
  24. Mohammad Akbarpour & Yeganeh Alimohammadi & Shengwu Li & Amin Saberi, 2021. "The Value of Excess Supply in Spatial Matching Markets," Papers 2104.03219, arXiv.org.
  25. Doval, Laura, 2022. "Dynamically stable matching," Theoretical Economics, Econometric Society, vol. 17(2), May.
  26. 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.
  27. Souvik Roy & Agamani Saha, 2025. "A Directed Lazy Random Walk Model to Three-Way Dynamic Matching Problem," Papers 2507.06126, arXiv.org.
  28. Vincent Iehlé, 2016. "Gradual College Admisssion," Post-Print halshs-02367006, HAL.
  29. Maxey, Tyler, 2023. "Dynamic matching with transfers," Economics Letters, Elsevier, vol. 233(C).
  30. Zhiyuan Chen & Rui & Chen & Ming Hu & Yun Zhou, 2026. "Dynamic Matching Under Patience Imbalance," Papers 2602.03995, arXiv.org.
  31. 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.
  32. Ludwig Dierks & Nils Olberg & Sven Seuken & Vincent W. Slaugh & M. Utku Ünver, 2025. "Search and Matching for Adoption from Foster Care," Boston College Working Papers in Economics 1093, Boston College Department of Economics.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.