{"id":"https://openalex.org/W2772039599","doi":"https://doi.org/10.1145/3136754","title":"Competitive Algorithms from Competitive Equilibria","display_name":"Competitive Algorithms from Competitive Equilibria","publication_year":2017,"publication_date":"2017-12-11","ids":{"openalex":"https://openalex.org/W2772039599","doi":"https://doi.org/10.1145/3136754","mag":"2772039599"},"language":"en","primary_location":{"id":"doi:10.1145/3136754","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3136754","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3136754?download=true","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/3136754?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["University of California, Merced, CA"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, CA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043137436","display_name":"Janardhan Kulkarni","orcid":"https://orcid.org/0009-0005-9980-7836"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Janardhan Kulkarni","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047351951","display_name":"Kamesh Munagala","orcid":"https://orcid.org/0000-0003-2636-9650"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kamesh Munagala","raw_affiliation_strings":["Duke University, Durham NC"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham NC","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006392819"],"corresponding_institution_ids":["https://openalex.org/I156087764"],"apc_list":null,"apc_paid":null,"fwci":1.5314,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.85956735,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"65","issue":"1","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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/T11182","display_name":"Auction Theory and Applications","score":0.995199978351593,"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.7840601205825806},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5939481258392334},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.47416630387306213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43764206767082214},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.42107099294662476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4190748333930969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14694687724113464},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10762667655944824},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10640895366668701},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1028856635093689}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7840601205825806},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5939481258392334},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.47416630387306213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43764206767082214},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.42107099294662476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4190748333930969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14694687724113464},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10762667655944824},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10640895366668701},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1028856635093689},{"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.1145/3136754","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3136754","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3136754?download=true","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3136754","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3136754","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3136754?download=true","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G120186510","display_name":"III: Medium:Simplifying Database Management with Automated Experimentation","funder_award_id":"0964560","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2695219330","display_name":"CAREER: Light-weight Near-optimal Stochastic Control Policies for Information Acquisition and Exploitation","funder_award_id":"0745761","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3257478624","display_name":"CCF:AF:EAGER Algorithmic Paradigms for Computation on MapReduce","funder_award_id":"1348696","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3424441068","display_name":null,"funder_award_id":"W911NF-14-1","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G3972578554","display_name":null,"funder_award_id":"W911NF-14-1-0366","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G5774808026","display_name":null,"funder_award_id":"IIS-1447554","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6559128579","display_name":null,"funder_award_id":"CCF-1348696","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G691689332","display_name":null,"funder_award_id":"CCF-1409130","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G70976456","display_name":null,"funder_award_id":"CCF-0745761, CCF-1008065, CCF-1348696, CCF-1408784, IIS-0964560, IIS-1447554","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7219055393","display_name":"AF: Medium: Collaborative Research: Multi-dimensional Scheduling and Resource Allocation in Data Centers","funder_award_id":"1409130","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7452299184","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G7494066774","display_name":"AF: Medium: Collaborative Research: Multi-dimensional Scheduling and Resource Allocation in Data Centers","funder_award_id":"1408784","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7679193398","display_name":null,"funder_award_id":"CCF-1408784","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8302925103","display_name":"BIGDATA: F: DKA: Collaborative Research: Dealing Efficiently with Big Social Network Data","funder_award_id":"1447554","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8699457320","display_name":"AF: Small:  Auction Design in Constrained Settings","funder_award_id":"1008065","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8998121839","display_name":null,"funder_award_id":"911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307791","display_name":"Cisco Systems","ror":"https://ror.org/03yt1ez60"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2772039599.pdf","grobid_xml":"https://content.openalex.org/works/W2772039599.grobid-xml"},"referenced_works_count":68,"referenced_works":["https://openalex.org/W34718062","https://openalex.org/W165387623","https://openalex.org/W195867136","https://openalex.org/W784580495","https://openalex.org/W1498726528","https://openalex.org/W1501066815","https://openalex.org/W1508968115","https://openalex.org/W1528157682","https://openalex.org/W1544574065","https://openalex.org/W1563776668","https://openalex.org/W1804511434","https://openalex.org/W1806207712","https://openalex.org/W1854885336","https://openalex.org/W1861377444","https://openalex.org/W1890643295","https://openalex.org/W1899379166","https://openalex.org/W1964506478","https://openalex.org/W1965378629","https://openalex.org/W1971326463","https://openalex.org/W1972868674","https://openalex.org/W1974754122","https://openalex.org/W1974874470","https://openalex.org/W1975378045","https://openalex.org/W2006109604","https://openalex.org/W2007479771","https://openalex.org/W2007604989","https://openalex.org/W2017334559","https://openalex.org/W2017990047","https://openalex.org/W2018043895","https://openalex.org/W2025878354","https://openalex.org/W2057738769","https://openalex.org/W2077339343","https://openalex.org/W2084685902","https://openalex.org/W2084765981","https://openalex.org/W2090986925","https://openalex.org/W2096036254","https://openalex.org/W2100283019","https://openalex.org/W2102252987","https://openalex.org/W2105862720","https://openalex.org/W2112288559","https://openalex.org/W2114725112","https://openalex.org/W2119738171","https://openalex.org/W2123945791","https://openalex.org/W2124402683","https://openalex.org/W2129391890","https://openalex.org/W2140486418","https://openalex.org/W2148204686","https://openalex.org/W2151527192","https://openalex.org/W2156307401","https://openalex.org/W2159715570","https://openalex.org/W2170045213","https://openalex.org/W2171519206","https://openalex.org/W2218828582","https://openalex.org/W2272870368","https://openalex.org/W2295130467","https://openalex.org/W2296319761","https://openalex.org/W2395177313","https://openalex.org/W2397558994","https://openalex.org/W2568156492","https://openalex.org/W2792559166","https://openalex.org/W2950293225","https://openalex.org/W2988480584","https://openalex.org/W3005451364","https://openalex.org/W3121701465","https://openalex.org/W4205585032","https://openalex.org/W4231139262","https://openalex.org/W4240896209","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W1488585910","https://openalex.org/W2563401265","https://openalex.org/W2012502482","https://openalex.org/W1969305723","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2051487156","https://openalex.org/W2793095688","https://openalex.org/W1987227815","https://openalex.org/W1970915793"],"abstract_inverted_index":{"We":[0,106,213,236,245],"introduce":[1],"and":[2,25,27,62,93,131,188,233,308,332],"study":[3],"a":[4,47,108,112,136,242,261,271],"general":[5,189,258],"scheduling":[6,50,63,71,304,320],"problem":[7,14],"that":[8,115,201,247],"we":[9,181,292],"term":[10],"the":[11,28,32,35,53,125,143,153,173,183,202,226,249,266,277],"Polytope":[12],"Scheduling":[13],"(PSP).":[15],"In":[16],"this":[17],"problem,":[18],"jobs":[19,36,64,208],"can":[20],"have":[21],"different":[22,66],"arrival":[23],"times":[24],"sizes,":[26],"rates":[29],"assigned":[30],"by":[31,218],"scheduler":[33],"to":[34,39,83,159,206,279],"are":[37],"subject":[38],"arbitrary":[40],"packing":[41],"constraints.":[42],"The":[43,288],"PSP":[44,88,122,140,259,283],"framework":[45],"captures":[46,70,298,314],"variety":[48],"of":[49,56,65,139,175,228,282],"problems,":[51,321],"including":[52],"classical":[54],"problems":[55],"unrelated":[57],"machines":[58],"scheduling,":[59,61,311],"broadcast":[60],"parallelizability.":[67],"It":[68],"also":[69,313],"constraints":[72],"arising":[73],"in":[74,102,172,178,186,224],"diverse":[75],"modern":[76],"environments":[77],"ranging":[78],"from":[79],"individual":[80],"computer":[81],"architectures":[82],"data":[84,103],"centers.":[85],"More":[86],"concretely,":[87],"models":[89],"multidimensional":[90],"resource":[91,179,333],"requirements":[92,100],"parallelizability,":[94],"as":[95,97,303,315,323],"well":[96],"network":[98],"bandwidth":[99],"found":[101],"center":[104],"scheduling.":[105],"show":[107,246],"surprising":[109],"result\u2014there":[110],"is":[111,116,127,145,198],"single":[113,324],"algorithm":[114,150,158,203,256],"O":[117,132],"(1)":[118,133],"competitive":[119,134,267],"for":[120,135,191,248,257,290],"all":[121],"instances":[123,141],"when":[124,142,284],"objective":[126,144],"total":[128,146,250],"completion":[129],"time,":[130],"large":[137],"sub-class":[138,289],"flow":[147,251,286,326],"time.":[148,287],"This":[149,275],"simply":[151],"uses":[152],"well-known":[154],"Proportional":[155],"Fairness":[156],"(PF)":[157],"perform":[160],"allocations":[161],"each":[162],"time":[163,252],"instant.":[164],"Though":[165],"P":[166,196],"F":[167,197],"has":[168,260],"been":[169],"extensively":[170],"studied":[171],"context":[174],"maximizing":[176],"fairness":[177],"allocation,":[180],"present":[182],"first":[184],"analysis":[185],"adversarial":[187],"settings":[190],"optimizing":[192],"job":[193],"latency.":[194],"Further,":[195],"non-clairvoyant,":[199],"meaning":[200],"doesn\u2019t":[204],"need":[205,278],"know":[207],"sizes":[209],"until":[210],"their":[211],"completion.":[212],"establish":[214],"our":[215],"positive":[216,239,294],"results":[217,240,295],"making":[219],"novel":[220],"connections":[221],"with":[222,241,305,335],"Economics,":[223],"particular,":[225],"notions":[227],"market":[229],"clearing,":[230],"Gross":[231],"Substitutes,":[232],"Eisenberg-Gale":[234],"markets.":[235],"complement":[237],"these":[238],"negative":[243],"result:":[244],"objective,":[253],"any":[254],"non-clairvoyant":[255],"strong":[262],"lower":[263],"bound":[264],"on":[265],"ratio":[268],"unless":[269],"given":[270],"poly-logarithmic":[272],"speed":[273],"augmentation.":[274],"motivates":[276],"consider":[280],"sub-classes":[281],"studying":[285],"which":[291],"obtain":[293],"not":[296],"only":[297],"several":[299],"well-studied":[300],"models,":[301],"such":[302,322],"speedup":[306],"curves":[307],"related":[309],"machine":[310],"but":[312],"special":[316],"cases":[317],"hitherto":[318],"unstudied":[319],"source":[325],"routing,":[327],"routing":[328],"multicast":[329],"(video-on-demand)":[330],"trees,":[331],"allocation":[334],"substitute":[336],"resources.":[337]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}