{"id":"https://openalex.org/W4403324443","doi":"https://doi.org/10.1007/s00453-024-01277-6","title":"On Scheduling Mechanisms Beyond the Worst Case","display_name":"On Scheduling Mechanisms Beyond the Worst Case","publication_year":2024,"publication_date":"2024-10-12","ids":{"openalex":"https://openalex.org/W4403324443","doi":"https://doi.org/10.1007/s00453-024-01277-6"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-024-01277-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-024-01277-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01277-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01277-6.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101863680","display_name":"Yansong Gao","orcid":"https://orcid.org/0000-0001-5783-2172"},"institutions":[{"id":"https://openalex.org/I4210131439","display_name":"Applied Mathematics (United States)","ror":"https://ror.org/03seew607","country_code":"US","type":"company","lineage":["https://openalex.org/I4210131439"]},{"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yansong Gao","raw_affiliation_strings":["Applied Mathematics and Computational Science, University of Pennsylvania, Philadelphia, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Applied Mathematics and Computational Science, University of Pennsylvania, Philadelphia, USA","institution_ids":["https://openalex.org/I4210131439","https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100436760","display_name":"Jie Zhang","orcid":"https://orcid.org/0000-0002-5348-7671"},"institutions":[{"id":"https://openalex.org/I51601045","display_name":"University of Bath","ror":"https://ror.org/002h8g185","country_code":"GB","type":"education","lineage":["https://openalex.org/I51601045"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jie Zhang","raw_affiliation_strings":["Department of Computer Science, University of Bath, Bath, UK"],"raw_orcid":"https://orcid.org/0000-0002-5348-7671","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bath, Bath, UK","institution_ids":["https://openalex.org/I51601045"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100436760"],"corresponding_institution_ids":["https://openalex.org/I51601045"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24397116,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":"1","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9980999827384949,"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.9959999918937683,"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/theory-of-computation","display_name":"Theory of computation","score":0.6225594878196716},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5971071720123291},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5428036451339722},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3703256845474243},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3365337550640106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3046027719974518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24892732501029968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2291381061077118}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6225594878196716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5971071720123291},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5428036451339722},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3703256845474243},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3365337550640106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3046027719974518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24892732501029968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2291381061077118}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-024-01277-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-024-01277-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01277-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-024-01277-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-024-01277-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01277-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G474133951","display_name":"Logistics Optimisation After Brexit and COVID-19","funder_award_id":"EP/W014912/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7940806729","display_name":null,"funder_award_id":"EP/W014912/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403324443.pdf","grobid_xml":"https://content.openalex.org/works/W4403324443.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1507254144","https://openalex.org/W1602132852","https://openalex.org/W1965047789","https://openalex.org/W1974149536","https://openalex.org/W1990326103","https://openalex.org/W2034780413","https://openalex.org/W2039634593","https://openalex.org/W2057464142","https://openalex.org/W2060824497","https://openalex.org/W2068852191","https://openalex.org/W2108957189","https://openalex.org/W2126170153","https://openalex.org/W2172987439","https://openalex.org/W2193188783","https://openalex.org/W2295575944","https://openalex.org/W2402812131","https://openalex.org/W2508573783","https://openalex.org/W2914365816","https://openalex.org/W2962986620","https://openalex.org/W2965869284","https://openalex.org/W3023615263","https://openalex.org/W3089866064","https://openalex.org/W3147919432","https://openalex.org/W4214910961","https://openalex.org/W4252723988","https://openalex.org/W4280632634","https://openalex.org/W4376639603"],"related_works":["https://openalex.org/W2064563243","https://openalex.org/W4250775169","https://openalex.org/W4309231192","https://openalex.org/W3165104833","https://openalex.org/W2115140794","https://openalex.org/W2041120224","https://openalex.org/W2595158997","https://openalex.org/W1504320321","https://openalex.org/W2067902980","https://openalex.org/W2548529098"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"problem":[2,46],"of":[3,13,26,35,112,179,247,270,321],"scheduling":[4,190],"unrelated":[5],"machines":[6,54],"has":[7],"been":[8],"studied":[9],"since":[10],"the":[11,27,79,90,163,193,243,256,275,290,310,317,326],"inception":[12],"algorithmic":[14],"mechanism":[15,21,136,158,180,200,208,215,221,248,264,322],"design":[16],"(Nisan":[17],"and":[18,104,125,233],"Ronen,":[19],"Algorithmic":[20],"design(extended":[22],"abstract).":[23],"In:":[24],"Proceedings":[25],"Thirty":[28],"First":[29],"Annual":[30],"ACM":[31],"Symposium":[32],"on":[33,182,210,274,289],"Theory":[34],"Computing":[36],"(STOC),":[37],"pp.":[38],"129\u2013140,":[39],"1999.":[40],"It":[41],"is":[42,84,160,217,261],"a":[43,167,176,203,237,252,267,285,299],"resource":[44],"allocation":[45],"that":[47,107,199,242,294,316],"entails":[48],"assigning":[49],"m":[50],"tasks":[51],"to":[52,72,88,175,251,325],"n":[53,126],"for":[55,128,224,263],"execution.":[56],"Machines":[57],"are":[58,231],"regarded":[59],"as":[60,71],"strategic":[61],"agents":[62],"who":[63],"may":[64],"lie":[65],"about":[66],"their":[67,74],"execution":[68,229],"costs":[69,230],"so":[70],"minimize":[73],"time":[75],"cost.":[76],"To":[77],"address":[78],"situation":[80],"when":[81,227],"monetary":[82],"payment":[83],"not":[85],"an":[86,109,139],"option":[87],"compensate":[89],"machines\u2019":[91,228],"costs,":[92],"Koutsoupias":[93],"(Theory":[94],"Comput":[95],"Syst":[96],"54:375\u2013387,":[97],"2014)":[98],"devised":[99],"two":[100,189],"truthful":[101,135],"mechanisms,":[102],"K":[103,159,201,216,249],"P":[105,209,323],"respectively,":[106],"achieves":[108,202],"approximation":[110,140,164,245,319],"ratio":[111,141,165,246,320],"$$\\frac{n+1}{2}$$":[113,144],"<mml:math":[114,145],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[115,146],"<mml:mfrac>":[116,147],"<mml:mrow>":[117,148],"<mml:mi>n</mml:mi>":[118,149],"<mml:mo>+</mml:mo>":[119,150],"<mml:mn>1</mml:mn>":[120,151],"</mml:mrow>":[121,152],"<mml:mn>2</mml:mn>":[122,153],"</mml:mfrac>":[123,154],"</mml:math>":[124,155],",":[127],"social":[129,205],"cost":[130,206],"minimization.":[131],"In":[132],"addition,":[133],"no":[134],"can":[137],"achieve":[138],"better":[142,219,268],"than":[143,207,220],".":[156],"Hence,":[157],"optimal.":[161],"While":[162],"provides":[166],"strong":[168],"worst-case":[169],"guarantee,":[170],"it":[171],"also":[172],"limits":[173],"us":[174],"comprehensive":[177],"understanding":[178,269],"performance":[181],"various":[183],"inputs.":[184],"This":[185,259],"paper":[186],"investigates":[187],"these":[188],"mechanisms":[191],"beyond":[192],"worst":[194],"case.":[195],"We":[196],"first":[197],"show":[198,241,293],"smaller":[204],"every":[211],"input.":[212],"That":[213],"is,":[214],"pointwise":[218],"P.":[222],"Next,":[223],"each":[225],"task,":[226],"independent":[232],"identically":[234],"drawn":[235],"from":[236],"task-specific":[238,257],"distribution,":[239],"we":[240,278,292,314],"average-case":[244,318],"converges":[250,324],"constant":[253],"determined":[254],"by":[255,282],"distribution.":[258],"bound":[260,297,301],"tight":[262],"K.":[265],"For":[266],"this":[271,295],"distribution-dependent":[272],"constant,":[273],"one":[276],"hand,":[277],"estimate":[279],"its":[280],"value":[281],"plugging":[283],"in":[284,303],"few":[286],"common":[287],"distributions;":[288],"other,":[291],"converging":[296],"improves":[298],"known":[300],"(Zhang":[302],"Algorithmica":[304],"83(6):1638\u20131652,":[305],"2021))":[306],"which":[307],"only":[308],"captures":[309],"single-task":[311],"setting.":[312],"Last,":[313],"find":[315],"same":[327],"constant.":[328]},"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}