{"id":"https://openalex.org/W2396633455","doi":"https://doi.org/10.1145/2956582","title":"Bounds for the Query Complexity of Approximate Equilibria","display_name":"Bounds for the Query Complexity of Approximate Equilibria","publication_year":2016,"publication_date":"2016-08-26","ids":{"openalex":"https://openalex.org/W2396633455","doi":"https://doi.org/10.1145/2956582","mag":"2396633455"},"language":"en","primary_location":{"id":"doi:10.1145/2956582","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2956582","pdf_url":null,"source":{"id":"https://openalex.org/S4210173995","display_name":"ACM Transactions on Economics and Computation","issn_l":"2167-8375","issn":["2167-8375","2167-8383"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Economics and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067662147","display_name":"Paul W. Goldberg","orcid":"https://orcid.org/0000-0002-5436-7890"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Paul W. Goldberg","raw_affiliation_strings":["University of Oxford, Oxford, U.K"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057693522","display_name":"Aaron Roth","orcid":"https://orcid.org/0000-0002-0586-0515"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Roth","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067662147"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":9.3354,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.97945691,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"4","issue":"4","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7036793231964111},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.5665155649185181},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5548134446144104},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5531724691390991},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.496282160282135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49311015009880066},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4925325810909271},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4891248345375061},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4519568979740143},{"id":"https://openalex.org/keywords/correlated-equilibrium","display_name":"Correlated equilibrium","score":0.440559983253479},{"id":"https://openalex.org/keywords/equilibrium-selection","display_name":"Equilibrium selection","score":0.3966253697872162},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3861492872238159},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35334670543670654},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.2741329073905945},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22969260811805725},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.20311972498893738},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.1829451322555542}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7036793231964111},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.5665155649185181},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5548134446144104},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5531724691390991},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.496282160282135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49311015009880066},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4925325810909271},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4891248345375061},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4519568979740143},{"id":"https://openalex.org/C163630976","wikidata":"https://www.wikidata.org/wiki/Q964667","display_name":"Correlated equilibrium","level":5,"score":0.440559983253479},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.3966253697872162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3861492872238159},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35334670543670654},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.2741329073905945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22969260811805725},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.20311972498893738},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.1829451322555542},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2956582","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2956582","pdf_url":null,"source":{"id":"https://openalex.org/S4210173995","display_name":"ACM Transactions on Economics and Computation","issn_l":"2167-8375","issn":["2167-8375","2167-8383"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Economics and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1945964198","display_name":"Efficient Algorithms for Mechanism Design Without Monetary Transfer","funder_award_id":"EP/K01000X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8025662718","display_name":null,"funder_award_id":"EP/K01000X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1586209290","https://openalex.org/W1607093780","https://openalex.org/W1975651137","https://openalex.org/W1978387749","https://openalex.org/W1981247840","https://openalex.org/W1985310469","https://openalex.org/W1997147068","https://openalex.org/W2002373723","https://openalex.org/W2057913812","https://openalex.org/W2059732663","https://openalex.org/W2078473680","https://openalex.org/W2097160297","https://openalex.org/W2106887613","https://openalex.org/W2122414948","https://openalex.org/W2122497197","https://openalex.org/W2126776273","https://openalex.org/W2129428954","https://openalex.org/W2140086339","https://openalex.org/W2150865801","https://openalex.org/W2166074149","https://openalex.org/W2568433471"],"related_works":["https://openalex.org/W2013767790","https://openalex.org/W4315489088","https://openalex.org/W4299551322","https://openalex.org/W4301347782","https://openalex.org/W1667857601","https://openalex.org/W1853631319","https://openalex.org/W4386412204","https://openalex.org/W2760737027","https://openalex.org/W3097817394","https://openalex.org/W4299590005"],"abstract_inverted_index":{"We":[0,15,174],"analyze":[1],"the":[2,26,43,57,81,87,97,107,121,131,141,148,152,186],"number":[3],"of":[4,12,29,60,100,110,123,133,151,178],"payoff":[5],"queries":[6],"needed":[7],"to":[8,130,147],"compute":[9],"approximate":[10,61,66,103,111,126,163],"equilibria":[11,165],"multi-player":[13],"games.":[14,173],"find":[16],"that":[17],"query":[18,44,58,98,143,193],"complexity":[19,59,99],"is":[20,145],"an":[21,125],"effective":[22],"tool":[23],"for":[24,38,159],"distinguishing":[25],"computational":[27],"difficulty":[28],"alternative":[30],"solution":[31],"concepts,":[32],"and":[33,40,53],"we":[34,49,89,115],"develop":[35],"new":[36],"techniques":[37],"upper-":[39],"lower":[41,54,93],"bounding":[42],"complexity.":[45],"For":[46,64],"binary-choice":[47],"games,":[48],"show":[50,90],"logarithmic":[51],"upper":[52],"bounds":[55],"on":[56],"correlated":[62,67,104,112,168],"equilibrium.":[63,113],"well-supported":[65,127],"equilibrium":[68,105,129],"(a":[69],"restriction":[70],"where":[71,140],"a":[72,91,117,135,156,176],"player\u2019s":[73],"behavior":[74],"must":[75],"always":[76],"be":[77,189],"approximately":[78],"optimal,":[79],"in":[80,170,184],"worst":[82],"case":[83],"over":[84],"draws":[85],"from":[86,106,120],"distribution)":[88],"linear":[92],"bound,":[94],"thus":[95],"separating":[96],"well":[101,136,161],"supported":[102,137,162],"standard":[108],"notion":[109],"Finally,":[114],"give":[116],"query-efficient":[118],"reduction":[119,187],"problem":[122,132],"computing":[124,160],"Nash":[128,138,164],"verifying":[134],"equilibrium,":[139],"additional":[142],"overhead":[144],"proportional":[146],"description":[149],"length":[150],"game.":[153],"This":[154],"gives":[155],"polynomial-query":[157],"algorithm":[158],"(and":[166],"hence":[167],"equilibria)":[169],"concisely":[171],"represented":[172],"identify":[175],"class":[177],"games":[179],"(which":[180],"includes":[181],"congestion":[182],"games)":[183],"which":[185],"can":[188],"made":[190],"not":[191],"only":[192],"efficient,":[194],"but":[195],"also":[196],"computationally":[197],"efficient.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}