60 research outputs found
Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games
We show that there is a polynomial-time approximation scheme for computing
Nash equilibria in anonymous games with any fixed number of strategies (a very
broad and important class of games), extending the two-strategy result of
Daskalakis and Papadimitriou 2007. The approximation guarantee follows from a
probabilistic result of more general interest: The distribution of the sum of n
independent unit vectors with values ranging over {e1, e2, ...,ek}, where ei is
the unit vector along dimension i of the k-dimensional Euclidean space, can be
approximated by the distribution of the sum of another set of independent unit
vectors whose probabilities of obtaining each value are multiples of 1/z for
some integer z, and so that the variational distance of the two distributions
is at most eps, where eps is bounded by an inverse polynomial in z and a
function of k, but with no dependence on n. Our probabilistic result specifies
the construction of a surprisingly sparse eps-cover -- under the total
variation distance -- of the set of distributions of sums of independent unit
vectors, which is of interest on its own right.Comment: In the 49th Annual IEEE Symposium on Foundations of Computer Science,
FOCS 200
A Size-Free CLT for Poisson Multinomials and its Applications
An -Poisson Multinomial Distribution (PMD) is the distribution of the
sum of independent random vectors supported on the set of standard basis vectors in . We show
that any -PMD is -close in total
variation distance to the (appropriately discretized) multi-dimensional
Gaussian with the same first two moments, removing the dependence on from
the Central Limit Theorem of Valiant and Valiant. Interestingly, our CLT is
obtained by bootstrapping the Valiant-Valiant CLT itself through the structural
characterization of PMDs shown in recent work by Daskalakis, Kamath, and
Tzamos. In turn, our stronger CLT can be leveraged to obtain an efficient PTAS
for approximate Nash equilibria in anonymous games, significantly improving the
state of the art, and matching qualitatively the running time dependence on
and of the best known algorithm for two-strategy anonymous
games. Our new CLT also enables the construction of covers for the set of
-PMDs, which are proper and whose size is shown to be essentially
optimal. Our cover construction combines our CLT with the Shapley-Folkman
theorem and recent sparsification results for Laplacian matrices by Batson,
Spielman, and Srivastava. Our cover size lower bound is based on an algebraic
geometric construction. Finally, leveraging the structural properties of the
Fourier spectrum of PMDs we show that these distributions can be learned from
samples in -time, removing
the quasi-polynomial dependence of the running time on from the
algorithm of Daskalakis, Kamath, and Tzamos.Comment: To appear in STOC 201
On the Structure, Covering, and Learning of Poisson Multinomial Distributions
An -Poisson Multinomial Distribution (PMD) is the distribution of the
sum of independent random vectors supported on the set of standard basis vectors in . We prove
a structural characterization of these distributions, showing that, for all
, any -Poisson multinomial random vector is
-close, in total variation distance, to the sum of a discretized
multidimensional Gaussian and an independent -Poisson multinomial random vector. Our structural characterization extends
the multi-dimensional CLT of Valiant and Valiant, by simultaneously applying to
all approximation requirements . In particular, it overcomes
factors depending on and, importantly, the minimum eigenvalue of the
PMD's covariance matrix from the distance to a multidimensional Gaussian random
variable.
We use our structural characterization to obtain an -cover, in
total variation distance, of the set of all -PMDs, significantly
improving the cover size of Daskalakis and Papadimitriou, and obtaining the
same qualitative dependence of the cover size on and as the
cover of Daskalakis and Papadimitriou. We further exploit this structure
to show that -PMDs can be learned to within in total
variation distance from samples, which is
near-optimal in terms of dependence on and independent of . In
particular, our result generalizes the single-dimensional result of Daskalakis,
Diakonikolas, and Servedio for Poisson Binomials to arbitrary dimension.Comment: 49 pages, extended abstract appeared in FOCS 201
Privacy and Truthful Equilibrium Selection for Aggregative Games
We study a very general class of games --- multi-dimensional aggregative
games --- which in particular generalize both anonymous games and weighted
congestion games. For any such game that is also large, we solve the
equilibrium selection problem in a strong sense. In particular, we give an
efficient weak mediator: a mechanism which has only the power to listen to
reported types and provide non-binding suggested actions, such that (a) it is
an asymptotic Nash equilibrium for every player to truthfully report their type
to the mediator, and then follow its suggested action; and (b) that when
players do so, they end up coordinating on a particular asymptotic pure
strategy Nash equilibrium of the induced complete information game. In fact,
truthful reporting is an ex-post Nash equilibrium of the mediated game, so our
solution applies even in settings of incomplete information, and even when
player types are arbitrary or worst-case (i.e. not drawn from a common prior).
We achieve this by giving an efficient differentially private algorithm for
computing a Nash equilibrium in such games. The rates of convergence to
equilibrium in all of our results are inverse polynomial in the number of
players . We also apply our main results to a multi-dimensional market game.
Our results can be viewed as giving, for a rich class of games, a more robust
version of the Revelation Principle, in that we work with weaker informational
assumptions (no common prior), yet provide a stronger solution concept (ex-post
Nash versus Bayes Nash equilibrium). In comparison to previous work, our main
conceptual contribution is showing that weak mediators are a game theoretic
object that exist in a wide variety of games -- previously, they were only
known to exist in traffic routing games
Query Complexity of Approximate Equilibria in Anonymous Games
We study the computation of equilibria of anonymous games, via algorithms
that may proceed via a sequence of adaptive queries to the game's payoff
function, assumed to be unknown initially. The general topic we consider is
\emph{query complexity}, that is, how many queries are necessary or sufficient
to compute an exact or approximate Nash equilibrium.
We show that exact equilibria cannot be found via query-efficient algorithms.
We also give an example of a 2-strategy, 3-player anonymous game that does not
have any exact Nash equilibrium in rational numbers. However, more positive
query-complexity bounds are attainable if either further symmetries of the
utility functions are assumed or we focus on approximate equilibria. We
investigate four sub-classes of anonymous games previously considered by
\cite{bfh09, dp14}.
Our main result is a new randomized query-efficient algorithm that finds a
-approximate Nash equilibrium querying
payoffs and runs in time . This improves on the running
time of pre-existing algorithms for approximate equilibria of anonymous games,
and is the first one to obtain an inverse polynomial approximation in
poly-time. We also show how this can be utilized as an efficient
polynomial-time approximation scheme (PTAS). Furthermore, we prove that
payoffs must be queried in order to find any
-well-supported Nash equilibrium, even by randomized algorithms
On the Complexity of Nash Equilibria of Action-Graph Games
We consider the problem of computing Nash Equilibria of action-graph games
(AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation
of games that encapsulates both "local" dependencies as in graphical games, and
partial indifference to other agents' identities as in anonymous games, which
occur in many natural settings. This is achieved by specifying a graph on the
set of actions, so that the payoff of an agent for selecting a strategy depends
only on the number of agents playing each of the neighboring strategies in the
action graph. We present a Polynomial Time Approximation Scheme for computing
mixed Nash equilibria of AGGs with constant treewidth and a constant number of
agent types (and an arbitrary number of strategies), together with hardness
results for the cases when either the treewidth or the number of agent types is
unconstrained. In particular, we show that even if the action graph is a tree,
but the number of agent-types is unconstrained, it is NP-complete to decide the
existence of a pure-strategy Nash equilibrium and PPAD-complete to compute a
mixed Nash equilibrium (even an approximate one); similarly for symmetric AGGs
(all agents belong to a single type), if we allow arbitrary treewidth. These
hardness results suggest that, in some sense, our PTAS is as strong of a
positive result as one can expect
On the Complexity of Nash Equilibria in Anonymous Games
We show that the problem of finding an {\epsilon}-approximate Nash
equilibrium in an anonymous game with seven pure strategies is complete in
PPAD, when the approximation parameter {\epsilon} is exponentially small in the
number of players.Comment: full versio
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems arising from the iterated removal of weakly
dominated actions in anonymous games. Our main result shows that it is
NP-complete to decide whether an anonymous game with three actions can be
solved via iterated weak dominance. The two-action case can be reformulated as
a natural elimination problem on a matrix, the complexity of which turns out to
be surprisingly difficult to characterize and ultimately remains open. We
however establish connections to a matching problem along paths in a directed
graph, which is computationally hard in general but can also be used to
identify tractable cases of matrix elimination. We finally identify different
classes of anonymous games where iterated dominance is in P and NP-complete,
respectively.Comment: 12 pages, 3 figures, 27th International Symposium on Theoretical
Aspects of Computer Science (STACS
Playing Anonymous Games using Simple Strategies
We investigate the complexity of computing approximate Nash equilibria in
anonymous games. Our main algorithmic result is the following: For any
-player anonymous game with a bounded number of strategies and any constant
, an -approximate Nash equilibrium can be computed
in polynomial time. Complementing this positive result, we show that if there
exists any constant such that an -approximate
equilibrium can be computed in polynomial time, then there is a fully
polynomial-time approximation scheme for this problem.
We also present a faster algorithm that, for any -player -strategy
anonymous game, runs in time and computes an -approximate equilibrium. This algorithm follows from the
existence of simple approximate equilibria of anonymous games, where each
player plays one strategy with probability , for some small ,
and plays uniformly at random with probability .
Our approach exploits the connection between Nash equilibria in anonymous
games and Poisson multinomial distributions (PMDs). Specifically, we prove a
new probabilistic lemma establishing the following: Two PMDs, with large
variance in each direction, whose first few moments are approximately matching
are close in total variation distance. Our structural result strengthens
previous work by providing a smooth tradeoff between the variance bound and the
number of matching moments
- …