Skip to content
Preprint

Threshold Structure of Optimal Policies in Restart POMDPs

Aug 2026 · 0 citations · 27 references
Mathematics Computer Science

TL;DR

Under a natural one-step cost deterioration condition, it is proved that optimal policies have a threshold structure in the elapsed time for both the discounted and total undiscounted cost criteria.

Abstract

We study a Restart POMDP (Partially Observable Markov Decision Process) on a general Borel state space, where the controller either lets the hidden state evolve unobserved or restarts the system and observes the new state. Exploiting a sufficient-statistic representation consisting of the last observed state and the elapsed time since restart, we reduce the problem to a fully observed MDP. Under a natural one-step cost deterioration condition, we prove that optimal policies have a threshold structure in the elapsed time for both the discounted and total undiscounted cost criteria. When the state space is partially ordered and the kernel is stochastically monotone, we further show that the optimal threshold is nonincreasing in the state. For the average cost criterion, under additional assumptions of geometric ergodicity and domination of the transient gain, we establish analogous threshold results via the vanishing discount approach, after showing the uniform boundedness of the optimal thresholds and relative value functions.

View source

Similar papers

Preprint Sep 2026

Optimal Threshold Type Policies for Partially Observable Restless Bandits

We study a finite-state partially observable restless multi-armed bandit (PO-RMAB) motivated by resource-constrained wildlife monitoring. The underlying condition of each location evolves independently, while only a limited number of locations can be actively monitored at each decision epoch. Activation reveals the cur...

Anu Krishna, Rahul Meshram, K. Kaza · 0 citations
Preprint Aug 2026

Poisson Tangent Limits and Critical Policy Switching for Sampled Bellman Operators

Consider a discounted Markov decision process with continuous action space in which, at each state visit, the controller draws a random pool of $N$ candidate actions and selects among them. When the optimal action set has zero mass under the sampling distribution, the value of this random-candidate model converges to t...

Ming-Zhe Dai, Chengxi Zhang · 0 citations
Preprint Aug 2026

Recursive Filtering and Stochastic Control under Finite Partition-Based Observations

This work develops a filtering and optimal-control framework for partially observable stochastic systems in which each observation identifies a class of a finite measurable partition of the hidden state space, and proposes class-dependent finite-dimensional approximations capable of preserving both continuous component...

Saul Díaz-Infante Velasco, Yofre H. García, J. Minjárez‐Sosa · 0 citations
#machine learning Preprint Oct 2026

Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains

We consider stochastic games with independent controlled chains and unknown transition kernels, where players observe only their local states and realized payoffs. We develop a fully online, decentralized, and uncoordinated mirror-descent algorithm that operates in the dual space of occupancy measures for approximating...

S. Etesami · 0 citations
Preprint Aug 2026

Learning to Control Coupled-Dynamics Environments with Joint Markov Decision Processes

A nonparametric distributional Bellman optimality operator for JMDPs is defined, and it is proved that when the induced marginal MDP has a unique optimal policy, its iterates converge in Wasserstein distance to the optimal joint return law.

Ege C. Kaya, Aliasghar Pourghani, Mahsa Ghasemi et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.