The price of anarchy in an exponential multi-server

Moshe Haviv; Tim Roughgarden

doi:10.1016/j.orl.2006.09.005

The price of anarchy in an exponential multi-server

Moshe Haviv^*
, Tim Roughgarden

^*Corresponding author for this work

Department of Statistics

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

63 Scopus citations

Abstract

We consider two criteria for routing selection in a multi-server service station: the equilibrium and social optimization. The ratio between the average mean waiting times in these two routings is called the price of anarchy (PoA). We show that the worst-case PoA is precisely the number of servers.

Original language	English
Pages (from-to)	421-426
Number of pages	6
Journal	Operations Research Letters
Volume	35
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2006.09.005
State	Published - Jul 2007

Keywords

Multi-server queues
Price of anarchy

Access to Document

10.1016/j.orl.2006.09.005

Cite this

@article{f6dcc0ebf6f04a03a8999d97de8abf04,

title = "The price of anarchy in an exponential multi-server",

abstract = "We consider two criteria for routing selection in a multi-server service station: the equilibrium and social optimization. The ratio between the average mean waiting times in these two routings is called the price of anarchy (PoA). We show that the worst-case PoA is precisely the number of servers.",

keywords = "Multi-server queues, Price of anarchy",

author = "Moshe Haviv and Tim Roughgarden",

year = "2007",

month = jul,

doi = "10.1016/j.orl.2006.09.005",

language = "אנגלית",

volume = "35",

pages = "421--426",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - The price of anarchy in an exponential multi-server

AU - Haviv, Moshe

AU - Roughgarden, Tim

PY - 2007/7

Y1 - 2007/7

N2 - We consider two criteria for routing selection in a multi-server service station: the equilibrium and social optimization. The ratio between the average mean waiting times in these two routings is called the price of anarchy (PoA). We show that the worst-case PoA is precisely the number of servers.

AB - We consider two criteria for routing selection in a multi-server service station: the equilibrium and social optimization. The ratio between the average mean waiting times in these two routings is called the price of anarchy (PoA). We show that the worst-case PoA is precisely the number of servers.

KW - Multi-server queues

KW - Price of anarchy

UR - https://www.scopus.com/pages/publications/34248586694

U2 - 10.1016/j.orl.2006.09.005

DO - 10.1016/j.orl.2006.09.005

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:34248586694

SN - 0167-6377

VL - 35

SP - 421

EP - 426

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

The price of anarchy in an exponential multi-server

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this