Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • A forwards induction approach to candidate drug selection

  • Part of
  • S. Qu, J. C. Gittins
  • Journal:
    Advances in Applied Probability / Volume 43 / Issue 3 / September 2011
    Published online by Cambridge University Press:
    01 July 2016, pp. 649-665
    Print publication:
    September 2011
    • Article
      • You have access
    • PDF
    • Export citation

  • A forwards induction policy is a type of greedy algorithm for Markov decision processes. It is straightforward to implement and is optimal for a large class of models, especially in stochastic resource allocation. In this paper we consider a model for the optimal allocation of resources in pre-clinical pharmaceutical research. We show that although they are not always strictly optimal, forwards induction policies perform well.

  • Strategy evaluation for stochastic scheduling problems with order constraints

  • K. D. Glazebrook
  • Journal:
    Advances in Applied Probability / Volume 23 / Issue 1 / March 1991
    Published online by Cambridge University Press:
    01 July 2016, pp. 86-104
    Print publication:
    March 1991

  • A single machine is available to process a collection J of jobs. The machine is free to switch between jobs at any time, but processing must respect a set Γof precedence constraints. Jobs evolve stochastically and earn rewards as they are processed, not otherwise. The theoretical framework of forwards induction/Gittins indexation is used to develop approaches to strategy evaluation for quite general (J,Γ). The performance of both forwards induction strategies and a class of quasi-myopic heuristics is assessed.