TY - JOUR
T1 - Equilibrium strategies for processor sharing and random queues with relative priorities
AU - Haviv, Moshe
AU - Van Der Wal, Jan
PY - 1997
Y1 - 1997
N2 - We consider a memoryless single-server queue in which users can purchase relative priority so as to reduce their expected waiting costs, which are linear with time. Relative priority is given in proportion to a price paid by customers present in the system. For two service disciplines, (weighted) processor sharing and (weighted) random entrance, we find the unique pure and symmetric Nash equilibrium price paid by the customers.
AB - We consider a memoryless single-server queue in which users can purchase relative priority so as to reduce their expected waiting costs, which are linear with time. Relative priority is given in proportion to a price paid by customers present in the system. For two service disciplines, (weighted) processor sharing and (weighted) random entrance, we find the unique pure and symmetric Nash equilibrium price paid by the customers.
UR - http://www.scopus.com/inward/record.url?scp=0031489240&partnerID=8YFLogxK
U2 - 10.1017/s0269964800004940
DO - 10.1017/s0269964800004940
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0031489240
SN - 0269-9648
VL - 11
SP - 403
EP - 412
JO - Probability in the Engineering and Informational Sciences
JF - Probability in the Engineering and Informational Sciences
IS - 4
ER -