We define a new class of games, called backtracking games. Backtracking games are essentially parity games with an additional rule allowing players, under certain conditions, to return to an earlier position in the play and revise a choice. This new feature makes backtracking games more powerful than parity games. As a consequence, winning strategies become more complex objects and computationa...

We discuss related aspects of the simplest possible games, i.e. games where two players have two pure strategies each, and consider static games, population games, a generalization of evolutionary games, and dynamic games.

We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. Second we formally introduce and define the CP-games formalism. Then we sketch two ‘real-life’ applications, namely a connection between CP games and gene regulation networks, and the use of CP games to formalize impl...

One of the recurring themes in the theory of stochastic games is the interplay between discounted games and mean-payoff games. This culminates in the seminal paper of Mertens and Neyman [12] showing that mean-payoff games have a value and this value is the limit of the values of discounted games when the discount factor tends to 1. Note however that optimal strategies in both games are very dif...