An optimal stopping zero-sum game in discrete-time multi-armed bandit processes (Q4256753): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Markov strategies for optimal control problems indexed by a partially ordered set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discrete multiarmed bandits and multiparameter processes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal stopping and supermartingales over partially ordered sets / rank | |||
Normal rank | |||
Latest revision as of 21:23, 28 May 2024
scientific article; zbMATH DE number 1319645
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal stopping zero-sum game in discrete-time multi-armed bandit processes |
scientific article; zbMATH DE number 1319645 |
Statements
An optimal stopping zero-sum game in discrete-time multi-armed bandit processes (English)
0 references
2 August 1999
0 references
bandit games
0 references
zero-sum games
0 references
multi-armed bandit processes
0 references
Markov strategies
0 references
Markov stopping times
0 references
optimal Markov strategies
0 references
optimal stopping times
0 references
Bellman's equation
0 references
