Journal article · 2026 · Open access
Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
Operations Research · Published 11 November 2026 · DOI 10.1287/opre.2025.2498
In brief
“Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain” is a 2026 journal article by Shengbo Wang and Nian Si, published in Operations Research. OpenAlex counts 7 citations as of 18 November 2026, which puts it in the top 8% of works published in 2026 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 7
- Most cited in
- 2026 (5)
- Field-weighted impact
- 6.45
- References
- 37
- Authors
- 2
Abstract
Learning and optimal control under robust Markov decision processes (MDPs) have received increasing attention, yet most existing theory, algorithms, and applications focus on finite-horizon or discounted models. Long-run average-reward formulations, while natural in many operations research and management contexts, remain underexplored. This is primarily because the dynamic programming foundations are technically challenging and only partially understood, with several fundamental questions remaining open. This paper steps toward a general framework for average-reward robust MDPs by analyzing the constant-gain setting. We study the average-reward robust control problem with possible information asymmetries between the controller and an S-rectangular adversary. Our analysis centers on the constant-gain robust Bellman equation, examining both the existence of solutions and their relationship to the optimal average reward. Specifically, we identify when solutions to the robust Bellman equation characterize the optimal average reward and stationary policies, and we provide one-sided weak communication conditions ensuring solutions' existence. These findings expand the dynamic programming theory for average-reward robust MDPs and lay a foundation for robust dynamic decision making under long-run average criteria in operational environments.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Wang, S., & Si, N. (2026). Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain. Operations Research. https://doi.org/10.1287/opre.2025.2498
MLA 9
Wang, Shengbo, and Nian Si. “Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain.” Operations Research, 2026. https://doi.org/10.1287/opre.2025.2498.
Chicago
Wang, Shengbo and Nian Si. 2026. “Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain.” Operations Research. https://doi.org/10.1287/opre.2025.2498.
Harvard
Wang, S. and Si, N. (2026) ‘Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain’, Operations Research. doi:10.1287/opre.2025.2498.
IEEE
S. Wang and N. Si, “Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain,” Operations Research, 2026, doi: 10.1287/opre.2025.2498.
BibTeX
@article{wang2026bellman,
title = {{Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain}},
author = {Wang, Shengbo and Si, Nian},
journal = {Operations Research},
year = {2026},
doi = {10.1287/opre.2025.2498},
url = {https://doi.org/10.1287/opre.2025.2498}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Engineering › Control and Systems Engineering › Adaptive Dynamic Programming Control
- robust Markov decision processes
- stationary policies
- information asymmetry
- existence of solutions
- dynamic programming
- robust control
Work with this paper
Most-cited papers in Engineering
- A Closed‐form Equation for Predicting the Hydraulic Conductivity of Unsaturated SoilsMartinus Th. van Genuchten · Soil Science Society of America Journal · 1980 · 28,197 citations
- An improved technique for determining hardness and elastic modulus using load and displacement sensing indentation experimentsW. C. Oliver, George M. Pharr · Journal of materials research/Pratt's guide to venture capital sources · 1992 · 27,379 citations
- Digital communicationsOwen Bishop · Routledge eBooks · 2007 · 24,890 citations
- The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysisNorden Eh Huang, Zhengwei Shen, Steven R. Long and 6 more · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 1998 · 24,008 citations
- Numerical Heat Transfer and Fluid FlowSuhas V. Patankar · CRC Press eBooks · 2018 · 23,491 citations
Questions about this paper
How do I cite this paper in APA style?
Wang, S., & Si, N. (2026). Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain. Operations Research. https://doi.org/10.1287/opre.2025.2498
How many times has this paper been cited?
7 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Shengbo Wang, Nian Si.
What is the DOI of this paper?
10.1287/opre.2025.2498, permanently at https://doi.org/10.1287/opre.2025.2498. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.