A note on infinite-armed Bernoulli bandit problems with generalized beta prior distributions (Q1767307): 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: Bandit problems with infinitely many arms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Policies without Memory for the Infinite-Armed Bernoulli Bandit under the Average-Reward Criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal strategies for bandit problems with beta prior distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized beta- and F-distributions in statistical modelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of the sequential design of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698635 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:44, 7 June 2024

scientific article
Language Label Description Also known as
English
A note on infinite-armed Bernoulli bandit problems with generalized beta prior distributions
scientific article

    Statements

    A note on infinite-armed Bernoulli bandit problems with generalized beta prior distributions (English)
    0 references
    0 references
    0 references
    8 March 2005
    0 references
    dynamic allocation of Bernoulli processes
    0 references
    \(k\)-failure strategy
    0 references
    \(m\)-run strategy
    0 references
    \(N\)-learning strategy
    0 references
    non-recalling \(m\)-run strategy
    0 references
    sequential experimentation
    0 references

    Identifiers