242 research outputs found
Games on graphs with a public signal monitoring
We study pure Nash equilibria in games on graphs with an imperfect monitoring
based on a public signal. In such games, deviations and players responsible for
those deviations can be hard to detect and track. We propose a generic
epistemic game abstraction, which conveniently allows to represent the
knowledge of the players about these deviations, and give a characterization of
Nash equilibria in terms of winning strategies in the abstraction. We then use
the abstraction to develop algorithms for some payoff functions.Comment: 28 page
Games with Delays. A Frankenstein Approach
We investigate infinite games on finite graphs where the information flow is
perturbed by nondeterministic signalling delays. It is known that such
perturbations make synthesis problems virtually unsolvable, in the general
case. On the classical model where signals are attached to states, tractable
cases are rare and difficult to identify.
Here, we propose a model where signals are detached from control states, and
we identify a subclass on which equilibrium outcomes can be preserved, even if
signals are delivered with a delay that is finitely bounded. To offset the
perturbation, our solution procedure combines responses from a collection of
virtual plays following an equilibrium strategy in the instant- signalling game
to synthesise, in a Frankenstein manner, an equivalent equilibrium strategy for
the delayed-signalling game
Fictitious Play Outperforms Counterfactual Regret Minimization
We compare the performance of two popular algorithms, fictitious play and
counterfactual regret minimization, in approximating Nash equilibrium in
multiplayer games. Despite recent success of counterfactual regret minimization
in multiplayer poker and conjectures of its superiority, we show that
fictitious play leads to improved Nash equilibrium approximation over a variety
of game classes and sizes.Comment: Fixed a bug in the 5-player CFR implementation from prior version and
reran the 5-player experiment
Evolutionary Multiplayer Games
Evolutionary game theory has become one of the most diverse and far reaching
theories in biology. Applications of this theory range from cell dynamics to
social evolution. However, many applications make it clear that inherent
non-linearities of natural systems need to be taken into account. One way of
introducing such non-linearities into evolutionary games is by the inclusion of
multiple players. An example is of social dilemmas, where group benefits could
e.g.\ increase less than linear with the number of cooperators. Such
multiplayer games can be introduced in all the fields where evolutionary game
theory is already well established. However, the inclusion of non-linearities
can help to advance the analysis of systems which are known to be complex, e.g.
in the case of non-Mendelian inheritance. We review the diachronic theory and
applications of multiplayer evolutionary games and present the current state of
the field. Our aim is a summary of the theoretical results from well-mixed
populations in infinite as well as finite populations. We also discuss examples
from three fields where the theory has been successfully applied, ecology,
social sciences and population genetics. In closing, we probe certain future
directions which can be explored using the complexity of multiplayer games
while preserving the promise of simplicity of evolutionary games.Comment: 14 pages, 2 figures, review pape
A Unified View of Large-scale Zero-sum Equilibrium Computation
The task of computing approximate Nash equilibria in large zero-sum
extensive-form games has received a tremendous amount of attention due mainly
to the Annual Computer Poker Competition. Immediately after its inception, two
competing and seemingly different approaches emerged---one an application of
no-regret online learning, the other a sophisticated gradient method applied to
a convex-concave saddle-point formulation. Since then, both approaches have
grown in relative isolation with advancements on one side not effecting the
other. In this paper, we rectify this by dissecting and, in a sense, unify the
two views.Comment: AAAI Workshop on Computer Poker and Imperfect Informatio
- …