19,380 research outputs found
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium
We present a direct reduction from k-player games to 2-player games that
preserves approximate Nash equilibrium. Previously, the computational
equivalence of computing approximate Nash equilibrium in k-player and 2-player
games was established via an indirect reduction. This included a sequence of
works defining the complexity class PPAD, identifying complete problems for
this class, showing that computing approximate Nash equilibrium for k-player
games is in PPAD, and reducing a PPAD-complete problem to computing approximate
Nash equilibrium for 2-player games. Our direct reduction makes no use of the
concept of PPAD, thus eliminating some of the difficulties involved in
following the known indirect reduction.Comment: 21 page
From winning strategy to Nash equilibrium
Game theory is usually considered applied mathematics, but a few
game-theoretic results, such as Borel determinacy, were developed by
mathematicians for mathematics in a broad sense. These results usually state
determinacy, i.e. the existence of a winning strategy in games that involve two
players and two outcomes saying who wins. In a multi-outcome setting, the
notion of winning strategy is irrelevant yet usually replaced faithfully with
the notion of (pure) Nash equilibrium. This article shows that every
determinacy result over an arbitrary game structure, e.g. a tree, is
transferable into existence of multi-outcome (pure) Nash equilibrium over the
same game structure. The equilibrium-transfer theorem requires cardinal or
order-theoretic conditions on the strategy sets and the preferences,
respectively, whereas counter-examples show that every requirement is relevant,
albeit possibly improvable. When the outcomes are finitely many, the proof
provides an algorithm computing a Nash equilibrium without significant
complexity loss compared to the two-outcome case. As examples of application,
this article generalises Borel determinacy, positional determinacy of parity
games, and finite-memory determinacy of Muller games
- …