IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v100y2022i3d10.1007_s11134-022-09816-0.html
   My bibliography  Save this article

Learning and data-driven optimization in queues with strategic customers

Author

Listed:
  • Apostolos Burnetas

    (National and Kapodistrian University of Athens)

Abstract

No abstract is available for this item.

Suggested Citation

  • Apostolos Burnetas, 2022. "Learning and data-driven optimization in queues with strategic customers," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 517-519, April.
    • Handle: RePEc:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09816-0
    DOI: 10.1007/s11134-022-09816-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09816-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-022-09816-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ying Chen & John J. Hasenbein, 2020. "Knowledge, congestion, and economics: Parameter uncertainty in Naor’s model," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 83-99, October.
    2. Nahum Shimkin & Adam Shwartz, 1996. "Asymptotically Efficient Adaptive Strategies in Repeated Games Part II. Asymptotic Optimality," Mathematics of Operations Research, INFORMS, vol. 21(2), pages 487-512, May.
    3. Eyal Even-Dar & Sham. M. Kakade & Yishay Mansour, 2009. "Online Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 726-736, August.
    4. Panayotis Mertikopoulos & William H. Sandholm, 2016. "Learning in Games via Reinforcement and Regularization," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1297-1324, November.
    5. Moshe Haviv & Ramandeep S. Randhawa, 2014. "Pricing in Queues Without Demand Information," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 401-411, July.
    6. Aurélien Garivier & Pierre Ménard & Gilles Stoltz, 2019. "Explore First, Exploit Next: The True Shape of Regret in Bandit Problems," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 377-399, May.
    7. Apostolos N. Burnetas & Michael N. Katehakis, 1997. "Optimal Adaptive Policies for Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 222-255, February.
    8. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    9. Apostolos Burnetas & Antonis Economou & George Vasiliadis, 2017. "Strategic customer behavior in a queueing system with delayed observations," Queueing Systems: Theory and Applications, Springer, vol. 86(3), pages 389-418, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    2. Hassin, Refael & Haviv, Moshe & Oz, Binyamin, 2023. "Strategic behavior in queues with arrival rate uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 217-224.
    3. Inchi Hu & Chi-Wen Jevons Lee, 2003. "Bayesian Adaptive Stochastic Process Termination," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 361-381, May.
    4. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
    5. Meng Qi & Ying Cao & Zuo-Jun (Max) Shen, 2022. "Distributionally Robust Conditional Quantile Prediction with Fixed Design," Management Science, INFORMS, vol. 68(3), pages 1639-1658, March.
    6. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    7. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    8. Martino Banchio & Giacomo Mantegazza, 2022. "Artificial Intelligence and Spontaneous Collusion," Papers 2202.05946, arXiv.org, revised Sep 2023.
    9. Xinchang Wang & Sigrún Andradóttir & Hayriye Ayhan, 2019. "Optimal pricing for tandem queues with finite buffers," Queueing Systems: Theory and Applications, Springer, vol. 92(3), pages 323-396, August.
    10. Andrew Butler & Roy Kwon, 2021. "Efficient differentiable quadratic programming layers: an ADMM approach," Papers 2112.07464, arXiv.org.
    11. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    12. Corredera, Alberto & Ruiz, Carlos, 2023. "Prescriptive selection of machine learning hyperparameters with applications in power markets: Retailer’s optimal trading," European Journal of Operational Research, Elsevier, vol. 306(1), pages 370-388.
    13. Shuaian Wang & Xuecheng Tian, 2023. "A Deficiency of the Predict-Then-Optimize Framework: Decreased Decision Quality with Increased Data Size," Mathematics, MDPI, vol. 11(15), pages 1-9, July.
    14. Toon Vanderschueren & Robert Boute & Tim Verdonck & Bart Baesens & Wouter Verbeke, 2022. "Prescriptive maintenance with causal machine learning," Papers 2206.01562, arXiv.org.
    15. Andrew Butler & Roy H. Kwon, 2021. "Data-driven integration of norm-penalized mean-variance portfolios," Papers 2112.07016, arXiv.org, revised Nov 2022.
    16. Sel, Burakhan & Minner, Stefan, 2022. "A hedging policy for seaborne forward freight markets based on probabilistic forecasts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    17. Mertikopoulos, Panayotis & Sandholm, William H., 2018. "Riemannian game dynamics," Journal of Economic Theory, Elsevier, vol. 177(C), pages 315-364.
    18. Dmitry B. Rokhlin, 2020. "Relative utility bounds for empirically optimal portfolios," Papers 2006.05204, arXiv.org.
    19. Robert Engel & Pablo Fernandez & Antonio Ruiz-Cortes & Aly Megahed & Juan Ojeda-Perez, 2022. "SLA-aware operational efficiency in AI-enabled service chains: challenges ahead," Information Systems and e-Business Management, Springer, vol. 20(1), pages 199-221, March.
    20. Jian Cao & Yongjiang Guo & Zhongxin Hu, 2023. "The Effect of Loss Preference on Queueing with Information Disclosure Policy," Methodology and Computing in Applied Probability, Springer, vol. 25(3), pages 1-25, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09816-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.