{"id":"https://openalex.org/W2057087699","doi":"https://doi.org/10.1137/080744992","title":"Truthful Approximation Schemes for Single-Parameter Agents","display_name":"Truthful Approximation Schemes for Single-Parameter Agents","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2057087699","doi":"https://doi.org/10.1137/080744992","mag":"2057087699"},"language":"en","primary_location":{"id":"doi:10.1137/080744992","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080744992","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/A5024171603","display_name":"Peerapong Dhangwatnotai","orcid":null},"institutions":[{"id":"https://openalex.org/I4210137306","display_name":"Stanford Medicine","ror":"https://ror.org/03mtd9a03","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210137306","https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peerapong Dhangwatnotai","raw_affiliation_strings":["pdh@cs.stanford.edu and shaddin@cs.stanford.edu and tim@cs.stanford.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"pdh@cs.stanford.edu and shaddin@cs.stanford.edu and tim@cs.stanford.edu#TAB#","institution_ids":["https://openalex.org/I4210137306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020176884","display_name":"Shahar Dobzinski","orcid":"https://orcid.org/0000-0003-1935-5808"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shahar Dobzinski","raw_affiliation_strings":["shahard@cs.huji.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"shahard@cs.huji.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001275905","display_name":"Shaddin Dughmi","orcid":"https://orcid.org/0000-0002-2784-1868"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shaddin Dughmi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022886322","display_name":"Tim Roughgarden","orcid":"https://orcid.org/0000-0002-7163-8306"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tim Roughgarden","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024171603"],"corresponding_institution_ids":["https://openalex.org/I4210137306"],"apc_list":null,"apc_paid":null,"fwci":3.8079,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.92961443,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"40","issue":"3","first_page":"915","last_page":"933"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"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":1.0,"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.9984999895095825,"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.9771000146865845,"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/monotone-polygon","display_name":"Monotone polygon","score":0.8322291970252991},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.8163787722587585},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6770116090774536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6223382949829102},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5466421842575073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49000421166419983},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4858493506908417},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4802665710449219},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4743179976940155},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4692765772342682},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.44380900263786316},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.42801275849342346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4105381965637207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2501766085624695}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.8322291970252991},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.8163787722587585},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6770116090774536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6223382949829102},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5466421842575073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49000421166419983},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4858493506908417},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4802665710449219},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4743179976940155},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4692765772342682},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.44380900263786316},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.42801275849342346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4105381965637207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2501766085624695},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/080744992","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080744992","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.2545","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~tim/papers/sparam.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.2230","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.2230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.stanford.edu/%7Etim/papers/sparam.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.222.7368","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.7368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/%7Eshaddin/papers/sparam-focs08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.9232","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.9232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/%7Eshaddin/papers/sparam-sicomp.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":8,"referenced_works":["https://openalex.org/W2012634103","https://openalex.org/W2014071862","https://openalex.org/W2029050771","https://openalex.org/W2078040677","https://openalex.org/W2101216862","https://openalex.org/W2105369899","https://openalex.org/W2120100612","https://openalex.org/W2619122734"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W1815446007","https://openalex.org/W2138853983","https://openalex.org/W2028821829","https://openalex.org/W2943856120","https://openalex.org/W2138846348","https://openalex.org/W2049884448","https://openalex.org/W2886843308","https://openalex.org/W2949660560","https://openalex.org/W2558361976"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,12,19,41],"first":[3],"monotone":[4,60,67],"randomized":[5,68],"polynomial-time":[6,46],"approximation":[7,38],"scheme":[8],"(PTAS)":[9],"for":[10,44,63,70],"minimizing":[11],"makespan":[13],"of":[14],"parallel":[15],"related":[16,74],"machines":[17],"($Q||C_{\\max}$),":[18],"paradigmatic":[20],"problem":[21],"in":[22],"single-parameter":[23],"algorithmic":[24,52],"mechanism":[25,36],"design.":[26],"This":[27],"result":[28],"immediately":[29],"gives":[30],"a":[31,59,66],"polynomial-time,":[32],"truthful":[33],"(in":[34],"expectation)":[35],"whose":[37],"guarantee":[39],"attains":[40],"best-possible":[42],"one":[43],"all":[45],"algorithms":[47],"(assuming":[48],"$P\\neq":[49],"NP$).":[50],"Our":[51],"techniques":[53],"are":[54],"flexible":[55],"and":[56,65],"also":[57],"yield":[58],"deterministic":[61],"quasi-PTAS":[62],"$Q||C_{\\max}$":[64],"PTAS":[69],"max-min":[71],"scheduling":[72],"on":[73],"machines.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-02T08:42:23.175194","created_date":"2025-10-10T00:00:00"}