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.











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)