Open AccessPosted Content
On the Communication Complexity of Approximate Nash Equilibria
Paul Goldberg,Arnoud Pastink +1 more
Reads0
Chats0
TLDR
In this paper, the problem of computing approximate Nash equilibria of bimatrix games with one-way communication has been studied, where players initially know their own payoffs but not the payoffs of the other player.Abstract:
We study the problem of computing approximate Nash equilibria of bimatrix games, in a setting where players initially know their own payoffs but not the payoffs of the other player. In order for a solution of reasonable quality to be found, some amount of communication needs to take place between the players. We are interested in algorithms where the communication is substantially less than the contents of a payoff matrix, for example logarithmic in the size of the matrix. When the communication is polylogarithmic in the number of strategies n, we show how to obtain epsilon-approximate Nash equilibria for epsilon approximately 0.438, and for well-supported approximate equilibria we obtain epsilon approximately 0.732. For one-way communication we show that epsilon=1/2 is achievable, but no constant improvement over 1/2 is possible, even with unlimited one-way communication. For well-supported equilibria, no value of epsilon less than 1 is achievable with one-way communication. When the players do not communicate at all, epsilon-Nash equilibria can be obtained for epsilon=3/4, and we also give a lower bound of slightly more than 1/2 on the lowest constant epsilon achievable.read more
Citations
More filters
Journal Article
Deterministic Communication vs. Partition Number.
TL;DR: In this paper, it was shown that deterministic communication complexity can be superlogarithmic in the partition number of the associated communication matrix, and near-optimal deterministic lower bounds were obtained.
Journal ArticleDOI
Algorithmic information structure design: a survey
TL;DR: This monograph divides information structure design into single agent and multiple agent models, and further subdivides the multiple agent case into the public channel and private channel modes of information revelation.
Journal Article
Rectangles Are Nonnegative Juntas.
TL;DR: In this paper, the communication lower bound for composed functions of the form $f\circ g^n, where f is any boolean function on n inputs and g is a sufficiently hard two-party gadget, was established.
Posted Content
Query-to-Communication Lifting for BPP
TL;DR: It is shown that the randomized communication complexity of the composed function f o g^n, where g is an index gadget, is characterized by the randomized decision tree complexity of f, meaning that many query complexity separations involving randomized models automatically imply analogous separations in communication complexity.
Posted Content
Learning Equilibria of Games via Payoff Queries
TL;DR: This work studies a corresponding computational learning model, and the query complexity of learning equilibria for various classes of games, and has the stronger result that an equilibrium can be identified while only learning a small fraction of the cost values.
References
More filters
Book ChapterDOI
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
Book ChapterDOI
Non-cooperative games
TL;DR: In this article, it was shown that the set of equilibrium points of a two-person zero-sum game can be defined as a set of all pairs of opposing "good" strategies.
Book
Linear Programming and Extensions
TL;DR: This classic book looks at a wealth of examples and develops linear programming methods for their solutions and begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them.
Journal ArticleDOI
A new polynomial-time algorithm for linear programming
TL;DR: It is proved that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property: the ratio of the radius of the smallest sphere with center a′, containingP′ to theradius of the largest sphere withCenter a′ contained inP′ isO(n).