Discounting versus averaging in dynamic programming

DOI10.1006/game.1994.1005zbMath0792.90086OpenAlexW2025513015MaRDI QIDQ1317338

Ehud Lehrer, Dov Monderer

Publication date: 24 March 1994

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/game.1994.1005

zbMATH Keywords

limit of the discounted valueslong-run average values

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (8)

Recursive games: uniform value, Tauberian theorem and the Mertens conjecture ``\(\mathrm{Maxmin}=\lim v_n=\lim v_\lambda\) ⋮ LP based upper and lower bounds for Cesàro and Abel limits of the optimal values in problems of control of stochastic discrete time systems ⋮ Value‐based distance between information structures ⋮ A survey of average cost problems in deterministic discrete-time control systems ⋮ General limit value in dynamic programming ⋮ Zero-sum repeated games: recent advances and new links with differential games ⋮ Asymptotic properties in dynamic programming ⋮ Bounded variation of \(\{V_ n\}\) and its limit

This page was built for publication: Discounting versus averaging in dynamic programming