{"id":"https://openalex.org/W2293140407","doi":"https://doi.org/10.1145/1993636.1993666","title":"Dueling algorithms","display_name":"Dueling algorithms","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2293140407","doi":"https://doi.org/10.1145/1993636.1993666","mag":"2293140407"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993666","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993636.1993666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5009111822","display_name":"Nicole Immorlica","orcid":"https://orcid.org/0000-0003-4180-4657"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nicole Immorlica","raw_affiliation_strings":["Northwestern University, Evanston, USA"],"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086904495","display_name":"Adam Tauman Kalai","orcid":"https://orcid.org/0000-0002-4559-8574"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adam Tauman Kalai","raw_affiliation_strings":["MSR New England, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"MSR New England, Cambridge, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082964830","display_name":"Brendan Lucier","orcid":"https://orcid.org/0009-0006-3497-0875"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Brendan Lucier","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045798295","display_name":"Ankur Moitra","orcid":"https://orcid.org/0000-0001-7047-0495"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankur Moitra","raw_affiliation_strings":["MIT, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072815956","display_name":"Andrew Postlewaite","orcid":null},"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"]},{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Postlewaite","raw_affiliation_strings":["UPenn, Philadelphia, USA"],"affiliations":[{"raw_affiliation_string":"UPenn, Philadelphia, USA","institution_ids":["https://openalex.org/I922845939","https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003520806","display_name":"Moshe Tennenholtz","orcid":"https://orcid.org/0000-0002-9459-5388"},"institutions":[{"id":"https://openalex.org/I4210125051","display_name":"Microsoft (Israel)","ror":"https://ror.org/03819cc96","country_code":"IL","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210125051"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Tennenholtz","raw_affiliation_strings":["Microsoft R&D Israel and the Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Microsoft R&D Israel and the Technion, Haifa, Israel","institution_ids":["https://openalex.org/I4210125051"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5009111822"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":5.7361,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.96152354,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"224"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/minimax","display_name":"Minimax","score":0.6948624849319458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6028324365615845},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5498934388160706},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4931725859642029},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4645746648311615},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.46276751160621643},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41753238439559937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3227010667324066},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.31317541003227234},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19681701064109802}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6948624849319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6028324365615845},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5498934388160706},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4931725859642029},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4645746648311615},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.46276751160621643},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41753238439559937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3227010667324066},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.31317541003227234},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19681701064109802},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993636.1993666","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993636.1993666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1566352384","https://openalex.org/W1569977504","https://openalex.org/W2014482607","https://openalex.org/W2017572518","https://openalex.org/W2113195911","https://openalex.org/W2124272925","https://openalex.org/W2133893681","https://openalex.org/W2157518489","https://openalex.org/W2160640936","https://openalex.org/W2167922736","https://openalex.org/W2169401877","https://openalex.org/W2914254234","https://openalex.org/W4285719527","https://openalex.org/W6759732196"],"related_works":["https://openalex.org/W1495725930","https://openalex.org/W2582091787","https://openalex.org/W2998661990","https://openalex.org/W2811435312","https://openalex.org/W4213195198","https://openalex.org/W843542728","https://openalex.org/W2382626982","https://openalex.org/W2354443135","https://openalex.org/W2376716665","https://openalex.org/W3181093338"],"abstract_inverted_index":{"We":[0,59,77,90],"revisit":[1],"classic":[2,100],"algorithmic":[3],"search":[4,29,86],"and":[5,73,84],"optimization":[6,101],"problems":[7],"from":[8],"the":[9,42,99],"perspective":[10],"of":[11,80],"competition.":[12],"Rather":[13],"than":[14],"a":[15,23,28,56],"single":[16],"optimizer":[17],"minimizing":[18],"expected":[19],"cost,":[20],"we":[21],"consider":[22],"zero-sum":[24,50],"game":[25],"in":[26,103],"which":[27,64],"problem":[30],"is":[31,39],"presented":[32],"to":[33,40,70],"two":[34],"players,":[35],"whose":[36],"only":[37],"goal":[38],"outperform":[41],"opponent.":[43],"Such":[44],"games":[45],"are":[46],"typically":[47],"exponentially":[48],"large":[49],"games,":[51],"but":[52],"they":[53],"often":[54,95],"have":[55],"rich":[57],"structure.":[58],"provide":[60],"general":[61],"techniques":[62],"by":[63],"such":[65,104],"structure":[66],"can":[67,97],"be":[68],"leveraged":[69],"find":[71],"minmax-optimal":[72,75],"approximate":[74],"strategies.":[76],"give":[78,91],"examples":[79],"ranking,":[81],"hiring,":[82],"compression,":[83],"binary":[85],"duels,":[87],"among":[88],"others.":[89],"bounds":[92],"on":[93],"how":[94],"one":[96],"beat":[98],"algorithms":[102],"duels.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}