Self and social optimization in multi-class multi-server queueing systems with relative priorities

Binyamin Oz; Moshe Haviv; Martin L. Puterman

Self and social optimization in multi-class multi-server queueing systems with relative priorities

Binyamin Oz, Moshe Haviv, Martin L. Puterman

Business Administration

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper we show how the use of relative priorities can reduce queueing costs in queueing systems that are multi-server and multi-class as long as customers choose their routing policy strategically. This is demonstrated in two basic models with multi-class Poisson arrivals and parallel memoryless servers with linear cost functions of class expected mean waiting times. For each model we investigate the Nash equilibria under a given relative priority rule. Next, we characterize the central planner's optimal policy, which is shown to be of strictly relative priorities in some cases.

Original language	English
Title of host publication	2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	135-141
Number of pages	7
ISBN (Electronic)	9788884435743
State	Published - 2 Jul 2014
Event	7th International Conference on Network Games, Control and Optimization, NetGCoop 2014 - Trento, Italy Duration: 29 Oct 2014 → 31 Oct 2014

Publication series

Name	2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014

Conference

Conference	7th International Conference on Network Games, Control and Optimization, NetGCoop 2014
Country/Territory	Italy
City	Trento
Period	29/10/14 → 31/10/14

Bibliographical note

Publisher Copyright:
© 2014 University of Trento.

Cite this

Oz, B., Haviv, M., & Puterman, M. L. (2014). Self and social optimization in multi-class multi-server queueing systems with relative priorities. In 2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014 (pp. 135-141). Article 7943404 (2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014). Institute of Electrical and Electronics Engineers Inc..

Oz, Binyamin ; Haviv, Moshe ; Puterman, Martin L. / Self and social optimization in multi-class multi-server queueing systems with relative priorities. 2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 135-141 (2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014).

@inproceedings{40f47801aab9494bb8c112c5e186fc60,

title = "Self and social optimization in multi-class multi-server queueing systems with relative priorities",

abstract = "In this paper we show how the use of relative priorities can reduce queueing costs in queueing systems that are multi-server and multi-class as long as customers choose their routing policy strategically. This is demonstrated in two basic models with multi-class Poisson arrivals and parallel memoryless servers with linear cost functions of class expected mean waiting times. For each model we investigate the Nash equilibria under a given relative priority rule. Next, we characterize the central planner's optimal policy, which is shown to be of strictly relative priorities in some cases.",

author = "Binyamin Oz and Moshe Haviv and Puterman, {Martin L.}",

note = "Publisher Copyright: {\textcopyright} 2014 University of Trento.; 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014 ; Conference date: 29-10-2014 Through 31-10-2014",

year = "2014",

month = jul,

day = "2",

language = "אנגלית",

series = "2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "135--141",

booktitle = "2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014",

address = "ארצות הברית",

}

Oz, B, Haviv, M & Puterman, ML 2014, Self and social optimization in multi-class multi-server queueing systems with relative priorities. in 2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014., 7943404, 2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014, Institute of Electrical and Electronics Engineers Inc., pp. 135-141, 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014, Trento, Italy, 29/10/14.

Self and social optimization in multi-class multi-server queueing systems with relative priorities. / Oz, Binyamin; Haviv, Moshe; Puterman, Martin L.
2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 135-141 7943404 (2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Self and social optimization in multi-class multi-server queueing systems with relative priorities

AU - Oz, Binyamin

AU - Haviv, Moshe

AU - Puterman, Martin L.

PY - 2014/7/2

Y1 - 2014/7/2

N2 - In this paper we show how the use of relative priorities can reduce queueing costs in queueing systems that are multi-server and multi-class as long as customers choose their routing policy strategically. This is demonstrated in two basic models with multi-class Poisson arrivals and parallel memoryless servers with linear cost functions of class expected mean waiting times. For each model we investigate the Nash equilibria under a given relative priority rule. Next, we characterize the central planner's optimal policy, which is shown to be of strictly relative priorities in some cases.

AB - In this paper we show how the use of relative priorities can reduce queueing costs in queueing systems that are multi-server and multi-class as long as customers choose their routing policy strategically. This is demonstrated in two basic models with multi-class Poisson arrivals and parallel memoryless servers with linear cost functions of class expected mean waiting times. For each model we investigate the Nash equilibria under a given relative priority rule. Next, we characterize the central planner's optimal policy, which is shown to be of strictly relative priorities in some cases.

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85022195214

T3 - 2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014

SP - 135

EP - 141

BT - 2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014

Y2 - 29 October 2014 through 31 October 2014

ER -

Oz B, Haviv M, Puterman ML. Self and social optimization in multi-class multi-server queueing systems with relative priorities. In 2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 135-141. 7943404. (2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014).

Self and social optimization in multi-class multi-server queueing systems with relative priorities

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this