{"id":"https://openalex.org/W4383619660","doi":"https://doi.org/10.1145/3606697","title":"A Polynomial-Time Algorithm\u00a0for 1/3-Approximate Nash Equilibria in Bimatrix Games","display_name":"A Polynomial-Time Algorithm\u00a0for 1/3-Approximate Nash Equilibria in Bimatrix Games","publication_year":2023,"publication_date":"2023-07-08","ids":{"openalex":"https://openalex.org/W4383619660","doi":"https://doi.org/10.1145/3606697"},"language":"en","primary_location":{"id":"doi:10.1145/3606697","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3606697","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3606697","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3606697","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361071","display_name":"Argyrios Deligkas","orcid":"https://orcid.org/0000-0002-6513-6748"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Argyrios Deligkas","raw_affiliation_strings":["Royal Holloway University of London, UK"],"raw_orcid":"https://orcid.org/0000-0002-6513-6748","affiliations":[{"raw_affiliation_string":"Royal Holloway University of London, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007544604","display_name":"Michail Fasoulakis","orcid":"https://orcid.org/0000-0003-1870-3444"},"institutions":[{"id":"https://openalex.org/I8901234","display_name":"Foundation for Research and Technology Hellas","ror":"https://ror.org/052rphn09","country_code":"GR","type":"facility","lineage":["https://openalex.org/I8901234"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Michail Fasoulakis","raw_affiliation_strings":["Foundation for Research and Technology-Hellas (FORTH), Greece"],"raw_orcid":"https://orcid.org/0000-0003-1870-3444","affiliations":[{"raw_affiliation_string":"Foundation for Research and Technology-Hellas (FORTH), Greece","institution_ids":["https://openalex.org/I8901234"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050068584","display_name":"Evangelos Markakis","orcid":null},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Evangelos Markakis","raw_affiliation_strings":["Athens University of Economics and Business, Greece"],"raw_orcid":"https://orcid.org/0000-0003-1855-141X","affiliations":[{"raw_affiliation_string":"Athens University of Economics and Business, Greece","institution_ids":["https://openalex.org/I73142707"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3679,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81276427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"19","issue":"4","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9998000264167786,"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.9998000264167786,"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.9968000054359436,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7367618083953857},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6607837677001953},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6521302461624146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49816155433654785},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47388333082199097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44764208793640137},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43330317735671997},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.4303942322731018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42836323380470276},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41750919818878174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.416460782289505}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7367618083953857},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6607837677001953},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6521302461624146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49816155433654785},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47388333082199097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44764208793640137},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43330317735671997},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.4303942322731018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42836323380470276},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41750919818878174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.416460782289505},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3606697","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3606697","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3606697","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3606697","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3606697","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3606697","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4383619660.pdf","grobid_xml":"https://content.openalex.org/works/W4383619660.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1531609333","https://openalex.org/W1535640827","https://openalex.org/W1648820898","https://openalex.org/W1653262231","https://openalex.org/W1725063609","https://openalex.org/W1805772200","https://openalex.org/W1828524803","https://openalex.org/W1941744740","https://openalex.org/W2029825080","https://openalex.org/W2057913812","https://openalex.org/W2072656810","https://openalex.org/W2075425349","https://openalex.org/W2091731906","https://openalex.org/W2103463385","https://openalex.org/W2104647222","https://openalex.org/W2107285505","https://openalex.org/W2122497197","https://openalex.org/W2131967794","https://openalex.org/W2136105862","https://openalex.org/W2140790422","https://openalex.org/W2606445249","https://openalex.org/W2788162409","https://openalex.org/W2806555090","https://openalex.org/W2807823918","https://openalex.org/W2809314237","https://openalex.org/W2898884066","https://openalex.org/W2964053259","https://openalex.org/W3128283782","https://openalex.org/W3136147237","https://openalex.org/W3201960926","https://openalex.org/W3215281080","https://openalex.org/W4234761190","https://openalex.org/W4316652323"],"related_works":["https://openalex.org/W2236801283","https://openalex.org/W2107983838","https://openalex.org/W2728657731","https://openalex.org/W2481143976","https://openalex.org/W1853631319","https://openalex.org/W2092374696","https://openalex.org/W2803932348","https://openalex.org/W3207342620","https://openalex.org/W2803931294","https://openalex.org/W2013767790"],"abstract_inverted_index":{"Since":[0],"the":[1,27,48,59,75,78,81,94,124,137,146,154,165],"celebrated":[2],"PPAD-completeness":[3],"result":[4],"for":[5,108],"Nash":[6,24],"equilibria":[7],"in":[8,36,98,136,160],"bimatrix":[9],"games,":[10],"a":[11,41,54,90,99,104],"long":[12],"line":[13],"of":[14,50,57,61,72,77,93,117,126,129,140,148,164],"research":[15],"has":[16,39],"focused":[17],"on":[18,46],"polynomial-time":[19,100],"algorithms":[20],"that":[21,32,102,157],"compute":[22],"\u03b5-approximate":[23],"equilibria.":[25,52],"Finding":[26],"best":[28],"possible":[29],"approximation":[30,70],"guarantee":[31,71],"we":[33,88,152,158],"can":[34],"have":[35],"polynomial":[37],"time":[38],"been":[40],"fundamental":[42],"and":[43,63,131,144],"non-trivial":[44],"pursuit":[45],"settling":[47],"complexity":[49],"approximate":[51],"Despite":[53],"significant":[55],"amount":[56],"effort,":[58],"algorithm":[60,101],"Tsaknakis":[62],"Spirakis":[64],"[":[65,141],"38":[66,142],"],":[67,143],"with":[68],"an":[69],"(0.3393+\u03b4),":[73],"remains":[74],"state":[76],"art":[79],"over":[80],"last":[82],"15":[83],"years.":[84],"In":[85],"this":[86],"paper,":[87],"propose":[89],"new":[91],"refinement":[92],"Tsaknakis-Spirakis":[95],"algorithm,":[96],"resulting":[97],"computes":[103],"\\((\\frac{1}{3}+\\delta)\\)":[105],"-Nash":[106],"equilibrium,":[107],"any":[109],"constant":[110],"\u03b4":[111],">":[112],"0.":[113],"The":[114],"main":[115],"idea":[116],"our":[118],"approach":[119],"is":[120],"to":[121],"go":[122],"beyond":[123],"use":[125],"convex":[127],"combinations":[128],"primal":[130],"dual":[132],"strategies,":[133],"as":[134],"defined":[135],"optimization":[138],"framework":[139],"enrich":[145],"pool":[147],"strategies":[149],"from":[150],"which":[151],"build":[153],"strategy":[155],"profiles":[156],"output":[159],"certain":[161],"bottleneck":[162],"cases":[163],"algorithm.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}