{"id":"https://openalex.org/W2989427540","doi":"https://doi.org/10.1137/20m1316068","title":"Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders","display_name":"Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders","publication_year":2023,"publication_date":"2023-02-13","ids":{"openalex":"https://openalex.org/W2989427540","doi":"https://doi.org/10.1137/20m1316068","mag":"2989427540"},"language":"en","primary_location":{"id":"doi:10.1137/20m1316068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1316068","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/A5060978295","display_name":"Sepehr Assadi","orcid":"https://orcid.org/0009-0006-8914-5995"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["Department of Computer Science, Rutgers University, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078010312","display_name":"Sahil Singla","orcid":"https://orcid.org/0000-0002-8800-6479"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sahil Singla","raw_affiliation_strings":["Department of Computer Science, Princeton University, and Institute for Advanced Study"],"raw_orcid":"https://orcid.org/0000-0002-8800-6479","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, and Institute for Advanced Study","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060978295"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00138814,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"54","issue":"4","first_page":"FOCS19","last_page":"253"},"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/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9824000000953674,"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"}},{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9824000000953674,"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/submodular-set-function","display_name":"Submodular set function","score":0.9520139694213867},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.8041418790817261},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.6337419152259827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49314016103744507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46522992849349976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4501405656337738},{"id":"https://openalex.org/keywords/vickrey\u2013clarke\u2013groves-auction","display_name":"Vickrey\u2013Clarke\u2013Groves auction","score":0.42829856276512146},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.35621702671051025},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32504165172576904},{"id":"https://openalex.org/keywords/auction-theory","display_name":"Auction theory","score":0.13147500157356262}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9520139694213867},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.8041418790817261},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.6337419152259827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49314016103744507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46522992849349976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4501405656337738},{"id":"https://openalex.org/C147220207","wikidata":"https://www.wikidata.org/wiki/Q773073","display_name":"Vickrey\u2013Clarke\u2013Groves auction","level":4,"score":0.42829856276512146},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.35621702671051025},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32504165172576904},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.13147500157356262},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1316068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1316068","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W39861960","https://openalex.org/W95009287","https://openalex.org/W1569146567","https://openalex.org/W1580387990","https://openalex.org/W1846856248","https://openalex.org/W1871809785","https://openalex.org/W1965161364","https://openalex.org/W1989453388","https://openalex.org/W1995275762","https://openalex.org/W2014421218","https://openalex.org/W2015007620","https://openalex.org/W2035337032","https://openalex.org/W2037340562","https://openalex.org/W2041211404","https://openalex.org/W2059527251","https://openalex.org/W2072617828","https://openalex.org/W2078040677","https://openalex.org/W2078273056","https://openalex.org/W2082691840","https://openalex.org/W2103751307","https://openalex.org/W2120100612","https://openalex.org/W2126085282","https://openalex.org/W2126307323","https://openalex.org/W2136765140","https://openalex.org/W2141502056","https://openalex.org/W2147513181","https://openalex.org/W2161272173","https://openalex.org/W2169319812","https://openalex.org/W2170545834","https://openalex.org/W2275395982","https://openalex.org/W2404115796","https://openalex.org/W2610675089","https://openalex.org/W2804373447","https://openalex.org/W2901536473","https://openalex.org/W2950006664","https://openalex.org/W2962711478","https://openalex.org/W2963138504","https://openalex.org/W2963496257","https://openalex.org/W2963540380","https://openalex.org/W2964161669","https://openalex.org/W2964293104","https://openalex.org/W3138967961"],"related_works":["https://openalex.org/W2164943659","https://openalex.org/W187768306","https://openalex.org/W2293269701","https://openalex.org/W1775068182","https://openalex.org/W1594147293","https://openalex.org/W2184491186","https://openalex.org/W1924265123","https://openalex.org/W2024793666","https://openalex.org/W4297077755","https://openalex.org/W2952464174"],"abstract_inverted_index":{".A":[0],"longstanding":[1],"open":[2,149],"problem":[3,70],"in":[4,21,77,134,162,165],"algorithmic":[5],"mechanism":[6,30,81,111,128],"design":[7,10],"is":[8,64,157],"to":[9],"truthful":[11,110],"mechanisms":[12],"that":[13,116],"are":[14],"computationally":[15],"efficient":[16],"and":[17,36,141],"(approximately)":[18],"maximize":[19],"welfare":[20],"combinatorial":[22],"auctions":[23],"with":[24,112],"submodular":[25],"bidders.":[26],"The":[27],"first":[28],"such":[29],"was":[31],"obtained":[32],"by":[33,82,121],"Dobzinski,":[34],"Nisan,":[35],"Schapira":[37],"[Proceedings":[38,84],"of":[39,47,67,85,94,151],"the":[40,65,86,119,158,166],"37th":[41],"Annual":[42,88],"ACM":[43,89],"Symposium":[44,91],"on":[45,92,153],"Theory":[46,93],"Computing,":[48,95],"Baltimore,":[49],"MD,":[50],"ACM,":[51,100],"New":[52,101],"York,":[53,102],"2005,":[54],"pp.":[55,104],"610\u2013618]":[56],"who":[57],"gave":[58],"an":[59,78,113,122,130,148],"\\(O(\\log^2{m})\\)":[60],"-approximation,":[61],"where":[62],"\\(m\\)":[63],"number":[66],"items.":[68],"This":[69,146],"has":[71,142],"been":[72],"studied":[73],"extensively":[74],"since,":[75],"culminating":[76],"\\(O(\\sqrt{\\log{m}})\\)":[79],"-approximation":[80,133],"Dobzinski":[83,152],"48th":[87],"SIGACT":[90],"STOC":[96],"2016,":[97,103],"Cambridge,":[98],"MA,":[99],"940\u2013948].":[105],"We":[106],"present":[107],"a":[108],"computationally-efficient":[109],"approximation":[114,160],"ratio":[115,161],"improves":[117],"upon":[118],"state-of-the-art":[120],"exponential":[123],"factor.":[124],"In":[125],"particular,":[126],"our":[127],"achieves":[129],"\\(O((\\log":[131],"\\log{m})^3)\\)":[132],"expectation,":[135],"uses":[136],"only":[137],"\\(O(n)\\)":[138],"demand":[139],"queries,":[140],"universal":[143],"truthfulness":[144],"guarantee.":[145],"settles":[147],"question":[150],"whether":[154],"\\(\\Theta":[155],"(\\sqrt{\\log{m}})\\)":[156],"best":[159],"this":[163],"setting":[164],"negative.Keywordscombinatorial":[167],"auctionstruthful":[168],"mechanismssubmodular":[169],"valuationsMSC":[170],"codes91A99":[171]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}