Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue

Published Online:https://doi.org/10.1287/opre.38.5.870

Consider a system that is modeled as an M/M/1 queueing system with multiple user classes. Each class is characterized by its delay cost per unit of time, its expected service time and its demand function. This paper derives a pricing mechanism which is optimal and incentive-compatible in the sense that the arrival rates and execution priorities jointly maximize the expected net value of the system while being determined, on a decentralized basis, by individual users. A closed-form expression for the resulting price structure is presented and studied.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.