We develop value iteration-based algorithms to solve in a unified manner different classes of
combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on an …

Strategy iteration is a technique frequently used for two-player games in order to determine
the winner or compute payoffs, but to the best of our knowledge no general framework for …

Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a
complete lattice as the largest postfixpoint, naturally leads to the so-called coinduction proof …

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 …

Stochastic Games are used for modeling decision-making processes in environments
characterized by uncertainty and adversarial interactions. They are particularly relevant for …

This thesis presents the findings of a computational study on algorithms for Simple
Stochastic Games (SSG). Simple Stochastic Games are a restriction of the Shapley …

We present two recursive strategy improvement algorithms for solving simple stochastic
games. First we present an algorithm for solving SSGs of degree $ d $ that uses at most …

Lattice theory is a well studied area of mathematics and finds many applications, for
example in system verification. By Knaster-Tarksi, any monotone function f∶ L→ L on a …

In two player games seen so far, players had objectives that are opposite to each other's, so
we were able to define them giving only Eve's objective. Adam was seen as a purely …

Stochastic Games are used for modeling decision-making processes in environments
characterized by uncertainty and adversar-ial interactions. They are particularly relevant for …