{"id":"https://openalex.org/W2521447776","doi":"https://doi.org/10.1145/2908735","title":"Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding","display_name":"Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding","publication_year":2016,"publication_date":"2016-09-21","ids":{"openalex":"https://openalex.org/W2521447776","doi":"https://doi.org/10.1145/2908735","mag":"2521447776"},"language":"en","primary_location":{"id":"doi:10.1145/2908735","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908735","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]},{"id":"https://openalex.org/I2800817003","display_name":"Southern California University for Professional Studies","ror":"https://ror.org/058zz0t50","country_code":"US","type":"education","lineage":["https://openalex.org/I2800817003"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shaddin Dughmi","raw_affiliation_strings":["University of Southern California"],"affiliations":[{"raw_affiliation_string":"University of Southern California","institution_ids":["https://openalex.org/I2800817003","https://openalex.org/I1174212"]}]},{"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"],"affiliations":[{"raw_affiliation_string":"Stanford University","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/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qiqi Yan","raw_affiliation_strings":["Google Research"],"affiliations":[{"raw_affiliation_string":"Google Research","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001275905"],"corresponding_institution_ids":["https://openalex.org/I1174212","https://openalex.org/I2800817003"],"apc_list":null,"apc_paid":null,"fwci":1.1197,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82682125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"63","issue":"4","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9998000264167786,"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":0.9998000264167786,"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.9908000230789185,"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.9857000112533569,"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/randomized-rounding","display_name":"Randomized rounding","score":0.8184487819671631},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8182206153869629},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8082937002182007},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.7253845930099487},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.6504676938056946},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6129435896873474},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5715351700782776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5585614442825317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.52422696352005},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4901302754878998},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4169028401374817},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3575679659843445},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34765130281448364},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.33752715587615967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32769834995269775}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.8184487819671631},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8182206153869629},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8082937002182007},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.7253845930099487},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.6504676938056946},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6129435896873474},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5715351700782776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5585614442825317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.52422696352005},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4901302754878998},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4169028401374817},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3575679659843445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34765130281448364},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.33752715587615967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32769834995269775},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2908735","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908735","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.483.7139","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.483.7139","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/convex.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W1503221585","https://openalex.org/W1535203466","https://openalex.org/W1568307856","https://openalex.org/W1579522749","https://openalex.org/W1580387990","https://openalex.org/W1622653397","https://openalex.org/W1653473560","https://openalex.org/W1680189815","https://openalex.org/W1727602370","https://openalex.org/W1852463194","https://openalex.org/W1974169835","https://openalex.org/W1975378045","https://openalex.org/W1989453388","https://openalex.org/W1993227852","https://openalex.org/W1995275762","https://openalex.org/W2003159902","https://openalex.org/W2012634103","https://openalex.org/W2014421218","https://openalex.org/W2026375929","https://openalex.org/W2031122640","https://openalex.org/W2035337032","https://openalex.org/W2035977618","https://openalex.org/W2037340562","https://openalex.org/W2054039722","https://openalex.org/W2059527251","https://openalex.org/W2061647611","https://openalex.org/W2062830639","https://openalex.org/W2065980363","https://openalex.org/W2078273056","https://openalex.org/W2103751307","https://openalex.org/W2118827435","https://openalex.org/W2126085282","https://openalex.org/W2126307323","https://openalex.org/W2128274978","https://openalex.org/W2129866531","https://openalex.org/W2141502056","https://openalex.org/W2142495422","https://openalex.org/W2154641777","https://openalex.org/W2157316274","https://openalex.org/W2158486621","https://openalex.org/W2168787235","https://openalex.org/W2169319812","https://openalex.org/W2170531897","https://openalex.org/W2170545834","https://openalex.org/W2199385070","https://openalex.org/W2216069195","https://openalex.org/W2296319761","https://openalex.org/W2340149117","https://openalex.org/W2508573783","https://openalex.org/W2612690410","https://openalex.org/W2621717961","https://openalex.org/W2770911772","https://openalex.org/W2949610674","https://openalex.org/W2950524333","https://openalex.org/W2962711478","https://openalex.org/W4205960197","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W4385627918","https://openalex.org/W4252399622","https://openalex.org/W4235430592","https://openalex.org/W1550607748","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2235694368","https://openalex.org/W2548642347","https://openalex.org/W4300592161"],"abstract_inverted_index":{"We":[0],"design":[1],"the":[2,13,49,86,151,155,161,170,173,187,198,226],"first":[3],"truthful-in-expectation,":[4],"constant-factor":[5],"approximation":[6,74,83,133],"mechanisms":[7,65,124,134],"for":[8,89,93,131],"NP":[9,103],"-hard":[10],"cases":[11],"of":[12,40,48,53,76,122,127,143,154,167,225],"welfare":[14],"maximization":[15],"problem":[16],"in":[17,24,197],"combinatorial":[18,25],"auctions":[19],"with":[20,33,195],"nonidentical":[21],"items":[22],"and":[23,59,71,95,218],"public":[26],"projects.":[27],"Our":[28,64],"results":[29,107,111],"apply":[30],"to":[31,115,147,172,212],"bidders":[32,194],"valuations":[34,196],"that":[35,45,109,210],"are":[36,125],"nonnegative":[37],"linear":[38],"combinations":[39],"gross-substitute":[41,202],"valuations,":[42,99,203],"a":[43,116,128,214,219],"class":[44],"encompasses":[46],"many":[47],"most":[50],"well-studied":[51],"subclasses":[52],"submodular":[54],"functions,":[55],"including":[56],"coverage":[57,98],"functions":[58],"weighted":[60],"matroid":[61],"rank":[62],"functions.":[63],"have":[66],"an":[67,73],"expected":[68],"polynomial":[69],"runtime":[70],"achieve":[72],"factor":[75,84],"1":[77],"\u2212":[78,221],"1/":[79,222],"e":[80,223],".":[81,104],"This":[82,176],"is":[85,146,191],"best":[87],"possible":[88],"both":[90,213],"problems,":[91],"even":[92],"known":[94],"explicitly":[96],"given":[97],"assuming":[100],"P":[101],"\u2260":[102],"Recent":[105],"impossibility":[106],"suggest":[108],"our":[110,123],"cannot":[112],"be":[113,183],"extended":[114],"significantly":[117],"larger":[118],"valuation":[119],"class.":[120],"Both":[121],"instantiations":[126],"new":[129],"framework":[130,145,177],"designing":[132],"based":[135],"on":[136],"randomized":[137,207],"rounding":[138,156,174,208],"algorithms.":[139],"The":[140],"high-level":[141],"idea":[142],"this":[144],"optimize":[148],"directly":[149],"over":[150,169],"(random)":[152],"output":[153],"algorithm":[157],",":[158],"rather":[159],"than":[160],"usual":[162],"(and":[163],"rarely":[164],"truthful)":[165],"approach":[166],"optimizing":[168],"input":[171],"algorithm.":[175],"yields":[178],"truthful-in-expectation":[179],"mechanisms,":[180],"which":[181],"can":[182],"implemented":[184],"efficiently":[185],"when":[186],"corresponding":[188],"objective":[189,216],"function":[190,217],"concave.":[192],"For":[193],"cone":[199],"generated":[200],"by":[201],"we":[204],"give":[205],"novel":[206],"algorithms":[209],"lead":[211],"concave":[215],"(1":[220],")-approximation":[224],"optimal":[227],"welfare.":[228]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}