{"id":"https://openalex.org/W2169319812","doi":"https://doi.org/10.1145/1993636.1993657","title":"From convex optimization to randomized mechanisms","display_name":"From convex optimization to randomized mechanisms","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2169319812","doi":"https://doi.org/10.1145/1993636.1993657","mag":"2169319812"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993657","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993657","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001275905","display_name":"Shaddin Dughmi","orcid":"https://orcid.org/0000-0002-2784-1868"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shaddin Dughmi","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022886322","display_name":"Tim Roughgarden","orcid":"https://orcid.org/0000-0002-7163-8306"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tim Roughgarden","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000907843","display_name":"Qiqi Yan","orcid":"https://orcid.org/0000-0002-0055-3495"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qiqi Yan","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":12.6987,"has_fulltext":true,"cited_by_count":59,"citation_normalized_percentile":{"value":0.98887171,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"149","last_page":"158"},"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.9904999732971191,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9894000291824341,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9153845310211182},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8388204574584961},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.586707353591919},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5662909746170044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5522277355194092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5394670963287354},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.5211812853813171},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5171277523040771},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4701552391052246},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46637633442878723},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4564521312713623},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4542241394519806},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.43928053975105286},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.4140614867210388},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3950464427471161},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.29152876138687134}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9153845310211182},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8388204574584961},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.586707353591919},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5662909746170044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5522277355194092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5394670963287354},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.5211812853813171},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5171277523040771},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4701552391052246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46637633442878723},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4564521312713623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4542241394519806},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.43928053975105286},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.4140614867210388},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3950464427471161},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.29152876138687134},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993636.1993657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993657","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993657","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7125725937","display_name":"CAREER: Algorithmic Game Theory","funder_award_id":"0448664","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7844697471","display_name":null,"funder_award_id":"CCF-0448664","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2169319812.pdf","grobid_xml":"https://content.openalex.org/works/W2169319812.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1535203466","https://openalex.org/W1568307856","https://openalex.org/W1579522749","https://openalex.org/W1580387990","https://openalex.org/W1600999481","https://openalex.org/W1727602370","https://openalex.org/W1974169835","https://openalex.org/W1989453388","https://openalex.org/W1995275762","https://openalex.org/W2004045061","https://openalex.org/W2035337032","https://openalex.org/W2035977618","https://openalex.org/W2054039722","https://openalex.org/W2059527251","https://openalex.org/W2062830639","https://openalex.org/W2103751307","https://openalex.org/W2110383956","https://openalex.org/W2110882703","https://openalex.org/W2126307323","https://openalex.org/W2137906183","https://openalex.org/W2141502056","https://openalex.org/W2142495422","https://openalex.org/W2157316274","https://openalex.org/W2293935036","https://openalex.org/W2296319761","https://openalex.org/W2340149117","https://openalex.org/W2508573783","https://openalex.org/W2612690410","https://openalex.org/W2621717961","https://openalex.org/W2949610674","https://openalex.org/W4205960197","https://openalex.org/W4238439820"],"related_works":["https://openalex.org/W4385627918","https://openalex.org/W4252399622","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2235694368","https://openalex.org/W1550607748","https://openalex.org/W2548642347","https://openalex.org/W4300592161","https://openalex.org/W2950198148"],"abstract_inverted_index":{"We":[0],"design":[1],"an":[2,86],"expected":[3],"polynomial":[4],"time,":[5],"truthful":[6],"in":[7,14,43,91],"expectation,":[8],"(1-1/e)-approximation":[9],"mechanism":[10,79],"for":[11,61,85],"welfare":[12,88],"maximization":[13,89],"a":[15,82],"fundamental":[16],"class":[17],"of":[18,39],"combinatorial":[19,92],"auctions.":[20],"Our":[21,53],"results":[22],"apply":[23],"to":[24,80],"bidders":[25],"with":[26,94],"valuations":[27],"that":[28],"are":[29],"matroid":[30,50],"rank":[31],"sums":[32],"(MRS),":[33],"which":[34],"encompass":[35],"most":[36],"concrete":[37],"examples":[38],"submodular":[40],"functions":[41,48],"studied":[42],"this":[44],"context,":[45],"including":[46],"coverage":[47,66],"and":[49,63,77,97],"weighted-rank":[51],"functions.":[52],"approximation":[54,84],"factor":[55],"is":[56,73],"the":[57,74],"best":[58],"possible,":[59],"even":[60],"known":[62],"explicitly":[64],"given":[65],"valuations,":[67],"assuming":[68],"P":[69],"\u2260":[70],"NP.":[71],"Ours":[72],"first":[75],"truthful-in-expectation":[76],"polynomial-time":[78],"achieve":[81],"constant-factor":[83],"NP-hard":[87],"problem":[90],"auctions":[93],"heterogeneous":[95],"goods":[96],"restricted":[98],"valuations.":[99]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":16}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}