Price and service discrimination in queueing systems: incentive compatibility of Gcμ scheduling

Management Science

Volumn 46, Issue 9, 2000, Pages 1249-1267

  Van Mieghem, Jan A ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; BENCHMARKING; COSTS; MARKETING; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; QUALITY CONTROL; QUEUEING THEORY; SALES;

ASYMMETRIC INFORMATION; DELAY COSTS; DYNAMIC PRIORITY; INCENTIVE COMPATIBILITY; QUALITY OF SERVICE; QUEUEING SYSTEMS;

SCHEDULING;

EID: 0033680606     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.46.9.1249.12238     Document Type: Article

References (28)

1. Afèche, P., H. Mendelson. 2000. Market structure in congestible tandem networks. Technical report, North-western University, Evanston, IL.
2. Ayhan, H., T. L. Olsen. 2000. Scheduling of multi-class single-server queues under nontraditional performance measures. Oper. Res. 48(3) 482-489.
3. Bradford, R. M. 1996. Pricing, routing, and incentive-compatibility in multiserver queues. Eur. J. Oper. Res. 89 226-236.
4. Cachon, G. P., P. T. Harker. 1999. Service competition, outsourcing and co-production in a queuing game. Technical report, working paper, Duke University, Durham, NC.
5. Clarke, E. 1971. Multipart pricing of public goods. Public Choice 11 19-33.
6. Courcoubetis, C. 1998. Pricing and economics of networks. Tutorial presented at IEEE InfoCom Conference, San Francisco, CA. .
7. De Vany, A. S., T. R. Saving. 1983. The economics of quality. J. Political Econom. 91(6) 979-1000.
8. Dolan, R. J. 1978. Incentive mechanisms for priority queuing problems. Bell J. Econom. 9(2) 421-436.
9. Gibbens, R. J., F. P. Kelly. 1999. Resource pricing and the evolution of congestion control. Automatica 35 1969-1985.
10. Groves, T., M. Loeb. 1975. Incentives and public inputs. J. Public Econom. 4 211-226.
11. Ha, A. Y. 1998. Incentive-compatible pricing for a service facility with joint production and congestion externalities. Management Sci. 44(12) 1623-1636.
12. _. 1999. Optimal incentive-compatible pricing for processor sharing queues with customer-chosen service requirements. Technical report, Yale School of Management, New Haven, CT.
13. Knutsen, N. C. 1972. Individual and social optimization in a multi-server queue with a general cost-benefit structure. Econometrica 40 515-528.
14. Lederer, P. J., L. Li. 1997. Pricing, production, scheduling and delivery-time competition. Oper. Res. 45(3) 407-420.
15. Lippman, S. A., S. Stidham. 1977. Individual versus social optimization in exponential congestion systems. Oper. Res. 25 233-247.
16. Loch, C. H. 1991. Pricing in Markets Sensitive to Delay. Ph.D. thesis, Stanford University, Stanford, CA.
17. Lui, F. 1985. An equilibrium queuing model of bribery. J. Political Econom. 93 760-781.
18. Maglaras, C., J. A. Van Mieghem. 2000. Admission and sequencing control under delay constraints with applications to GPS and GLQ. Technical report, Northwestern University, Evanston, IL.
19. Masuda, Y., S. Whang. 1999. Dynamic pricing for network service: Equilibrium and stability. Management Sci. 45 857-869.
20. Mendelson, H. 1985. Pricing computer services: Queueing effects. Comm. ACM 28(3) 312-321.
21. _, S. Whang. 1990. Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. 38 870-883.
22. Naor, P. 1969. The regulation of queue size by levying tolls. Econometrica 37 15-24.
23. Rao, S., E. R. Petersen. 1998. Optimal pricing of priority services. Oper. Res. 46(1) 46-56.
24. Reiman, M. I. 1982. The heavy traffic diffusion approximation for sojourn times in jackson networks. R. Disney, T. Ott, eds., Applied Probability-Computer Science, The Interface (Volume II). Birkhauser, Boston, MA, 409-422.
25. Reitman, D. 1991. Endogeneous quality differentiation in congested markets. J. Indust. Econom. 39(6) 621-647.
26. Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: The generalized cμ. rule. Ann. Appl. Prob. 5(3) 809-833.
27. _. 2000a. Delay distributions under dynamic scheduling rules. Working paper, Northwestern University, Evanston, IL.
28. _. 2000b. Scheduling with delay constraints: A short proof of the optimality of generalized longest queue (GLQ). Technical report, Northwestern University, Evanston, IL.