{"id":"https://openalex.org/W2157464222","doi":"https://doi.org/10.1145/1566374.1566399","title":"An optimal lower bound for anonymous scheduling mechanisms","display_name":"An optimal lower bound for anonymous scheduling mechanisms","publication_year":2009,"publication_date":"2009-07-06","ids":{"openalex":"https://openalex.org/W2157464222","doi":"https://doi.org/10.1145/1566374.1566399","mag":"2157464222"},"language":"en","primary_location":{"id":"doi:10.1145/1566374.1566399","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1566374.1566399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th ACM conference on Electronic commerce","raw_type":"proceedings-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/A5051446847","display_name":"Itai Ashlagi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Itai Ashlagi","raw_affiliation_strings":["Harvard, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020176884","display_name":"Shahar Dobzinski","orcid":"https://orcid.org/0000-0003-1935-5808"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shahar Dobzinski","raw_affiliation_strings":["Hebrew University, Jerusalem, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026026890","display_name":"Ron Lavi","orcid":"https://orcid.org/0000-0002-5215-5165"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ron Lavi","raw_affiliation_strings":["Technion, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.1621,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.98063737,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9998999834060669,"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.9998999834060669,"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.9972000122070312,"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/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9681000113487244,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.9080912470817566},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7816245555877686},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6487284898757935},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6187208294868469},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.563427209854126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46105682849884033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42160695791244507},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3533985912799835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.327359139919281},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13969376683235168}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.9080912470817566},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7816245555877686},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6487284898757935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6187208294868469},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.563427209854126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46105682849884033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42160695791244507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3533985912799835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.327359139919281},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13969376683235168},{"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/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1566374.1566399","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1566374.1566399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th ACM conference on Electronic commerce","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.3663","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.3663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ie.technion.ac.il/~ronlavi/papers/anonymous-short.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.601","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ie.technion.ac.il/~ronlavi/papers/anonymous.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1602132852","https://openalex.org/W1977410424","https://openalex.org/W2012634103","https://openalex.org/W2013681082","https://openalex.org/W2016245783","https://openalex.org/W2026375929","https://openalex.org/W2039634593","https://openalex.org/W2050645438","https://openalex.org/W2060824497","https://openalex.org/W2068852191","https://openalex.org/W2080463870","https://openalex.org/W2092438148","https://openalex.org/W2110882703","https://openalex.org/W2122653474","https://openalex.org/W2124580127","https://openalex.org/W2126170153","https://openalex.org/W2138853983","https://openalex.org/W2141663593","https://openalex.org/W2151792026","https://openalex.org/W2166185632","https://openalex.org/W3100963268","https://openalex.org/W3136264843"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W4300899577","https://openalex.org/W3194471551","https://openalex.org/W3204654320"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,10,66,73,85],"problem":[3],"of":[4,28,34],"designing":[5],"truthful":[6],"mechanisms":[7],"to":[8,52,81],"minimize":[9],"makespan":[11],"on":[12],"m":[13],"unrelated":[14],"machines.":[15],"In":[16],"their":[17,44],"seminal":[18],"paper,":[19],"Nisan":[20],"and":[21,30],"Ronen":[22],"[14]":[23],"showed":[24],"a":[25,38],"lower":[26,74],"bound":[27,33,46,75,88],"2,":[29],"an":[31],"upper":[32,45,87],"m,":[35],"thus":[36],"leaving":[37],"large":[39],"gap.":[40],"They":[41],"conjectured":[42],"that":[43,58],"is":[47,68],"tight,":[48],"but":[49],"were":[50],"unable":[51],"prove":[53],"it.":[54],"Despite":[55],"many":[56],"attempts":[57],"yield":[59],"positive":[60],"results":[61],"for":[62],"several":[63],"special":[64],"cases,":[65],"conjecture":[67],"far":[69],"from":[70],"being":[71],"solved:":[72],"was":[76],"only":[77],"recently":[78],"slightly":[79],"increased":[80],"2.61":[82],"[5,10],":[83],"while":[84],"best":[86],"remained":[89],"unchanged.":[90]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}