{"id":"https://openalex.org/W4225941144","doi":"https://doi.org/10.1137/20m1370021","title":"Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions","display_name":"Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions","publication_year":2022,"publication_date":"2022-04-07","ids":{"openalex":"https://openalex.org/W4225941144","doi":"https://doi.org/10.1137/20m1370021"},"language":"en","primary_location":{"id":"doi:10.1137/20m1370021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1370021","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053036738","display_name":"Hrishikesh Khandeparkar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hrishikesh Khandeparkar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053649149","display_name":"Raghuvansh R. Saxena","orcid":"https://orcid.org/0009-0002-7006-6710"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raghuvansh R. Saxena","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075388037","display_name":"S. Matthew Weinberg","orcid":"https://orcid.org/0000-0001-7744-795X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Matthew Weinberg","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5060978295"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04385935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"3","first_page":"STOC20","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9998999834060669,"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.9998999834060669,"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.9847000241279602,"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.9799000024795532,"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/communication-complexity","display_name":"Communication complexity","score":0.7405873537063599},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.7397205233573914},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6433743834495544},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6089286208152771},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.6007052063941956},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5100691914558411},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49285387992858887},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45776867866516113},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4371907711029053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4237586557865143},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42133694887161255},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38567379117012024},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09620025753974915}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7405873537063599},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.7397205233573914},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6433743834495544},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6089286208152771},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.6007052063941956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5100691914558411},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49285387992858887},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45776867866516113},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4371907711029053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4237586557865143},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42133694887161255},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38567379117012024},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09620025753974915},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/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/20m1370021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1370021","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":[{"id":"https://openalex.org/G259695079","display_name":null,"funder_award_id":"CCF-1717899","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G463163403","display_name":null,"funder_award_id":"CCF-2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8284423798","display_name":null,"funder_award_id":"Collaboration on Algorithms and Geometry","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"},{"id":"https://openalex.org/G8721280526","display_name":null,"funder_award_id":"CCF-1750443","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/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W39861960","https://openalex.org/W95009287","https://openalex.org/W1580387990","https://openalex.org/W1755069162","https://openalex.org/W1965765215","https://openalex.org/W1966092900","https://openalex.org/W1989453388","https://openalex.org/W1991223607","https://openalex.org/W2007654329","https://openalex.org/W2014421218","https://openalex.org/W2015007620","https://openalex.org/W2027680861","https://openalex.org/W2051019379","https://openalex.org/W2059527251","https://openalex.org/W2062830639","https://openalex.org/W2072617828","https://openalex.org/W2078040677","https://openalex.org/W2078273056","https://openalex.org/W2093303125","https://openalex.org/W2104334470","https://openalex.org/W2110882703","https://openalex.org/W2120100612","https://openalex.org/W2161272173","https://openalex.org/W2275395982","https://openalex.org/W2296545821","https://openalex.org/W2333413293","https://openalex.org/W2478708596","https://openalex.org/W2571397442","https://openalex.org/W2610675089","https://openalex.org/W2611688713","https://openalex.org/W2621304102","https://openalex.org/W2963138504","https://openalex.org/W2963540380","https://openalex.org/W2971388482","https://openalex.org/W2971687266","https://openalex.org/W3011766368","https://openalex.org/W4245400518"],"related_works":["https://openalex.org/W2164943659","https://openalex.org/W2293269701","https://openalex.org/W1775068182","https://openalex.org/W1594147293","https://openalex.org/W2184491186","https://openalex.org/W1495402553","https://openalex.org/W3122260521","https://openalex.org/W2600242401","https://openalex.org/W2765249998","https://openalex.org/W4297795036"],"abstract_inverted_index":{"We":[0,87],"provide":[1],"the":[2,6,55,117],"first":[3],"separation":[4,90],"in":[5,84],"approximation":[7],"guarantee":[8],"achievable":[9],"by":[10,49,91],"truthful":[11,26,137,141],"and":[12,51,68],"nontruthful":[13,47],"algorithms":[14],"for":[15,31],"combinatorial":[16],"auctions":[17],"with":[18,34],"polynomial":[19],"communication.":[20,86],"Specifically,":[21],"we":[22],"prove":[23],"that":[24,93],"any":[25,94],"mechanism":[27],"guaranteeing":[28],"a":[29,46,82,102],"$(\\nicefrac{3}{4}-\\nicefrac{1}{240}+\\varepsilon)$-approximation":[30,103],"two":[32],"buyers":[33],"XOS":[35],"valuations":[36],"over":[37],"$m$":[38],"items":[39],"requires":[40,104],"$\\exp(\\Omega(\\varepsilon^2":[41,106],"\\cdot":[42,107],"m))$":[43],"communication,":[44],"whereas":[45],"algorithm":[48],"Dobzinski":[50,114],"Schapira":[52],"[Proceedings":[53,115],"of":[54,113,116,123],"Seventeenth":[56],"Annual":[57,119],"ACM-SIAM":[58],"Symposium":[59,120],"on":[60,121],"Discrete":[61],"Algorithms":[62],"(SODA),":[63],"SIAM,":[64],"2006,":[65],"pp.":[66,75,129],"1064--1073]":[67],"Feige":[69],"[SIAM":[70],"J.":[71],"Comput.,":[72],"39":[73],"(2009),":[74],"122--142]":[76],"is":[77],"already":[78],"known":[79],"to":[80,135],"achieve":[81],"$\\nicefrac{3}{4}$-approximation":[83],"${poly}(m)$":[85],"obtain":[88],"our":[89],"proving":[92],"simultaneous":[95],"protocol":[96],"(not":[97],"necessarily":[98],"truthful)":[99],"which":[100],"guarantees":[101],"communication":[105],"m))$.":[108],"The":[109],"taxation":[110],"complexity":[111],"framework":[112],"57th":[118],"Foundations":[122],"Computer":[124],"Science":[125],"(FOCS),":[126],"IEEE,":[127],"2016,":[128],"209--218]":[130],"extends":[131],"this":[132],"lower":[133],"bound":[134],"all":[136],"mechanisms":[138],"(including":[139],"interactive":[140],"mechanisms).":[142]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}