{"id":"https://openalex.org/W1590648809","doi":"https://doi.org/10.1109/sfcs.2003.1238219","title":"Average case and smoothed competitive analysis of the multi-level feedback algorithm","display_name":"Average case and smoothed competitive analysis of the multi-level feedback algorithm","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W1590648809","doi":"https://doi.org/10.1109/sfcs.2003.1238219","mag":"1590648809"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cris.maastrichtuniversity.nl/en/publications/2b0cec5f-5cf8-40fd-90a1-af4b85f24bcd","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039929633","display_name":"Luca Becchetti","orcid":"https://orcid.org/0000-0002-4941-0532"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"L. Becchetti","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020876546","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-4570-2255"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"S. Leonardi","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064823807","display_name":"Alberto Marchetti-Spaccamela","orcid":"https://orcid.org/0000-0002-7991-4416"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Marchetti-Spaccamela","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067080233","display_name":"Guido Sch\u00e4fer","orcid":"https://orcid.org/0000-0002-1923-4902"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G. Schafer","raw_affiliation_strings":["Max Planck Institut f\u00fcr Informatik, Saarbrucken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institut f\u00fcr Informatik, Saarbrucken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034888963","display_name":"Tjark Vredeveld","orcid":"https://orcid.org/0000-0002-6357-8622"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"T. Vredeveld","raw_affiliation_strings":["Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5039929633"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.2523,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.63976335,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"1","first_page":"462","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9839000105857849,"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.9839000105857849,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.007499999832361937,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0012000000569969416,"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/algorithm","display_name":"Algorithm","score":0.5791275501251221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5556045174598694},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3478180766105652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3211345672607422}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5791275501251221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5556045174598694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3478180766105652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3211345672607422}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1109/sfcs.2003.1238219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"doi:10.1287/moor.1050.0170","is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.1050.0170","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/2b0cec5f-5cf8-40fd-90a1-af4b85f24bcd","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/2b0cec5f-5cf8-40fd-90a1-af4b85f24bcd","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Becchetti, L, Leonardi, S, Marchetti-Spaccamela, A, Schaefer, G & Vredeveld, T 2006, 'Average case and smoothed competitive analysis for the multi-level feedback algorithm', Mathematics of Operations Research, vol. 31, no. 1, pp. 85-108. https://doi.org/10.1287/moor.1050.0170","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.7513","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cwi.nl/~schaefer/ftp/pdf/mlf-mor.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:inm:ormoor:v:31:y:2006:i:1:p:85-108","is_oa":false,"landing_page_url":"http://doi.org/10.1287/moor.1050.0170","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:75","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.7","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:edoc.mpg.de:201811","is_oa":false,"landing_page_url":"http://edoc.mpg.de/201811","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"44th Annual Symposium on Foundations of Computer Science (FOCS-03), IEEE, 462-471 (2003)","raw_type":"Conference-Paper"},{"id":"pmh:oai:iris.uniroma1.it:11573/235526","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/235526","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/253028","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/253028","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_1329991","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-2C5C-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"44th Annual Symposium on Foundations of Computer Science (FOCS-03)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.4230/dagsemproc.05031.7","is_oa":true,"landing_page_url":"https://doi.org/10.4230/dagsemproc.05031.7","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2163000641","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/dagstuhl/P5031.html#BecchettiLMSV05","pdf_url":null,"source":{"id":"https://openalex.org/S4306418148","display_name":"Dagstuhl Seminar Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Dagstuhl Seminar Proceedings","raw_type":null}],"best_oa_location":{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/2b0cec5f-5cf8-40fd-90a1-af4b85f24bcd","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/2b0cec5f-5cf8-40fd-90a1-af4b85f24bcd","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Becchetti, L, Leonardi, S, Marchetti-Spaccamela, A, Schaefer, G & Vredeveld, T 2006, 'Average case and smoothed competitive analysis for the multi-level feedback algorithm', Mathematics of Operations Research, vol. 31, no. 1, pp. 85-108. https://doi.org/10.1287/moor.1050.0170","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W63574446","https://openalex.org/W193706516","https://openalex.org/W1928413254","https://openalex.org/W1958713532","https://openalex.org/W1972868674","https://openalex.org/W2007568515","https://openalex.org/W2028301248","https://openalex.org/W2034053794","https://openalex.org/W2041645394","https://openalex.org/W2047150311","https://openalex.org/W2060640049","https://openalex.org/W2074756264","https://openalex.org/W2085817874","https://openalex.org/W2118625817","https://openalex.org/W2124718325","https://openalex.org/W2129497745","https://openalex.org/W2159472851","https://openalex.org/W2170078634","https://openalex.org/W2496163386","https://openalex.org/W2912168264","https://openalex.org/W3197565351","https://openalex.org/W4231916799","https://openalex.org/W4388297583","https://openalex.org/W6631322009","https://openalex.org/W6635112641","https://openalex.org/W6684090272"],"related_works":["https://openalex.org/W1595179297","https://openalex.org/W1589318512","https://openalex.org/W1518377826","https://openalex.org/W1541284960","https://openalex.org/W121706511","https://openalex.org/W1578498606","https://openalex.org/W2113984204","https://openalex.org/W99907465","https://openalex.org/W1553361062","https://openalex.org/W1504376516","https://openalex.org/W257498013","https://openalex.org/W181304631","https://openalex.org/W1527690370","https://openalex.org/W2135568066","https://openalex.org/W1505057137","https://openalex.org/W1535886787","https://openalex.org/W323596253","https://openalex.org/W2138098891","https://openalex.org/W58501064","https://openalex.org/W944776487"],"abstract_inverted_index":{"In":[0,156],"this":[1,49],"paper,":[2],"we":[3,158,205],"introduce":[4],"the":[5,26,53,60,73,93,105,113,150,154,195,223,237,244,250],"notion":[6,50],"of":[7,11,28,45,67,76,84,123,135,153,163,211,218,228,236,241],"smoothed":[8,132],"competitive":[9,133,161],"analysis":[10,15,43,227],"online":[12],"algorithms.":[13],"Smoothed":[14],"has":[16],"been":[17],"proposed":[18],"by":[19,111],"Spielman":[20],"and":[21],"Teng":[22],"(2001)":[23],"to":[24,51,58,194,243],"explain":[25],"behavior":[27],"algorithms":[29],"that":[30,128,186],"work":[31],"well":[32],"in":[33,92],"practice":[34],"while":[35],"performing":[36],"very":[37],"poorly":[38],"from":[39],"a":[40,65,77,99,119,131,160,207,232],"worst":[41],"case":[42,226],"point":[44],"view.":[46],"We":[47,97,126,173,230],"apply":[48],"analyze":[52],"Multi-Level":[54],"Feedback":[55],"(MLF)":[56],"algorithm":[57,185],"minimize":[59],"total":[61,238],"flow":[62,239],"time":[63,71,75,83,240],"on":[64,189],"sequence":[66],"jobs":[68],"released":[69],"over":[70],"when":[72],"processing":[74,88,107,190],"job":[78],"is":[79,187,221],"only":[80],"known":[81],"at":[82],"completion.":[85],"The":[86],"initial":[87,106],"times":[89,108,191],"are":[90,109],"integers":[91],"range":[94],"[1,2/sup":[95],"K/]":[96],"use":[98],"partial":[100,196],"bit":[101,197],"randomization":[102,198],"model,":[103],"where":[104,146],"smoothened":[110,192],"changing":[112],"k":[114],"least":[115],"significant":[116],"bits":[117],"under":[118,246],"quite":[120],"general":[121],"class":[122],"probability":[124],"distributions.":[125],"show":[127,231],"MLF":[129,242],"admits":[130],"ratio":[134,162,235],"O((2/sup":[136],"k///spl":[137,142],"sigma/)/sup":[138,143],"3/":[139],"+":[140],"(2/sup":[141],"2/2/sup":[144],"K-k/),":[145],"/spl":[147,167,170,177,212],"sigma/":[148,168],"denotes":[149],"standard":[151],"deviation":[152],"distribution.":[155,252],"particular,":[157],"obtain":[159],"O(2/sup":[164],"K-k/)":[165,179],"if":[166],"=":[169],"Theta/(2/sup":[171],"k/).":[172],"also":[174,222],"prove":[175],"an":[176],"Omega/(2/sup":[178,213],"lower":[180,209],"bound":[181,210],"for":[182],"any":[183],"deterministic":[184],"run":[188],"according":[193],"model.":[199],"For":[200],"various":[201],"other":[202],"smoothening":[203],"models,":[204],"give":[206],"higher":[208],"K/).":[214],"A":[215],"direct":[216],"consequence":[217],"our":[219],"result":[220],"first":[224],"average":[225],"MLF.":[229],"constant":[233],"expected":[234],"optimum":[245],"several":[247],"distributions":[248],"including":[249],"uniform":[251]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}