{"id":"https://openalex.org/W3034598969","doi":"https://doi.org/10.1145/3357713.3384267","title":"Separating the communication complexity of truthful and non-truthful combinatorial auctions","display_name":"Separating the communication complexity of truthful and non-truthful combinatorial auctions","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3034598969","doi":"https://doi.org/10.1145/3357713.3384267","mag":"3034598969"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384267","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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":false,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["Rutgers University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053036738","display_name":"Hrishikesh Khandeparkar","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hrishikesh Khandeparkar","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053649149","display_name":"Raghuvansh R. Saxena","orcid":"https://orcid.org/0009-0002-7006-6710"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghuvansh R. Saxena","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075388037","display_name":"S. Matthew Weinberg","orcid":"https://orcid.org/0000-0001-7744-795X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Matthew Weinberg","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3492,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90160058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1073","last_page":"1085"},"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9902999997138977,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9781000018119812,"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/combinatorial-auction","display_name":"Combinatorial auction","score":0.9060322642326355},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.659963071346283},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5674853324890137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5287458896636963},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4940800964832306},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.44813379645347595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4303942322731018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3739776611328125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3406321108341217},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05642244219779968}],"concepts":[{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.9060322642326355},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.659963071346283},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5674853324890137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5287458896636963},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4940800964832306},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.44813379645347595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4303942322731018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3739776611328125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3406321108341217},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05642244219779968}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3357713.3384267","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.01RUT_INST:11663542460004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/Separating-the-communication-complexity-of-truthful/991031654690604646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W80618698","https://openalex.org/W1924265123","https://openalex.org/W1995275762","https://openalex.org/W2027680861","https://openalex.org/W2062830639","https://openalex.org/W2275395982","https://openalex.org/W2767520499","https://openalex.org/W2950708966","https://openalex.org/W2963138504","https://openalex.org/W2963496257","https://openalex.org/W2971687266"],"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/W3122260521","https://openalex.org/W2600242401","https://openalex.org/W2765249998","https://openalex.org/W4297795036","https://openalex.org/W2478847702"],"abstract_inverted_index":{"We":[0],"prove":[1,21],"the":[2,6],"first":[3],"separation":[4],"in":[5,59],"approximation":[7],"guarantee":[8],"achievable":[9],"by":[10,47],"truthful":[11,24],"and":[12],"non-truthful":[13,45],"combinatorial":[14],"auctions":[15],"with":[16,32],"polynomial":[17],"communication.":[18,61],"Specifically,":[19],"we":[20],"that":[22],"any":[23],"auction":[25,46],"guaranteeing":[26],"a":[27,44,57],"(34\u22121240+\u0454)-approximation":[28],"for":[29],"two":[30],"buyers":[31],"XOS":[33],"valuations":[34],"over":[35],"m":[36],"items":[37],"requires":[38],"exp(\u03a9(\u03b52":[39],"\u00b7":[40],"m))":[41],"communication":[42],"whereas":[43],"Feige":[48],"[J.":[49],"Comput.":[50],"2009]":[51],"is":[52],"already":[53],"known":[54],"to":[55],"achieve":[56],"34-approximation":[58],"(m)":[60]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}