Incentive Mechanisms for Priority Queuing Problems
AbstractWe consider the development of an incentive mechanism to induce users of a service facility to reveal the parameters the system administrator requires to determine the optimal sequence of service to queued users. We first consider using the taxation procedure recently suggested for public goods, and then develop a more efficient mechanism based on marginal delay costs. We prove that setting the priority price for service equal to the marginal delay cost imposed on others structures a situation such that a user maximizes his individual welfare revealing his true delay cost.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by The RAND Corporation in its journal Bell Journal of Economics.
Volume (Year): 9 (1978)
Issue (Month): 2 (Autumn)
Contact details of provider:
Web page: http://www.rje.org
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Conan Mukherjee, 2013. "Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines," International Journal of Game Theory, Springer, vol. 42(1), pages 131-163, February.
- Rene van den Brink & Youngsub Chun & Yuan Ju, 2014. "Auctioning and Selling Positions: A Non-cooperative Approach to Queuing Conflicts," Tinbergen Institute Discussion Papers 14-016/II, Tinbergen Institute.
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.