Stationary multi-choice bandit problems. (Q5958100): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Denumerable-Armed Bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching Costs and the Gittins Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of the multiarmed bandit problem: The discounted case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search for the Best Alternative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221798 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:19, 3 June 2024

scientific article; zbMATH DE number 1715066
Language Label Description Also known as
English
Stationary multi-choice bandit problems.
scientific article; zbMATH DE number 1715066

    Statements

    Stationary multi-choice bandit problems. (English)
    0 references
    0 references
    0 references
    3 March 2002
    0 references
    This note shows that the optimal choice of \(k\) simultaneous experiments in a stationary multi-armed bandit problem can be characterized in terms of the Gittins index of each arm. The index characterization remains equally valid after the introduction of switching costs.
    0 references

    Identifiers