Affiliation:
1. California Institute of Technology
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.
Funder
Linde/SISL postdoctoral fellowship
NSF
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献