Related papers: Games with recurring certainty
We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, B\"uchi and co-B\"uchi objectives, and investigate the existence of…
In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by…
Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…
We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability…
We study a generalisation of B\"uchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton with epsilon transitions and only Player I can elapse time. We show that for fixed number…
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…
Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games is undecidable in general, we…
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…
Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…
We compare games under delayed control and delay games, two types of infinite games modelling asynchronicity in reactive synthesis. In games under delayed control both players suffer from partial informedness due to symmetrically delayed…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…
n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…
This paper examines games with strategic complements or substitutes and incomplete information, where players are uncertain about the opponents' parameters. We assume that the players' beliefs about the opponent's parameters are selected…
We consider two-player games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequency-related properties: (i) all colors occur with the same asymptotic frequency, (ii) there…
In this paper, we present a conceptual model game to examine the dynamics of asymmetric interactions in games with imperfect information. The game involves two agents with starkly contrasting capabilities: one agent can take actions but has…
There is a common belief that humans and many animals follow transitive inference (choosing A over C on the basis of knowing that A is better than B and B is better than C). Transitivity seems to be the essence of rational choice. We…
In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…
Energy games are a well-studied class of 2-player turn-based games on a finite graph where transitions are labeled with integer vectors which represent changes in a multidimensional resource (the energy). One player tries to keep the…
We consider an n-player symmetric stochastic game with weak interaction between the players. Time is continuous and the horizon and the number of states are finite. We show that the value function of each of the players can be approximated…