{"id":"https://openalex.org/W2151792026","doi":"https://doi.org/10.1145/1721837.1721854","title":"Mechanism design for fractional scheduling on unrelated machines","display_name":"Mechanism design for fractional scheduling on unrelated machines","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2151792026","doi":"https://doi.org/10.1145/1721837.1721854","mag":"2151792026"},"language":"en","primary_location":{"id":"doi:10.1145/1721837.1721854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721854","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-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/A5054751334","display_name":"George Christodoulou","orcid":"https://orcid.org/0000-0002-9623-7461"},"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":true,"raw_author_name":"George Christodoulou","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085074451","display_name":"\u0397\u03bb\u03af\u03b1\u03c2 \u039a\u03bf\u03c5\u03c4\u03c3\u03bf\u03c5\u03c0\u03b9\u03ac\u03c2","orcid":"https://orcid.org/0000-0002-2226-6737"},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Elias Koutsoupias","raw_affiliation_strings":["University of Athens, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"University of Athens, Athens, Greece","institution_ids":["https://openalex.org/I200777214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103164764","display_name":"Annam\u00e1ria Kov\u00e1cs","orcid":"https://orcid.org/0009-0008-2990-988X"},"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":"Annam\u00e1ria Kov\u00e1cs","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054751334"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":2.8332,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.91157973,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"2","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9994999766349792,"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/T11182","display_name":"Auction Theory and Applications","score":0.9994999766349792,"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.9990000128746033,"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.9914000034332275,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.5913400053977966},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5897842049598694},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5708231925964355},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.528035044670105},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.52439945936203},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4942913055419922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4815573990345001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4772327244281769},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47184398770332336},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46816039085388184},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4295247197151184},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3568471074104309},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3436806797981262},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.164220929145813}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5913400053977966},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5897842049598694},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5708231925964355},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.528035044670105},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.52439945936203},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4942913055419922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4815573990345001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4772327244281769},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47184398770332336},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46816039085388184},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4295247197151184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3568471074104309},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3436806797981262},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.164220929145813},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1721837.1721854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721854","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:edoc.mpg.de:536714","is_oa":false,"landing_page_url":"http://edoc.mpg.de/536714","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":"ACM Transactions on Algorithms, v.6, 38:1-38:18 (2010)","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7200000286102295,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G8629363537","display_name":null,"funder_award_id":"IST-2005-15964 (AEOLUS)IST-2008-215270 (FRONTS)","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W5206641","https://openalex.org/W1547839538","https://openalex.org/W1560295210","https://openalex.org/W1602132852","https://openalex.org/W1611992317","https://openalex.org/W1692163646","https://openalex.org/W1824396341","https://openalex.org/W1977410424","https://openalex.org/W1982492546","https://openalex.org/W2012634103","https://openalex.org/W2016245783","https://openalex.org/W2029050771","https://openalex.org/W2039634593","https://openalex.org/W2050645438","https://openalex.org/W2062373125","https://openalex.org/W2065980363","https://openalex.org/W2073067148","https://openalex.org/W2087770658","https://openalex.org/W2102201348","https://openalex.org/W2103751307","https://openalex.org/W2110882703","https://openalex.org/W2126085282","https://openalex.org/W2126170153","https://openalex.org/W2131449352","https://openalex.org/W2141663593","https://openalex.org/W2147854705","https://openalex.org/W2788394731","https://openalex.org/W3122612977","https://openalex.org/W4255005259","https://openalex.org/W4389615663","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W2174440985","https://openalex.org/W4299992882","https://openalex.org/W2949506010","https://openalex.org/W2112526268","https://openalex.org/W2593080689","https://openalex.org/W1991979416","https://openalex.org/W4388968519","https://openalex.org/W2005018956","https://openalex.org/W4293997817","https://openalex.org/W2244037217"],"abstract_inverted_index":{"Scheduling":[0],"on":[1,125,182],"unrelated":[2],"machines":[3],"is":[4,20,27,35,119,220],"one":[5],"of":[6,13,23,50,69,73,129,136,155,186,197,230],"the":[7,14,21,24,31,51,65,70,95,99,115,120,126,133,160,164,171,178,189,221],"most":[8],"general":[9],"and":[10,34,42,58,144,167],"classical":[11],"variants":[12],"task":[15,175],"scheduling":[16,19,52],"problem.":[17,75],"Fractional":[18],"LP-relaxation":[22],"problem,":[25,131],"which":[26],"polynomially":[28],"solvable":[29],"in":[30],"nonstrategic":[32],"setting,":[33],"a":[36,104,194],"useful":[37],"tool":[38],"to":[39],"design":[40,48,67],"deterministic":[41,166],"randomized":[43,168],"approximation":[44,109,127,153],"algorithms.":[45,191,231],"The":[46],"mechanism":[47,66,93,106,150,219],"version":[49,68],"problem":[53,172],"was":[54],"introduced":[55],"by":[56,142,159],"Nisan":[57,143],"Ronen.":[59,145],"In":[60,98],"this":[61,74,130,214,228],"article,":[62],"we":[63,102,180,224],"consider":[64],"fractional":[71,82],"variant":[72],"We":[76,192],"give":[77,193],"lower":[78,86,116,195],"bounds":[79,87],"for":[80,90,94,111,138,170,202],"any":[81,91],"truthful":[83,105,217],"mechanism.":[84],"Our":[85],"also":[88],"hold":[89],"(randomized)":[92],"integral":[96],"case.":[97],"positive":[100],"direction,":[101],"propose":[103],"that":[107,162,200,209,223],"achieves":[108,151],"3/2":[110],"2":[112,139],"machines,":[113,140,148],"matching":[114],"bound.":[117],"This":[118],"first":[121],"new":[122],"tight":[123,134],"bound":[124,135,196],"ratio":[128,154],"after":[132],"2,":[137],"obtained":[141],"For":[146],"n":[147,156,198],"our":[149,216],"an":[152,183],"+1/2.":[157],"Motivated":[158],"fact":[161],"all":[163],"known":[165],"mechanisms":[169],"assign":[173],"each":[174],"independently":[176],"from":[177,227],"others,":[179],"focus":[181],"interesting":[184],"subclass":[185],"allocation":[187,207],"algorithms,":[188],"task-independent":[190],"+1/2,":[199],"holds":[201],"every":[203],"(not":[204],"only":[205],"monotone)":[206],"algorithm":[208],"takes":[210],"independent":[211,218],"decisions.":[212],"Under":[213],"consideration,":[215],"best":[222],"can":[225],"hope":[226],"family":[229]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-14T08:43:22.919905","created_date":"2025-10-10T00:00:00"}