• Corpus ID: 237485096

Optimal bounds for bit-sizes of stationary distributions in finite Markov chains

  title={Optimal bounds for bit-sizes of stationary distributions in finite Markov chains},
  author={Mateusz Skomra},
  • Mateusz Skomra
  • Published 10 September 2021
  • Computer Science, Mathematics
  • ArXiv
An irreducible stochastic matrix with rational entries has a stationary distribution given by a vector of rational numbers. We give an upper bound on the lowest common denominator of the entries of this vector. Bounds of this kind are used to study the complexity of algorithms for solving stochastic mean payoff games. They are usually derived using the Hadamard inequality, but this leads to suboptimal results. We replace the Hadamard inequality with the Markov chain tree formula in order to… 

Figures from this paper


On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
Abstract It is shown that the discount factor needed to solve an undiscounted mean payoff stochastic game to optimality is exponentially close to 1, even in one-player games with a single random node
The Complexity of Mean Payoff Games on Graphs
A pseudo-polynomial-time algorithm for the solution of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan, is described.
A Graph Theoretic Formula for the Steady State Distribution of Finite Markov Processes
This paper presents a formula which expresses the solution to the steady-state equations of a finite irreducible Markov process in terms of subgraphs of the transition diagram of the process. The
The Complexity of Solving Stochastic Games on Graphs
A linear time algorithm is exhibited that given a simple stochastic game and the values of all positions of that game, computes a pair of optimal strategies.
Ergodicity conditions for zero-sum games
A basic question for zero-sum repeated games consists in determining whether the mean payoff per time unit is independent of the initial state. In the special case of "zero-player" games, i.e., of
Simulated annealing algorithms and Markov chains with rare transitions
In these notes, written for a D.E.A. course at University Paris XI during the first term of 1995, we prove the essentials about stochastic optimisation algorithms based on Markov chains with rare
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions
It is shown that BWR-games with a constant number of random nodes can be solved in pseudo-polynomial time, that is, for any such game with a few random nodes |VR|=O(1), a saddle point in pure stationary strategies can be found in time polynomial in |VW|+|VB|.
Tree formulas, mean first passage times and Kemeny’s constant of a Markov chain
In this paper, we aim to provide probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. These tree
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
This work gives some fixed-parameter tractable or polynomial algorithms in terms of different parameters such as the number of cycles or the size of the minimal feedback vertex set for turned-based stochastic games with reachability objectives.
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems
  • N. Halman
  • Mathematics, Computer Science
  • 2007
It is shown that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem, and the first strongly subexponential solution for SSGs is obtained (a stronglySubexponential algorithm has only been known for binary SSGs [L]).