Strategic bidding in a discrete accumulating priority queue

Raneetha Abeywickrama; Moshe Haviv; Binyamin Oz; Ilze Ziedins

doi:https://doi.org/10.1016/j.orl.2019.02.004

Strategic bidding in a discrete accumulating priority queue

Raneetha Abeywickrama, Moshe Haviv, Binyamin Oz, Ilze Ziedins

Research output: Contribution to journal › Article › peer-review

Abstract

We consider an unobservable M/G/1 accumulating priority queue where homogeneous customers choose one of a finite number of priority classes. We show that there are either one or two pure Nash equilibrium strategies. In the latter case they are two consecutive classes and there exists an equilibrium strategy mixing between these two classes. We find the best-response function and show that it is unimodal, with follow-the-crowd and avoid-the-crowd instances.

Original language	English
Pages (from-to)	162-167
Number of pages	6
Journal	Operations Research Letters
Volume	47
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2019.02.004
State	Published - May 2019
Externally published	Yes

Keywords

Accumulating priority queue
Equilibrium strategies
Strategic behavior in queues

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

https://doi.org/10.1016/j.orl.2019.02.004

Cite this

@article{d9796b33e0ae4d64af64b3148bbbef65,

title = "Strategic bidding in a discrete accumulating priority queue",

abstract = "We consider an unobservable M/G/1 accumulating priority queue where homogeneous customers choose one of a finite number of priority classes. We show that there are either one or two pure Nash equilibrium strategies. In the latter case they are two consecutive classes and there exists an equilibrium strategy mixing between these two classes. We find the best-response function and show that it is unimodal, with follow-the-crowd and avoid-the-crowd instances.",

keywords = "Accumulating priority queue, Equilibrium strategies, Strategic behavior in queues",

author = "Raneetha Abeywickrama and Moshe Haviv and Binyamin Oz and Ilze Ziedins",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2019",

month = may,

doi = "https://doi.org/10.1016/j.orl.2019.02.004",

language = "الإنجليزيّة",

volume = "47",

pages = "162--167",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Strategic bidding in a discrete accumulating priority queue

AU - Abeywickrama, Raneetha

AU - Haviv, Moshe

AU - Oz, Binyamin

AU - Ziedins, Ilze

PY - 2019/5

Y1 - 2019/5

N2 - We consider an unobservable M/G/1 accumulating priority queue where homogeneous customers choose one of a finite number of priority classes. We show that there are either one or two pure Nash equilibrium strategies. In the latter case they are two consecutive classes and there exists an equilibrium strategy mixing between these two classes. We find the best-response function and show that it is unimodal, with follow-the-crowd and avoid-the-crowd instances.

AB - We consider an unobservable M/G/1 accumulating priority queue where homogeneous customers choose one of a finite number of priority classes. We show that there are either one or two pure Nash equilibrium strategies. In the latter case they are two consecutive classes and there exists an equilibrium strategy mixing between these two classes. We find the best-response function and show that it is unimodal, with follow-the-crowd and avoid-the-crowd instances.

KW - Accumulating priority queue

KW - Equilibrium strategies

KW - Strategic behavior in queues

UR - http://www.scopus.com/inward/record.url?scp=85062892861&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.orl.2019.02.004

DO - https://doi.org/10.1016/j.orl.2019.02.004

M3 - مقالة

SN - 0167-6377

VL - 47

SP - 162

EP - 167

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

Strategic bidding in a discrete accumulating priority queue

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this