On the Nash equilibria for the FCFS queueing system with load-increasing service rate
We consider a service system (Qs) that operates according to the FCFS discipline, and in which the service rate is an increasing function of the queue length. Customers arrive sequentially to the system and decide whether or not to join, using decision rules based upon the queue length on arrival to (Qs) . Each customer is interested in selecting a rule that meets a certain optimality criterion with regards to their expected sojourn time in the system; as a consequence, the decision rules of other customers need to be taken into account. Within a particular class of decision rules for an associated infinite player game, the structure of the Nash equilibrium routing policies is characterized. We prove that within this class, there exist a finite number of Nash equilibria, and that at least one of these is non-randomized. Finally, we explore the extent to which the Nash equilibria are characteristic of customer joining behaviour under a learning rule based on system-wide data with the aid of simulation experiments.
|Date of creation:||Nov 2004|
|Contact details of provider:|| Postal: Malet Street, London WC1E 7HX, UK|
Phone: 44-20- 76316429
Fax: 44-20- 76316416
Web page: http://www.ems.bbk.ac.uk/
|Order Information:|| Email: |
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
When requesting a correction, please mention this item's handle: RePEc:bbk:bbkefp:0407. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.