Pure threshold strategies for a two-node tandem network under partial information

DOI10.1016/J.ORL.2015.06.014zbMath1408.90062arXiv1509.09179OpenAlexW2097213345MaRDI QIDQ1785405

Spyridoula Kanta, Bernardo D'auria

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.09179

zbMATH Keywords

partial informationthreshold strategytandem networkindividual optimization

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (6)

Conditioned tandem networks ⋮ Equilibrium behavior in tandem Markovian queues with heterogeneous delay-sensitive customers ⋮ Equilibrium strategies for a tandem network under partial information ⋮ Strategic customer behavior in a two-stage batch processing system ⋮ Social and Monopoly Optimization in Observable Queues ⋮ A game theoretic model of the behavioural gaming that takes place at the EMS-ED interface

Cites Work

• Unnamed Item
• Customer equilibrium and optimal strategies in Markovian queues in series
• To queue or not to queue: equilibrium behavior in queueing systems.
• Computational schemes for two exponential servers where the first has a finite buffer
• Optimal Design of Queueing Systems
• Deciding Which Queue to Join: Some Counterexamples
• Congestion Tolls for Poisson Queuing Processes
• On the Advantage of Being the First Server
• On the Effect of Finite Buffer Truncation in a Two-Node Jackson Network
• The Regulation of Queue Size by Levying Tolls

This page was built for publication: Pure threshold strategies for a two-node tandem network under partial information