Related papers: Quitting Games and Linear Complementarity Problems
This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…
There has been significant recent progress in algorithms for approximation of Nash equilibrium in large two-player zero-sum imperfect-information games and exact computation of Nash equilibrium in multiplayer strategic-form games. While…
A Linear Quadratic Deterministic Continuous Time Game with many symmetric players is considered and the Linear Feedback Nash strategies are studied as the number of players goes to infinity. We show that under some conditions the limit of…
It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic…
Playing a symmetric bi-matrix game is usually physically implemented by sharing pairs of 'objects' between two players. A new setting is proposed that explicitly shows effects of quantum correlations between the pairs on the structure of…
We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff games is NP-complete. While the SPE threshold problem was recently shown to be decidable (in doubly exponential time) and NP-hard, its exact worst…
In 1953, Kuhn showed that every sequential game has a Nash equilibrium by showing that a procedure, named ``backward induction'' in game theory, yields a Nash equilibrium. It actually yields Nash equilibria that define a proper subclass of…
We describe a new complete algorithm for computing Nash equilibrium in multiplayer general-sum games, based on a quadratically-constrained feasibility program formulation. We demonstrate that the algorithm runs significantly faster than the…
There are two well-known sufficient conditions for Nash equilibrium in two-player games: mutual knowledge of rationality (MKR) and mutual knowledge of conjectures. MKR assumes that the concept of rationality is mutually known. In contrast,…
It is known that the set of all correlated equilibria of an n-player non-cooperative game is a convex polytope and includes all the Nash equilibria. Further, the Nash equilibria all lie on the boundary of this polytope. We study the…
In this paper, we study a class of two-player deterministic finite-horizon difference games with coupled inequality constraints, where each player has two types of decision variables: one involving sequential interactions and the other…
This paper introduces a class of games, called unit-sphere games, where strategies are real vectors with unit 2-norms (or, on a unit-sphere). As a result, they can no longer be interpreted as probability distributions over actions, but…
We analyze a two-player, nonzero-sum Dynkin game of stopping with incomplete information. We assume that each player observes his own Brownian motion, which is not only independent of the other player's Brownian motion but also not…
We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need not exist when players are given arbitrary terminal-reward…
Given a bimatrix game, the associated leadership or commitment games are defined as the games at which one player, the leader, commits to a (possibly mixed) strategy and the other player, the follower, chooses his strategy after having…
On a filtered probability space $(\Omega ,\mathcal{F}, (\mathcal{F}_t)_{t\in[0,\infty]}, \mathbb{P})$, we consider the two-player non-zero-sum stopping game $u^i := \mathbb{E}[U^i(\rho,\tau)],\ i=1,2$, where the first player choose a…
In this note, we study a class of deterministic finite-horizon linear-quadratic difference games with coupled affine inequality constraints involving both state and control variables. We show that the necessary conditions for the existence…
The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…
We prove that finding an $\epsilon$-approximate Nash equilibrium is PPAD-complete for constant $\epsilon$ and a particularly simple class of games: polymatrix, degree 3 graphical games, in which each player has only two actions. As…
The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the line, and each client buys from the closest server. In this…