{"id":"https://openalex.org/W2152846304","doi":"https://doi.org/10.1137/090780146","title":"On the Power of Randomization in Algorithmic Mechanism Design","display_name":"On the Power of Randomization in Algorithmic Mechanism Design","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2152846304","doi":"https://doi.org/10.1137/090780146","mag":"2152846304"},"language":"en","primary_location":{"id":"doi:10.1137/090780146","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090780146","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/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":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","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":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8189,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.96876114,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"42","issue":"6","first_page":"2287","last_page":"2304"},"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/T11762","display_name":"Law, Economics, and Judicial Systems","score":0.9807999730110168,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9726999998092651,"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/common-value-auction","display_name":"Common value auction","score":0.6204556226730347},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6010985970497131},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5936087965965271},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5935945510864258},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5800809860229492},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5485383868217468},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.49272873997688293},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47358590364456177},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45225265622138977},{"id":"https://openalex.org/keywords/unit-sphere","display_name":"Unit sphere","score":0.44275227189064026},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4374639391899109},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32113391160964966}],"concepts":[{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.6204556226730347},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6010985970497131},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5936087965965271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5935945510864258},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5800809860229492},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5485383868217468},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.49272873997688293},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47358590364456177},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45225265622138977},{"id":"https://openalex.org/C191948623","wikidata":"https://www.wikidata.org/wiki/Q1307800","display_name":"Unit sphere","level":2,"score":0.44275227189064026},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4374639391899109},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32113391160964966},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090780146","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090780146","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1991223607","https://openalex.org/W2007201570","https://openalex.org/W2015007620","https://openalex.org/W2026375929","https://openalex.org/W2031502124","https://openalex.org/W2074431846","https://openalex.org/W2109342029","https://openalex.org/W2161272173","https://openalex.org/W2611688713","https://openalex.org/W4241883994","https://openalex.org/W4242388152"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W1443174385","https://openalex.org/W2732982824","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":{"In":[0,11,26],"many":[1],"settings":[2],"the":[3,22,63,68,110],"power":[4],"of":[5],"truthful":[6,41,51,72,83,105,118,138],"mechanisms":[7,76],"is":[8,40,46,90,101,137],"severely":[9],"bounded.":[10],"this":[12,19],"paper":[13],"we":[14,28,86],"use":[15],"randomization":[16],"to":[17,65,94],"overcome":[18],"problem":[20],"in":[21,42,73,97,129,139],"multi-unit":[23,37,95],"auction":[24],"setting.":[25],"particular,":[27],"construct":[29],"a":[30,91,102],"fully":[31],"polynomial-time":[32,50,75,81],"approximation":[33,56,124],"scheme":[34],"(FPTAS)":[35],"for":[36,67],"auctions":[38],"that":[39,48,71,88,107,114,136],"expectation,":[43],"whereas":[44],"there":[45,89,100],"evidence":[47],"no":[49,116],"deterministic":[52],"mechanism":[53,106,120],"provides":[54],"an":[55,123,134],"ratio":[57,125],"better":[58,126],"than":[59,80,127],"2.":[60],"We":[61],"leverage":[62],"FPTAS":[64,135],"show":[66,87],"first":[69],"time":[70,104],"expectation":[74,140],"are":[77],"provably":[78],"stronger":[79],"universally":[82,117],"mechanisms.":[84],"Specifically,":[85],"setting,":[92],"related":[93],"auctions,":[96],"which":[98],"(1)":[99],"nonpolynomial":[103],"always":[108],"outputs":[109],"optimal":[111],"solution,":[112],"and":[113],"(2)":[115],"randomized":[119],"can":[121],"provide":[122],"2":[128],"polynomial":[130],"time,":[131],"but":[132],"(3)":[133],"exists.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}