{"id":"https://openalex.org/W4221158097","doi":"https://doi.org/10.1145/3519935.3520071","title":"Parallel repetition for all 3-player games over binary alphabet","display_name":"Parallel repetition for all 3-player games over binary alphabet","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4221158097","doi":"https://doi.org/10.1145/3519935.3520071"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520071","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520071","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520071","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520071","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043669506","display_name":"Uma Girish","orcid":"https://orcid.org/0000-0003-3055-9406"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Uma Girish","raw_affiliation_strings":["Princeton University, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022856374","display_name":"Justin Holmgren","orcid":null},"institutions":[{"id":"https://openalex.org/I4210092597","display_name":"NTT (United States)","ror":"https://ror.org/004cn7092","country_code":"US","type":"company","lineage":["https://openalex.org/I2251713219","https://openalex.org/I4210092597"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Justin Holmgren","raw_affiliation_strings":["NTT Research, USA"],"affiliations":[{"raw_affiliation_string":"NTT Research, USA","institution_ids":["https://openalex.org/I4210092597"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112791007","display_name":"Kunal Mittal","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunal Mittal","raw_affiliation_strings":["Princeton University, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Princeton University, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021239979","display_name":"Wei Zhan","orcid":"https://orcid.org/0000-0002-7167-6353"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wei Zhan","raw_affiliation_strings":["Princeton University, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5043669506"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.9052,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76340292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"998","last_page":"1009"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/repetition","display_name":"Repetition (rhetorical device)","score":0.7820570468902588},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6689423322677612},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.663917064666748},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6180965304374695},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.6041259169578552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.452033668756485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43228667974472046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4242219030857086},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33805495500564575},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2628035843372345},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11863964796066284},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09717169404029846},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.0709233283996582}],"concepts":[{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.7820570468902588},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6689423322677612},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.663917064666748},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6180965304374695},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.6041259169578552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.452033668756485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43228667974472046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4242219030857086},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33805495500564575},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2628035843372345},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11863964796066284},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09717169404029846},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0709233283996582},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520071","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520071","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520071","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3519935.3520071","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520071","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520071","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6000000238418579,"display_name":"Quality Education"}],"awards":[{"id":"https://openalex.org/G4924380218","display_name":"AF: Small: Computational Complexity Lower Bounds: Time, Space and Communication","funder_award_id":"2007462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G57144956","display_name":"AF: Small: Lower Bounds for Computational Models, and Relations to Other Topics in Computational Complexity","funder_award_id":"1714779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4221158097.pdf","grobid_xml":"https://content.openalex.org/works/W4221158097.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W269572962","https://openalex.org/W1879643999","https://openalex.org/W1970259241","https://openalex.org/W1979615282","https://openalex.org/W1999032440","https://openalex.org/W2010631958","https://openalex.org/W2017899870","https://openalex.org/W2019374631","https://openalex.org/W2022444580","https://openalex.org/W2022983100","https://openalex.org/W2031364557","https://openalex.org/W2044471216","https://openalex.org/W2052447582","https://openalex.org/W2073639613","https://openalex.org/W2080578129","https://openalex.org/W2102115128","https://openalex.org/W2102373437","https://openalex.org/W2111385661","https://openalex.org/W2117417786","https://openalex.org/W2126420408","https://openalex.org/W2130318319","https://openalex.org/W2136735959","https://openalex.org/W2143996311","https://openalex.org/W2154386769","https://openalex.org/W2154434103","https://openalex.org/W2163710432","https://openalex.org/W2218607027","https://openalex.org/W2543222200","https://openalex.org/W2899702797","https://openalex.org/W2951003715","https://openalex.org/W2951124766","https://openalex.org/W2962844449","https://openalex.org/W3102777411","https://openalex.org/W3113573473","https://openalex.org/W3179843568","https://openalex.org/W3203176995","https://openalex.org/W4221158097"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2996195527","https://openalex.org/W2978375718","https://openalex.org/W2612358220","https://openalex.org/W2351132524","https://openalex.org/W2916738897","https://openalex.org/W2392934913","https://openalex.org/W2003474770","https://openalex.org/W2801329620","https://openalex.org/W3011277146"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,43],"for":[3,33],"every":[4,34],"3-player":[5],"(3-prover)":[6],"game,":[7,36],"with":[8],"binary":[9],"questions":[10],"and":[11,13],"answers":[12],"value":[14,17,45],"<1,":[15],"the":[16,19,24,44,47,52],"of":[18,23,46,51],"n-fold":[20,48],"parallel":[21,49],"repetition":[22,50],"game":[25,53],"decays":[26],"polynomially":[27],"fast":[28],"to":[29],"0.":[30],"That":[31],"is,":[32],"such":[35,42],"there":[37],"exists":[38],"a":[39],"constant":[40],"c>0,":[41],"is":[54],"at":[55],"most":[56],"n\u2212c.":[57]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}