Positional strategies for mean payoff games

We present one way of definingn-person perfect information games so that there is a reasonable outcome for every game. In particular, the theory of Nim and Moore's games is generalized ton-person games.

Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the ...

A loopy partizan graph game is a two-person game of perfect information which is played on a labelled digraph. The disjunctive sum, the continued conjunctive sum, and the selective sum are formulations for playing several l.p.g.g.'s simultaneously,...