Query Complexity of Correlated Equilibrium
Computer Science and Game Theory
2013-07-15 v2
Abstract
We study lower bounds on the query complexity of determining correlated equilibrium. In particular, we consider a query model in which an n-player game is specified via a black box that returns players' utilities at pure action profiles. 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 of times.
Keywords
Cite
@article{arxiv.1306.2437,
title = {Query Complexity of Correlated Equilibrium},
author = {Yakov Babichenko and Siddharth Barman},
journal= {arXiv preprint arXiv:1306.2437},
year = {2013}
}
Comments
Added references