Document Open Access Logo

Marginal productivity index policies for scheduling restless bandits with switching penalties

Author José Niño-Mora

PDF

File

Thumbnail PDF
PDF
DagSemProc.05031.13.pdf
  • Filesize: 181 kB
  • 6 pages

Document Identifiers

Subject Classification

Keywords
  • stochastic scheduling
  • restless bandits
  • index policies
  • switching penalties

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We address the problem of designing a tractable, well-grounded policy for the dynamic allocation of effort to a collection of restless bandit projects, i.e. binary-action (active/passive) Markov decision processes, in which sequence-independent switching penalties (costs or delays) are incurred when switching from one project to another. We deploy the framework of partial conservation laws, introduced by Ni�±o-Mora (2001, 2002), to establish the existence of and calculate a marginal productivity index (MPI), under certain conditions. The MPI, which extends earlier indices proposed by Gittins (1979) and Whittle (1988), yields a corresponding MPI policy, which prescribes to dynamically engage the project with larger index.

Cite As Get BibTex

José Niño-Mora. Marginal productivity index policies for scheduling restless bandits with switching penalties. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005) https://doi.org/10.4230/DagSemProc.05031.13

Author Details

José Niño-Mora
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact