{"id":"https://openalex.org/W2139692878","doi":"https://doi.org/10.1137/110843654","title":"Black-Box Randomized Reductions in Algorithmic Mechanism Design","display_name":"Black-Box Randomized Reductions in Algorithmic Mechanism Design","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2139692878","doi":"https://doi.org/10.1137/110843654","mag":"2139692878"},"language":"en","primary_location":{"id":"doi:10.1137/110843654","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110843654","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/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":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4621,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.95706218,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"43","issue":"1","first_page":"312","last_page":"336"},"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.9955999851226807,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6130481362342834},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5942134857177734},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5760683417320251},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.5630459785461426},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.54837965965271},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5043421983718872},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4852156937122345},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.47757628560066223},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4671598970890045},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4590122103691101},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44834938645362854},{"id":"https://openalex.org/keywords/black-box","display_name":"Black box","score":0.43488311767578125},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.43007534742355347},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4246121346950531},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4238913953304291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34028202295303345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3129141330718994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3042546510696411},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.11221423745155334}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6130481362342834},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5942134857177734},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5760683417320251},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.5630459785461426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.54837965965271},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5043421983718872},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4852156937122345},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.47757628560066223},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4671598970890045},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4590122103691101},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44834938645362854},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.43488311767578125},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.43007534742355347},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4246121346950531},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4238913953304291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34028202295303345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3129141330718994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3042546510696411},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.11221423745155334},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110843654","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110843654","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/16","display_name":"Peace, Justice and strong institutions","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1977980414","https://openalex.org/W2012634103","https://openalex.org/W2034053794","https://openalex.org/W2034112563","https://openalex.org/W2130626677","https://openalex.org/W2142270691","https://openalex.org/W2147799577","https://openalex.org/W2157952725","https://openalex.org/W2611688713","https://openalex.org/W2621304102","https://openalex.org/W3022308742"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W2949605113","https://openalex.org/W1515923199","https://openalex.org/W2770794232","https://openalex.org/W2161611531","https://openalex.org/W2042292124","https://openalex.org/W2683098551","https://openalex.org/W2557632260","https://openalex.org/W349093217","https://openalex.org/W4225962439"],"abstract_inverted_index":{"We":[0,72],"give":[1],"the":[2,80,95,102,107],"first":[3],"black-box":[4],"reduction":[5,54],"from":[6],"approximation":[7,11,32],"algorithms":[8],"to":[9,100],"truthful":[10],"mechanisms":[12],"for":[13,111],"a":[14,29,40,45,66,74],"non-trivial":[15],"class":[16],"of":[17,58,79,83,88],"multi-parameter":[18],"problems.":[19],"Specifically,":[20],"we":[21,93],"prove":[22,101],"that":[23,27,49],"every":[24],"welfare-maximization":[25],"problem":[26,42,86],"admits":[28,44],"fully":[30],"polynomial-time":[31],"scheme":[33],"(FPTAS)":[34],"and":[35,87,92,97,106],"can":[36],"be":[37],"encoded":[38],"as":[39,65],"packing":[41],"also":[43],"truthful-in-expectation":[46],"randomized":[47],"mechanism":[48,70],"is":[50],"an":[51,84],"FPTAS.":[52],"Our":[53],"makes":[55],"novel":[56],"use":[57,94],"smoothed":[59],"analysis":[60],"by":[61],"employing":[62],"small":[63],"perturbations":[64,78],"tool":[67],"in":[68],"algorithmic":[69],"design.":[71],"develop":[73],"\u201cduality\u201d":[75],"between":[76],"linear":[77],"objective":[81],"function":[82],"optimization":[85],"its":[89],"feasible":[90],"set,":[91],"\u201cprimal\u201d":[96],"\u201cdual\u201d":[98],"viewpoints":[99],"running":[103],"time":[104],"bound":[105],"truthfulness":[108],"guarantee,":[109],"respectively,":[110],"our":[112],"mechanism.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}