{"id":"https://openalex.org/W2138787960","doi":"https://doi.org/10.4086/toc.2005.v001a006","title":"","display_name":"","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2138787960","doi":"https://doi.org/10.4086/toc.2005.v001a006","mag":"2138787960"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2005.v001a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2005.v001a006","pdf_url":"https://theoryofcomputing.org/articles/v001a006/v001a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v001a006/v001a006.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avrim Blum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108523409","display_name":"David P. Bunde","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David P. Bunde","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014637159","display_name":"Yishay Mansour","orcid":"https://orcid.org/0000-0001-6891-2645"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yishay Mansour","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.21481359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":"1","first_page":"105","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9886999726295471,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9835000038146973,"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/computer-science","display_name":"Computer science","score":0.6742072105407715},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5868165493011475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5324215888977051},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4919893443584442},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.46965160965919495},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4488612711429596},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3293268382549286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22948595881462097},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1327020227909088}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6742072105407715},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5868165493011475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5324215888977051},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4919893443584442},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.46965160965919495},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4488612711429596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3293268382549286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22948595881462097},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1327020227909088},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2005.v001a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2005.v001a006","pdf_url":"https://theoryofcomputing.org/articles/v001a006/v001a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2005.v001a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2005.v001a006","pdf_url":"https://theoryofcomputing.org/articles/v001a006/v001a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5675869918","display_name":"ITR/PE+SY: Collaborative Research: Foundations of Electronic Marketplaces: Game Theory, Algorithms and Systems","funder_award_id":"0121678","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6484169224","display_name":"ITR/SY+IM+AP: Center for Applied Algorithms","funder_award_id":"0122581","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6546929923","display_name":null,"funder_award_id":"CCR-0122581","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6559192478","display_name":"Machine Learning, On-line Algorithms, and Optimization","funder_award_id":"0105488","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6636498718","display_name":"CAREER:  Realistically Efficient Geometric Algorithms","funder_award_id":"0093348","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7628893514","display_name":null,"funder_award_id":"ITR IIS-0121678","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"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2138787960.pdf","grobid_xml":"https://content.openalex.org/works/W2138787960.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W2014894132","https://openalex.org/W2019729116","https://openalex.org/W2020384210","https://openalex.org/W2056656460","https://openalex.org/W2078075652","https://openalex.org/W2080354718","https://openalex.org/W2114218179","https://openalex.org/W2119013235","https://openalex.org/W2119562491","https://openalex.org/W2139739478","https://openalex.org/W2171330236"],"related_works":["https://openalex.org/W4299302777","https://openalex.org/W2777812223","https://openalex.org/W1996806106","https://openalex.org/W2058681277","https://openalex.org/W2922865928","https://openalex.org/W2951573806","https://openalex.org/W4383557903","https://openalex.org/W1867520515","https://openalex.org/W4241266436","https://openalex.org/W1603057269"],"abstract_inverted_index":{"Resource":[0],"allocation":[1],"and":[2,43,121,156],"admission":[3],"control":[4],"are":[5,103],"critical":[6],"tasks":[7],"in":[8,90],"a":[9,33,49,91,143,172],"communication":[10],"network":[11],"that":[12,93,108,125,170],"often":[13,67],"must":[14],"be":[15,68],"performed":[16],"online.":[17],"Algorithms":[18],"for":[19,62,85,154,160],"these":[20,63,88],"types":[21],"of":[22,35,40,51,56,81,87,118,135,174],"problems":[23],"have":[24],"been":[25],"considered":[26],"both":[27,97],"under":[28,44,96],"benefit":[29],"models":[30,46],"(e.g.,":[31,47],"with":[32,48,113,130,146],"goal":[34,50],"approximately":[36,52],"maximizing":[37],"the":[38,54,79,116,133],"number":[39,55,117,134],"requests":[41,57,120],"accepted)":[42],"cost":[45],"minimizing":[53],"rejected).":[58],"Unfortunately,":[59],"algorithms":[60,83],"designed":[61,84],"two":[64],"measures":[65,98],"can":[66,178],"quite":[69],"different,":[70],"even":[71],"polar":[72],"opposites.":[73],"In":[74],"this":[75],"work":[76],"we":[77,102,177],"consider":[78],"problem":[80],"combining":[82],"each":[86],"objectives":[89],"way":[92],"is":[94,109,126],"good":[95],"simultaneously.":[99],"More":[100],"formally,":[101],"given":[104,171],"an":[105,122],"algorithm":[106,123,145],"A":[107,111,152,158],"c":[110,127,151],"competitive":[112,129,147],"respect":[114,131],"to":[115,132,141,168],"accepted":[119],"R":[124,128,150],"rejected":[136],"requests.":[137],"We":[138,162],"show":[139,169],"how":[140],"derive":[142],"combined":[144],"ratio":[148],"O(c":[149,157],")":[153,159],"rejection":[155],"acceptance.":[161],"also":[163],"build":[164],"on":[165],"known":[166],"techniques":[167],"collection":[173],"k":[175],"algorithms,":[176]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2016-06-24T00:00:00"}