Zero-sum Games for Discrete-time Multi-armed Bandit Processes with a Generalized Discount
From MaRDI portal
The present paper deals with zero-sum games for multi-armed bandit processes with a generalized discount and solves them as control problems of multi-parameter Markov processes. This paper is to give the unique optimal value and the Markov strategies, which are constructed by Bellman's equation derived from a value iteration.
Recommendations
- An optimal stopping zero-sum game in discrete-time multi-armed bandit processes
- scientific article; zbMATH DE number 4211191
- Zero-sum Markov games with random state-actions-dependent discount factors: existence of optimal strategies
- scientific article; zbMATH DE number 3876959
- Asymptotically optimal strategies for adaptive zero-sum discounted Markov games
Cites work
- Discrete multiarmed bandits and multiparameter processes
- Evaluating strategies for generalized bandit problems
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- Markov strategies for optimal control problems indexed by a partially ordered set
- Optimal stopping and supermartingales over partially ordered sets
Cited in
(3)
This page was built for publication: Zero-sum Games for Discrete-time Multi-armed Bandit Processes with a Generalized Discount
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024144)