Pages that link to "Item:Q2892371"
From MaRDI portal
The following pages link to A \((2/3)n^{3}\) fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain (Q2892371):
Displaying 15 items.
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges (Q254442) (← links)
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
- Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
- The multi-armed bandit, with constraints (Q378726) (← links)
- Dynamic priority allocation via restless bandit marginal productivity indices (Q926578) (← links)
- A generalized Gittins index for a Markov chain and its recursive calculation (Q945795) (← links)
- Linear programming relaxations and marginal productivity index policies for the buffer sharing problem (Q1007148) (← links)
- Computing a classic index for finite-horizon bandits (Q2899118) (← links)
- A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index (Q3748086) (← links)
- (Q4633046) (← links)
- Optimistic Gittins Indices (Q5060515) (← links)
- Testing indexability and computing Whittle and Gittins index in subcubic time (Q6107877) (← links)
- A general approximation method for optimal stopping and random delay (Q6178390) (← links)
- A confirmation of a conjecture on Feldman’s two-armed bandit problem (Q6198964) (← links)
- A $(2/3)n^3$ fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain (Q6432053) (← links)
