{"id":"https://openalex.org/W2081331628","doi":"https://doi.org/10.1137/100801597","title":"Envy-Free Makespan Approximation","display_name":"Envy-Free Makespan Approximation","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2081331628","doi":"https://doi.org/10.1137/100801597","mag":"2081331628"},"language":"en","primary_location":{"id":"doi:10.1137/100801597","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100801597","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5026385549","display_name":"Edith Cohen","orcid":"https://orcid.org/0000-0002-3926-8237"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Edith Cohen","raw_affiliation_strings":["edith@research.att.com#TAB#"],"affiliations":[{"raw_affiliation_string":"edith@research.att.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103282352","display_name":"Michal Feldman","orcid":"https://orcid.org/0000-0002-2915-8405"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michal Feldman","raw_affiliation_strings":["michal.feldman@huji.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"michal.feldman@huji.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038118929","display_name":"Amos Fiat","orcid":"https://orcid.org/0000-0002-5748-9519"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amos Fiat","raw_affiliation_strings":["fiat@tau.ac.il and haimk@tau.ac.il and svetlana.olonetsky@gmail.com#TAB#"],"affiliations":[{"raw_affiliation_string":"fiat@tau.ac.il and haimk@tau.ac.il and svetlana.olonetsky@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":["Tel-Aviv  University"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv  University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048854126","display_name":"Svetlana Olonetsky","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Svetlana Olonetsky","raw_affiliation_strings":["Tel-Aviv  University"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv  University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5026385549"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5995,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84928696,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"41","issue":"1","first_page":"12","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9995999932289124,"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.9995999932289124,"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.9987999796867371,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8109254240989685},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7028968334197998},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5147035717964172},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5108017921447754},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48734697699546814},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4573177695274353},{"id":"https://openalex.org/keywords/mechanism","display_name":"Mechanism (biology)","score":0.4570617079734802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45429176092147827},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43127259612083435},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4285932779312134},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4245927929878235},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.397177129983902},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35520613193511963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3387554883956909},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10488587617874146},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.09208118915557861},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.08004122972488403}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8109254240989685},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7028968334197998},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5147035717964172},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5108017921447754},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48734697699546814},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4573177695274353},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.4570617079734802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45429176092147827},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43127259612083435},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4285932779312134},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4245927929878235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.397177129983902},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35520613193511963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3387554883956909},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10488587617874146},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.09208118915557861},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.08004122972488403},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100801597","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100801597","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.46000000834465027,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W154126010","https://openalex.org/W1488422606","https://openalex.org/W1560295210","https://openalex.org/W1577069963","https://openalex.org/W1577532981","https://openalex.org/W1600130330","https://openalex.org/W1602132852","https://openalex.org/W1975378045","https://openalex.org/W1977410424","https://openalex.org/W2010916800","https://openalex.org/W2010996873","https://openalex.org/W2016199854","https://openalex.org/W2022749618","https://openalex.org/W2029467699","https://openalex.org/W2039634593","https://openalex.org/W2069134712","https://openalex.org/W2093412843","https://openalex.org/W2102201348","https://openalex.org/W2120419132","https://openalex.org/W2134776949","https://openalex.org/W2141663593","https://openalex.org/W2157464222","https://openalex.org/W2164993792","https://openalex.org/W2166185632","https://openalex.org/W2222512263","https://openalex.org/W3003535784","https://openalex.org/W3011924088","https://openalex.org/W3144138375","https://openalex.org/W4256264166"],"related_works":["https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2107423006","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075"],"abstract_inverted_index":{"We":[0],"study":[1],"envy-free":[2,49,82,104,161,174],"mechanisms":[3],"for":[4,173],"assigning":[5],"tasks":[6,32],"to":[7,19,28,57],"agents,":[8],"where":[9,64],"every":[10],"task":[11],"may":[12],"take":[13],"a":[14,59,86,146,181],"different":[15],"amount":[16],"of":[17,61,69,100,108,143,149],"time":[18],"perform":[20],"by":[21],"each":[22],"agent,":[23],"and":[24,119,138,145],"the":[25,31,40,54,67,97,109,136],"goal":[26],"is":[27,66,73],"get":[29],"all":[30],"done":[33],"as":[34,36,76,180],"soon":[35],"possible":[37],"(i.e.,":[38],"minimize":[39],"makespan).":[41],"For":[42,151],"indivisible":[43],"tasks,":[44,153],"we":[45,77,154,168],"put":[46],"forward":[47],"an":[48,140,160],"polynomial":[50],"mechanism":[51,83,163,172],"that":[52,80,156],"approximates":[53],"minimal":[55],"makespan":[56,175],"within":[58],"factor":[60],"$O(\\log":[62],"m)$,":[63],"m":[65,91],"number":[68],"machines.":[70],"This":[71,95],"bound":[72,88,142,148],"almost":[74],"tight,":[75],"also":[78],"show":[79,155],"no":[81],"can":[84,177],"achieve":[85],"better":[87],"than":[89],"$\\Omega(\\log":[90],"/":[92],"\\log\\log":[93],"m)$.":[94],"improves":[96],"recent":[98],"result":[99],"Mu'alem":[101],"[On":[102],"multi-dimensional":[103],"mechanisms,":[105],"in":[106,125],"Proceedings":[107],"First":[110],"International":[111],"Conference":[112],"on":[113],"Algorithmic":[114],"Decision":[115],"Theory,":[116],"F.":[117],"Rossi":[118],"A.":[120],"Tsoukias,":[121],"eds.,":[122],"Lecture":[123],"Notes":[124],"Comput.":[126],"Sci.":[127],"5783,":[128],"Springer,":[129],"Berlin,":[130],"2009,":[131],"pp.":[132],"120\u2013131]":[133],"who":[134],"introduced":[135],"model":[137],"gave":[139],"upper":[141],"$(m+1)/2$":[144],"lower":[147],"$2-1/m$.":[150],"divisible":[152],"there":[157],"always":[158],"exists":[159],"poly-time":[162],"with":[164],"optimal":[165],"makespan.":[166],"Finally,":[167],"demonstrate":[169],"how":[170],"our":[171],"minimization":[176],"be":[178],"interpreted":[179],"market":[182],"clearing":[183],"problem.":[184]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}