{"id":"https://openalex.org/W2946869394","doi":"https://doi.org/10.1007/s00224-019-09927-x","title":"New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines","display_name":"New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines","publication_year":2019,"publication_date":"2019-05-30","ids":{"openalex":"https://openalex.org/W2946869394","doi":"https://doi.org/10.1007/s00224-019-09927-x","mag":"2946869394"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-019-09927-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-019-09927-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-019-09927-x.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-019-09927-x.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Olga Kuryatnikova","orcid":"https://orcid.org/0000-0001-8460-7296"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Olga Kuryatnikova","raw_affiliation_strings":["Department of Econometrics and Operations Research, Tilburg University, 5037, AB, Tilburg, Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-8460-7296","affiliations":[{"raw_affiliation_string":"Department of Econometrics and Operations Research, Tilburg University, 5037, AB, Tilburg, Netherlands","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"last","author":{"id":null,"display_name":"Juan C. Vera","orcid":null},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Juan C. Vera","raw_affiliation_strings":["Department of Econometrics and Operations Research, Tilburg University, 5037, AB, Tilburg, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Econometrics and Operations Research, Tilburg University, 5037, AB, Tilburg, Netherlands","institution_ids":["https://openalex.org/I193700539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I193700539"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.4043,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63769618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"64","issue":"2","first_page":"199","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.46459999680519104,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.46459999680519104,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.18850000202655792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05079999938607216,"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/pointwise","display_name":"Pointwise","score":0.7296000123023987},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6474999785423279},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6424999833106995},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5900999903678894},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.53329998254776},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.47839999198913574},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.44780001044273376},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43849998712539673}],"concepts":[{"id":"https://openalex.org/C2777984123","wikidata":"https://www.wikidata.org/wiki/Q9248237","display_name":"Pointwise","level":2,"score":0.7296000123023987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6531000137329102},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6474999785423279},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6424999833106995},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5900999903678894},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.53329998254776},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.47839999198913574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46869999170303345},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45489999651908875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45410001277923584},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4138000011444092},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4050999879837036},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.319599986076355},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2671000063419342},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00224-019-09927-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-019-09927-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-019-09927-x.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/a2c42642-3b9f-4144-8462-a985a64aba06","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/a2c42642-3b9f-4144-8462-a985a64aba06","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kuryatnikova, O & Vera, J C 2020, 'New bounds for truthful scheduling on two unrelated selfish machines', Theory of Computing Systems, vol. 64, no. 2, pp. 199-226. https://doi.org/10.1007/s00224-019-09927-x","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1711.04796","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.04796","pdf_url":"https://arxiv.org/pdf/1711.04796","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"doi:10.1007/s00224-019-09927-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-019-09927-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-019-09927-x.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2946869394.pdf","grobid_xml":"https://content.openalex.org/works/W2946869394.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1569941979","https://openalex.org/W1602132852","https://openalex.org/W1896701397","https://openalex.org/W1965094948","https://openalex.org/W1965349277","https://openalex.org/W2012634103","https://openalex.org/W2015654884","https://openalex.org/W2026375929","https://openalex.org/W2043979816","https://openalex.org/W2050645438","https://openalex.org/W2052586468","https://openalex.org/W2055993677","https://openalex.org/W2064284967","https://openalex.org/W2069808690","https://openalex.org/W2096141465","https://openalex.org/W2102201348","https://openalex.org/W2144946856","https://openalex.org/W2511680749","https://openalex.org/W2621304102","https://openalex.org/W2963763088","https://openalex.org/W3136264843","https://openalex.org/W4231916799"],"related_works":[],"abstract_inverted_index":{"We":[0,42],"consider":[1],"the":[2,19,31,73,86,103],"minimum":[3],"makespan":[4],"problem":[5],"for":[6,36,54,109,120],"n":[7,17,48,56,67,108,111,121],"tasks":[8],"and":[9,62],"two":[10,40],"unrelated":[11],"parallel":[12],"selfish":[13],"machines.":[14,41],"Let":[15],"R":[16,55,66,107,127],"be":[18],"best":[20],"approximation":[21],"ratio":[22],"of":[23,80],"randomized":[24,91],"monotone":[25],"scale-free":[26],"algorithms.":[27],"This":[28],"class":[29],"contains":[30],"most":[32],"efficient":[33],"algorithms":[34,92],"known":[35],"truthful":[37],"scheduling":[38],"on":[39,65,69,106],"propose":[43],"a":[44,51],"new":[45],"M":[46,50],"i":[47],"\u2212":[49,129,133],"x":[52],"formulation":[53],",":[57],"as":[58,60],"well":[59],"upper":[61,87],"lower":[63,74],"bounds":[64,105,119],"based":[68],"this":[70],"formulation.":[71],"For":[72,85],"bound,":[75,88],"we":[76,89,115],"exploit":[77],"pointwise":[78],"approximations":[79],"cumulative":[81],"distribution":[82],"functions":[83],"(CDFs).":[84],"construct":[90],"using":[93],"distributions":[94],"with":[95],"piecewise":[96],"rational":[97],"CDFs.":[98],"Our":[99],"method":[100],"improves":[101],"upon":[102],"existing":[104],"small":[110],".":[112,135],"In":[113],"particular,":[114],"obtain":[116],"almost":[117],"tight":[118],"=":[122],"2":[123,128],"showing":[124],"that":[125],"|":[126],"1.505996|":[130],"<":[131],"10":[132],"6":[134]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2019-06-07T00:00:00"}