May 21, 2013 · We consider the complexity of finding a correlated equilibrium of an n-player game in a model that allows the algorithm to make queries on ...

Jun 11, 2013 · Title:Query Complexity of Correlated Equilibrium ... Abstract:We study lower bounds on the query complexity of determining correlated equilibrium.

The query complexity of an LP of size comparable to the correlated equilibrium LP is thus Ω ( N ) = Ω ( 2 n ) , i.e., exponential in n. This immediately implies ...

Jul 31, 2015 · We study lower bounds on the query complexity of determining correlated equilibrium. In particular, we consider a query model in which an ...

May 17, 2013 · Theorem A: Every deterministic algorithm that finds a 1/2-approximate correlated equilibrium in all bi-strategy games with 0/1 utilities ...

We consider the complexity of finding a correlated equilibrium of an n-player game in a model that allows the algorithm to make queries on players' payoffs ...

We analyze the number of payoff queries needed to compute approximate equilibria of multi-player games. We find that query complexity is an effective tool ...

In this model, we establish that in order to compute a correlated equilibrium, any deterministic algorithm must query the black box an exponential (in n) number ...

Abstract. We consider the complexity of finding a correlated equilibrium of an $n$-player game in a model that allows the algorithm to make queries on ...

We consider the complexity of finding a _correlated equilibrium_ in an n-player game, in a model that allows the algorithm to make queries for players' ...