Zero-sum Games for Discrete-time Multi-armed Bandit Processes with a Generalized Discount (Q4024144): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02522667.1992.10699109 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079206036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating strategies for generalized bandit problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692329 / rank
 
Normal rank
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 13:18, 17 May 2024

scientific article
Language Label Description Also known as
English
Zero-sum Games for Discrete-time Multi-armed Bandit Processes with a Generalized Discount
scientific article

    Statements

    Zero-sum Games for Discrete-time Multi-armed Bandit Processes with a Generalized Discount (English)
    0 references
    25 February 1993
    0 references
    Bellman's equation
    0 references
    multi-armed bandit processes
    0 references
    multi-parameter Markov processes
    0 references
    value iteration
    0 references
    0 references

    Identifiers