IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v60y2012i2p475-489.html

Exact FCFS Matching Rates for Two Infinite Multitype Sequences

Citations

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


Cited by:

  1. Masanet, Thomas & Audry, Benoît & Jacquelinet, Christian & Moyal, Pascal, 2026. "Toward organ shortage resilient allocation policies using real-time queueing models for liver transplantation," European Journal of Operational Research, Elsevier, vol. 328(3), pages 1054-1067.
  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. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
  4. Ross Anderson & Itai Ashlagi & David Gamarnik & Yash Kanoria, 2017. "Efficient Dynamic Barter Exchange," Operations Research, INFORMS, vol. 65(6), pages 1446-1459, December.
  5. Itai Ashlagi & Maximilien Burq & Patrick Jaillet & Vahideh Manshadi, 2019. "On Matching and Thickness in Heterogeneous Dynamic Markets," Operations Research, INFORMS, vol. 67(4), pages 927-949, July.
  6. Ming Hu & Yun Zhou, 2022. "Dynamic Type Matching," Manufacturing & Service Operations Management, INFORMS, vol. 24(1), pages 125-142, January.
  7. Bušić Ana & Cadas Arnaud & Doncel Josu & Fourneau Jean-Michel, 2024. "Performance paradox of dynamic matching models under greedy policies," Queueing Systems: Theory and Applications, Springer, vol. 107(3), pages 257-293, September.
  8. P. Moyal & A. Bušić & J. Mairesse, 2024. "On the sub-additivity of stochastic matching," Queueing Systems: Theory and Applications, Springer, vol. 107(3), pages 295-339, September.
  9. Ivo Adan & Ana Bušić & Jean Mairesse & Gideon Weiss, 2018. "Reversibility and Further Properties of FCFS Infinite Bipartite Matching," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 598-621, May.
  10. 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.
  11. Dongyuan Zhan & Gideon Weiss, 2018. "Many-server scaling of the N-system under FCFS–ALIS," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 27-71, February.
  12. Jingui Xie & Yiming Fan & Mabel C. Chou, 2017. "Flexibility design in loss and queueing systems: efficiency of k-chain configuration," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 286-308, June.
  13. Burak Büke & Hanyi Chen, 2017. "Fluid and diffusion approximations of probabilistic matching systems," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 1-33, June.
  14. Frank Kelly & Elena Yudovina, 2015. "A Markov model of a limit order book: thresholds, recurrence, and trading strategies," Papers 1504.00579, arXiv.org, revised Mar 2017.
  15. Angelos Aveklouris & Levi DeValve & Maximiliano Stock & Amy Ward, 2025. "Matching Impatient and Heterogeneous Demand and Supply," Operations Research, INFORMS, vol. 73(3), pages 1637-1658, May.
  16. Jean Mairesse & Pascal Moyal, 2022. "New frontiers for stochastic matching," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 473-475, April.
  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. Gideon Weiss, 2020. "Directed FCFS infinite bipartite matching," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 387-418, December.
  19. Frank Kelly & Elena Yudovina, 2018. "A Markov Model of a Limit Order Book: Thresholds, Recurrence, and Trading Strategies," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 181-203, February.
  20. Yichuan Ding & S. Thomas McCormick & Mahesh Nagarajan, 2021. "A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards," Operations Research, INFORMS, vol. 69(4), pages 1256-1281, July.
  21. Adan, Ivo & Foss, Sergey & Shneer, Seva & Weiss, Gideon, 2020. "Local stability in a transient Markov chain," Statistics & Probability Letters, Elsevier, vol. 165(C).
  22. 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.
  23. 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.
  24. Ali Aouad & Ömer Sarıtaç, 2022. "Dynamic Stochastic Matching Under Limited Time," Operations Research, INFORMS, vol. 70(4), pages 2349-2383, July.
  25. Lisa Aoki Hillas & René Caldentey & Varun Gupta, 2024. "Heavy traffic analysis of multi-class bipartite queueing systems under FCFS," Queueing Systems: Theory and Applications, Springer, vol. 106(3), pages 239-284, April.
  26. 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.
  27. Jocelyn Begeot & Irène Marcovici & Pascal Moyal, 2023. "Stability regions of systems with compatibilities and ubiquitous measures on graphs," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 275-312, April.
  28. Kristen Gardner & Rhonda Righter, 2020. "Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 3-51, October.
  29. Mohammadreza Nazari & Alexander L. Stolyar, 2019. "Reward maximization in general dynamic matching systems," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 143-170, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.