Query complexity of correlated equilibrium

Yakov Babichenko; Siddharth Barman

doi:10.1145/2785668

Query complexity of correlated equilibrium

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Article number	22
Journal	ACM Transactions on Economics and Computation
Volume	3
Issue number	4
DOIs	https://doi.org/10.1145/2785668
State	Published - 1 Jul 2015
Externally published	Yes

Keywords

Computation of equilibrium
Correlated equilibrium
Query complexity

All Science Journal Classification (ASJC) codes

Computer Science (miscellaneous)
Statistics and Probability
Economics and Econometrics
Marketing
Computational Mathematics

Access to Document

10.1145/2785668

Cite this

@article{31d827b2adfa421295bd7b2a683bc895,

title = "Query complexity of correlated equilibrium",

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 = "Computation of equilibrium, Correlated equilibrium, Query complexity",

author = "Yakov Babichenko and Siddharth Barman",

note = "Publisher Copyright: {\textcopyright} 2015 ACM 2167-8375/2015/07-ART22 $15.00.",

year = "2015",

month = jul,

day = "1",

doi = "10.1145/2785668",

language = "الإنجليزيّة",

volume = "3",

journal = "ACM Transactions on Economics and Computation",

issn = "2167-8375",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

TY - JOUR

T1 - Query complexity of correlated equilibrium

AU - Babichenko, Yakov

AU - Barman, Siddharth

PY - 2015/7/1

Y1 - 2015/7/1

N2 - 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.

AB - 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.

KW - Computation of equilibrium

KW - Correlated equilibrium

KW - Query complexity

UR - http://www.scopus.com/inward/record.url?scp=85009422347&partnerID=8YFLogxK

U2 - 10.1145/2785668

DO - 10.1145/2785668

M3 - مقالة

SN - 2167-8375

VL - 3

JO - ACM Transactions on Economics and Computation

JF - ACM Transactions on Economics and Computation

IS - 4

M1 - 22

ER -

Query complexity of correlated equilibrium

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this