Skip to main content
SpringerLink
Log in

Comments on: Dynamic priority allocation via restless bandit marginal productivity indices

  • Discussion
  • Published:
TOP Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Altman E (1994) Denumerable constrained Markov decision problems and finite approximations. Math Oper Res 19(1):169–191

    Article  Google Scholar 

  • Altman E, Koole G (1993) Stochastic scheduling games with Markov decision arrival processes. J Comput Math Appl 26(6):141–148, 3rd special issue on “Differential Games”

    Article  Google Scholar 

  • Altman E, Kushner H (2002) Control of polling in presence of vacations in heavy traffic with applications to satellite and mobile radio systems. SIAM J Control Optim 41(1):217–252

    Article  Google Scholar 

  • Altman E, Shwartz A (1989) Optimal priority assignment: a time sharing approach. IEEE Trans Autom Control 34:1098–1102

    Article  Google Scholar 

  • Altman E, Shwartz A (1991) Adaptive control of constrained Markov chains. IEEE Trans Autom Control 36(4):454–462

    Article  Google Scholar 

  • Altman E, Kofman D, Yechiali U (1995) Discrete time queues with delayed information. Queueing Syst 19:361–376

    Article  Google Scholar 

  • Altman E, Koole G, Jiménez T (2001) On optimal call admission control in a resource-sharing system. IEEE Trans Commun 49(9):1659–1668

    Article  Google Scholar 

  • Arizmendi CM (2007). Available in arxiv, “Paradoxical way for losers in a dating game”, manuscript. Available at http://aps.arxiv.org/PS_cache/physics/pdf/0703/0703189v1.pdf

  • Bergemann D, Vlimki J (2006) Bandit problems. Cowles foundation for research in economics, discussion paper No 1551, Yale University, January 2006. Available at http://cowles.econ.yale.edu/

  • Boxma OJ (1989) Workloads and waiting times in single-server systems with multiple customer classes. Queuing Syst 5:185–214

    Article  Google Scholar 

  • Boxma OJ, Levy H, Yechiali U (1992) Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Ann Oper Res 35(3):187–208

    Article  Google Scholar 

  • Cohen JW, Boxma OJ (eds) (1983) Boundary value problems in queueing system analysis (Mathematics studies). Elsevier, Amsterdam

    Google Scholar 

  • Das S, Kamenica E (2005) Two sided bandits and the dating market. In: Pack L (ed) Proceedings of the nineteenth international joint conference on artificial intelligence Edinburgh, Scotland, 30 July–5 August 2005, pp 947–952

  • Gans N (2002) Customer loyalty and supplier quality competition. Manag Sci 48(2):207–221

    Article  Google Scholar 

  • Hernandez-Lerma O, Hoyos-Reves LF (2001) A multiobjective control approach to priority queues. Math Methods Oper Res 53(2):265–277

    Article  Google Scholar 

  • Hordijk A, Koole G (1992) The μ c-rule is not optimal in the second node of the tandem queue: a counterexample. Adv Appl Probab 24:234–237

    Article  Google Scholar 

  • Hordijk A, Koole G (1993) On the optimality of LEPT and μ c rule for parallel processors and dependent arrival processes. Adv Appl Probab 25:970–976

    Article  Google Scholar 

  • Liu Z, Nain P, Towsley D (1995) On optimal polling policies. Queueing Syst 21:293–336

    Article  Google Scholar 

  • Nain P, Ross KW (1989) Optimal priority assignment with hard constraint. IEEE Trans Autom Control 31:883–888

    Article  Google Scholar 

  • Neuts MF (1981) Matrix-geometric solutions in stochastic models: an algorithmic approach. The John Hopkins University Press, Baltimore

    Google Scholar 

  • Niño-Mora J (2007) Dynamic priority allocation via restless bandit marginal productivity indices, in this volume

  • Takagi H (1988) Queuing analysis of polling models. ACM Comput Surv 20(1)

  • Tassiulas L, Ephremides A (1993) Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans Inform Theory 39:466–478

    Article  Google Scholar 

  • Walrand J (1988) An introduction to queueing networks. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Yechiali U (1991) Optimal dynamic control of polling systems. In: Cohen JW, Pack CD (eds) Queueing, performance and control in ATM. North-Holland, Amsterdam, pp 205–217

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, B.P. 93, 2004 Route des Lucioles, 06902, Sophia-Antipolis Cedex, France

    Eitan Altman

Authors
  1. Eitan Altman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eitan Altman.

Additional information

This comment refers to the invited paper available at: http://dx.doi.org/10.1007/s11750-007-0025-0.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altman, E. Comments on: Dynamic priority allocation via restless bandit marginal productivity indices. TOP 15, 202–207 (2007). https://doi.org/10.1007/s11750-007-0027-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-007-0027-y

Keywords

Search

Navigation