On an algorithm for successive improvement of a strategy

DOI10.1090/TRANS2/134/14MaRDI QIDQ3761429zbMATH OpenOpenAlexFDO

Authors V. V. Baranov, N. S. Podtsykin

Publication date 1987

Published in American Mathematical Society Translations: Series 2 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/trans2/134/14

zbMATH Keywords

controllable Markov processexpected payofflinear programming problemstationary Markov strategies

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computer aspects of numerical algorithms (65Yxx) Optimal stochastic control (93E20)

Recommendations

• On strategy improvement algorithms for simple stochastic games
• On strategy improvement algorithms for simple stochastic games
• An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
• A Generalization of Self-Improving Algorithms
• A Generalization of Self-Improving Algorithms
• scientific article; zbMATH DE number 3219396
• A generic strategy improvement method for simple stochastic games
• ON AN ALGORITHM FOR CALCULATING OPTIMAL STRATEGIES ON AN INFINITE TIME INTERVAL
• Mathematical Foundations of Computer Science 2004
• A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

Cited in

(1)

• An Update Operator for Strategic Ability

This page was built for publication: On an algorithm for successive improvement of a strategy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3761429)