Related papers: Simplified three player Kuhn poker
We investigate the problem of equilibrium computation for "large" $n$-player games. Large games have a Lipschitz-type property that no single player's utility is greatly affected by any other individual player's actions. In this paper, we…
We study the following game. Three players start with initial capitals of $s_{1},s_{2},s_{3}$ dollars; in each round player $P_{m}$ is selected with probability $\frac{1}{3}$; then \emph{he} selects player $P_{n}$ and they play a game in…
The study of evolutionary games with pairwise local interactions has been of interest to many different disciplines. Also local interactions with multiple opponents had been considered, although always for a fixed amount of players. In many…
We investigate the complexity of computing approximate Nash equilibria in anonymous games. Our main algorithmic result is the following: For any $n$-player anonymous game with a bounded number of strategies and any constant $\delta>0$, an…
We study the problem of computing approximate Nash equilibria (epsilon-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It…
An heuristic approach to compute strong Nash (Aumann) equilibria is presented. The method is based on differential evolution and three variants of a generative relation for strong Nash equilibria characterization. Numerical experiments…
Animal behavior and evolution can often be described by game-theoretic models. Although in many situations, the number of players is very large, their strategic interactions are usually decomposed into a sum of two-player games. Only…
Solving feedback Stackelberg games with nonlinear dynamics and coupled constraints, a common scenario in practice, presents significant challenges. This work introduces an efficient method for computing approximate local feedback…
In the standard approach to quantum games, players' moves are local unitary transformations on an entangled state that is subsequently measured. Players' payoffs are then obtained as expected values of the entries in the payoff matrix of…
Poker is a large complex game of imperfect information, which has been singled out as a major AI challenge problem. Recently there has been a series of breakthroughs culminating in agents that have successfully defeated the strongest human…
We study the dynamics and resulting score distribution of three-agent games where after each competition a single agent wins and scores a point. A single competition is described by a triplet of numbers $p$, $t$ and $q$ denoting the…
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…
We study optimal equilibria in multi-player games. An equilibrium is optimal for a player, if her payoff is maximal. A tempting approach to solving this problem is to seek optimal Nash equilibria, the standard form of equilibria where no…
We introduce and study incentive equilibria for multi-player meanpayoff games. Incentive equilibria generalise well-studied solution concepts such as Nash equilibria and leader equilibria (also known as Stackelberg equilibria). Recall that…
Poker is one of the most popular card games, whose rational investigation represents also one of the major challenges in several scientific areas, spanning from information theory and artificial intelligence to game theory and statistical…
We present a simple primal-dual algorithm for computing approximate Nash-equilibria in two-person zero-sum sequential games with incomplete information and perfect recall (like Texas Hold'em Poker). Our algorithm is numerically stable,…
We give a new proof of the fact that the parallel repetition of the (3-player) GHZ game reduces the value of the game to zero polynomially quickly. That is, we show that the value of the $n$-fold GHZ game is at most $n^{-\Omega(1)}$. This…
A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single…
This paper extends our probabilistic framework for two-player quantum games to the mutliplayer case, while giving a unified perspective for both classical and quantum games. Considering joint probabilities in the standard…
Games of ordered preference (GOOPs) model multi-player equilibrium problems in which each player maintains a distinct hierarchy of strictly prioritized objectives. Existing approaches solve GOOPs by deriving and enforcing the necessary…