Related papers: Strategies in deterministic totally-ordered-time g…
In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling's bisimulation games. If…
Originating in evolutionary game theory, the class of "zero-determinant" strategies enables a player to unilaterally enforce linear payoff relationships in simple repeated games. An upshot of this kind of payoff constraint is that it can…
We study a two-player discounted zero-sum stochastic game model for dynamic operational planning in military campaigns. At each stage, the players manage multiple commanders who order military actions on objectives that have an open line of…
An agent, or a coalition of agents, faces an ethical dilemma between several statements if she is forced to make a conscious choice between which of these statements will be true. This paper proposes to capture ethical dilemmas as a…
Prior work has studied the computational complexity of computing optimal strategies to commit to in Stackelberg or leadership games, where a leader commits to a strategy which is observed by one or more followers. We extend this setting to…
Boolean games are a succinct representation of strategic games wherein a player seeks to satisfy a formula of propositional logic by selecting a truth assignment to a set of propositional variables under his control. The framework has…
In multi-agent settings, game theory is a natural framework for describing the strategic interactions of agents whose objectives depend upon one another's behavior. Trajectory games capture these complex effects by design. In competitive…
We propose a model for evolutionary game dynamics with three strategies $A$, $B$ and $C$ in the framework of Moran process in finite populations. The model can be described as a stochastic process which can be numerically computed from a…
We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the…
Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence…
We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary player, and two-player deterministic games by adding…
Evolutionary game theory is an abstract and simple, but very powerful way to model evolutionary dynamics. Even complex biological phenomena can sometimes be abstracted to simple two-player games. But often, the interaction between several…
Using the duality techniques introduced by De Meyer (1996a, 1996b), De Meyer and Marino (2005) provided optimal strategies for both players in finitely repeated games with incomplete information on two sides, in the independent case. In…
We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of $\varepsilon$-optimal (resp. optimal) strategies. These results depend on the size of…
Given a dynamic ordinal game, we deem a strategy sequentially rational if there exist a Bernoulli utility function and a conditional probability system with respect to which the strategy is a maximizer. We establish a complete class theorem…
We study two-player concurrent stochastic games on finite graphs, with B\"uchi and co-B\"uchi objectives. The goal of the first player is to maximize the probability of satisfying the given objective. Following Martin's determinacy theorem…
We consider multi-player stopping games in continuous time. Unlike Dynkin games, in our games the payoff of each player is revealed after all the players stop. Moreover, each player can adjust her own stopping strategy by observing other…
A formula is presented for designing zero-determinant(ZD) strategies of general finite games, which have $n$ players and players can have different numbers of strategies. To this end, using semi-tensor product (STP) of matrices, the profile…
We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.e., measurable set of infinite plays), such as reachability,…
Using semi-tensor product (STP) of matrices, the profile evolutionary equation (PEE) for repeated finite games is obtained. By virtue of PEE, the zero-determinant (ZD) strategies are developed for general finite games. A formula is then…