Fetching the paper…
Reading the bibliography…
Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments.
Stochastic games
L. Shapley · 1953
Earlier work this paper cites.
A Markovian decision process
R. Bellman · 1957
Earlier work this paper cites.
Discrete dynamic programming
D. Blackwell · 1962
Earlier work this paper cites.
Probabilistic automata
M. Rabin · 1963
Earlier work this paper cites.
Introduction to probabilistic automata (Computer science and applied mathematics)
A. Paz · 1971
Earlier work this paper cites.
Probabilistic automata
R. G. Bukharaev · 1980
Earlier work this paper cites.
Discrete-time controlled Markov processes with average cost criterion: a survey
A. Arapostathis, V. Borkar, E. Fernández-Gaucherand, M. Ghosh, and S. Marcus · 1993
Earlier work this paper cites.
On measurability and representation of strategic measures in markov decision processes
E. Feinberg · 1996
Earlier work this paper cites.
Reinforcement learning: A survey
L. P. Kaelbling, M. L. Littman, and A. W. Moore · 1996
Earlier work this paper cites.
Competitive Markov Decision Processes
J. Filar and K. Vrieze · 1997
Cited alongside, same era.
Biological sequence analysis: probabilistic models of proteins and nucleic acids
R. Durbin, S. Eddy, A. Krogh, and G. Mitchison · 1998
Cited alongside, same era.
Average cost dynamic programming equations for controlled Markov chains with partial observations
V. Borkar · 2000
Cited alongside, same era.
Blackwell optimality in markov decision processes with partial observation
D. Rosenberg, E. Solan, and N. Vieille · 2002
Cited alongside, same era.
Markov Chains and Invariant Probabilities
O. Hernandez-Lerma and J.-B. Lasserre · 2003
Cited alongside, same era.
On the undecidability of probabilistic planning and related stochastic optimization problems
O. Madani, S. Hanks, and A. Condon · 2003
Repeated games with public uncertain duration process
A. Neyman and S. Sorin · 2010
Later among the works it cites.
Computing uniformly optimal strategies in two-player stochastic games
E. Solan and N. Vieille · 2010
Later among the works it cites.
Quantitative synthesis for concurrent programs
P. Cerný, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh · 2011
Later among the works it cites.
Uniform value in dynamic programming
J. Renault · 2011
Later among the works it cites.
Probabilistic omega-automata
C. Baier, M. Größer, and N. Bertrand · 2012
Later among the works it cites.
Long-term values in markov decision processes and repeated games, and a new distance for probability spaces
J. Renault and X. Venel · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Continuity of the value of competitive markov decision processes
E. Solan · 2003
Cited alongside, same era.
Concurrent games with tail objectives
K. Chatterjee · 2007
Cited alongside, same era.
Solving POMDPs: RTDP-Bel vs. point-based algorithms
B. Bonet and H. Geffner · 2009
Cited alongside, same era.
Absorbing games with a clock and two bits of memory
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman
Cited in the paper.
The big match with a clock and a bit of memory
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman
Cited in the paper.
Strong uniform value in gambling houses and partially observable markov decision processes
X. Venel and B. Ziliotto · 2016
Later among the works it cites.
History-dependent evaluations in pomdps
X. Venel and B. Ziliotto · 2020
Closest in time.