Related papers: A tutorial for computer scientists on finite exten…
Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the…
Ladder tournaments are widely used to rank individuals in real-world organizations and games. Their mathematical properties however are still poorly understood. We formalize the ranking rule generated by a ladder tournament, and we show…
We study a pursuit-evasion differential game with finite number of pursuers and one evader in Hilbert space with geometric constraints on the control functions of players. We solve the game by presenting explicit strategies for pursuers…
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a win. We explore and compare several criteria for establishing…
This essay gives a self-contained introduction to quantum game theory, and is primarily oriented to economists with little or no acquaintance with quantum mechanics. It assumes little more than a basic knowledge of vector algebra. Quantum…
In this paper, we consider finite-strategy approximations of infinite-strategy evolutionary games. We prove that such approximations converge to the true dynamics over finite-time intervals, under mild regularity conditions which are…
We introduce and investigate a range of general notions of a game. Our principal notion is based on a set of agents modifying a relational structure in a discrete evolution sequence. We also introduce and study a variety of ways to model…
We present a functional framework for automated mechanism design based on a two-stage game model of strategic interaction between the designer and the mechanism participants, and apply it to several classes of two-player infinite games of…
In this thesis, we survey techniques and results from the study of Complexity Theory and Games. We then apply these techniques to obtain new results for previously unstudied games. Our contributions in the games Hexiom, Cut the Rope, and…
There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…
Poset games have been the object of mathematical study for over a century, but little has been written on the computational complexity of determining important properties of these games. In this introduction we develop the fundamentals of…
The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…
We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…
We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…
The sequential equilibrium is a standard solution concept for extensive-form games with imperfect information that includes an explicit representation of the players' beliefs. An assessment consisting of a strategy and a belief is a…
We show that the problem of deciding whether in a multi-player perfect information recursive game (i.e. a stochastic game with terminal rewards) there exists a stationary Nash equilibrium ensuring each player a certain payoff is Existential…
We consider two-player games with imperfect information and the synthesis of a randomized strategy for one player that ensures the objective is satisfied almost-surely (i.e., with probability 1), regardless of the strategy of the other…
We introduce the game of infinite Hex, extending the familiar finite game to natural play on the infinite hexagonal lattice. Whereas the finite game is a win for the first player, we prove in contrast that infinite Hex is a draw -- both…
We consider two-player random extensive form games where the payoffs at the leaves are independently drawn uniformly at random from a given feasible set C. We study the asymptotic distribution of the subgame perfect equilibrium outcome for…
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…