{"id":"https://openalex.org/W3166375539","doi":"https://doi.org/10.1145/3406325.3451111","title":"The randomized communication complexity of randomized auctions","display_name":"The randomized communication complexity of randomized auctions","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3166375539","doi":"https://doi.org/10.1145/3406325.3451111","mag":"3166375539"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451111","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5035432679","display_name":"Aviad Rubinstein","orcid":"https://orcid.org/0000-0002-6900-8612"},"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":"Aviad Rubinstein","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101141560","display_name":"Junyao Zhao","orcid":null},"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":"Junyao Zhao","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, 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":0.3586,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62486405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"882","last_page":"895"},"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9983999729156494,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7540147304534912},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.7501797676086426},{"id":"https://openalex.org/keywords/incentive-compatibility","display_name":"Incentive compatibility","score":0.7044346332550049},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.6865588426589966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6149747371673584},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4708884358406067},{"id":"https://openalex.org/keywords/revenue","display_name":"Revenue","score":0.46235641837120056},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4617936611175537},{"id":"https://openalex.org/keywords/incentive","display_name":"Incentive","score":0.4567682445049286},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.43786412477493286},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.43207651376724243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4125576615333557},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3175821006298065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24516373872756958},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.2436661720275879},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23149356245994568},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.1738385260105133},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15021267533302307}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7540147304534912},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.7501797676086426},{"id":"https://openalex.org/C91810955","wikidata":"https://www.wikidata.org/wiki/Q7731670","display_name":"Incentive compatibility","level":3,"score":0.7044346332550049},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.6865588426589966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6149747371673584},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4708884358406067},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.46235641837120056},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4617936611175537},{"id":"https://openalex.org/C29122968","wikidata":"https://www.wikidata.org/wiki/Q1414816","display_name":"Incentive","level":2,"score":0.4567682445049286},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.43786412477493286},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.43207651376724243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4125576615333557},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3175821006298065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24516373872756958},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.2436661720275879},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23149356245994568},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.1738385260105133},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15021267533302307},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451111","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W1510725498","https://openalex.org/W1777846591","https://openalex.org/W1969442223","https://openalex.org/W1974560448","https://openalex.org/W1983278852","https://openalex.org/W1996008403","https://openalex.org/W2006466702","https://openalex.org/W2007201570","https://openalex.org/W2012672170","https://openalex.org/W2016446857","https://openalex.org/W2048717128","https://openalex.org/W2080061319","https://openalex.org/W2088099208","https://openalex.org/W2088970293","https://openalex.org/W2106107501","https://openalex.org/W2121751780","https://openalex.org/W2122414948","https://openalex.org/W2132979545","https://openalex.org/W2133387873","https://openalex.org/W2141502056","https://openalex.org/W2150771176","https://openalex.org/W2152549790","https://openalex.org/W2152846304","https://openalex.org/W2157539286","https://openalex.org/W2161272173","https://openalex.org/W2199516650","https://openalex.org/W2219868088","https://openalex.org/W2240464601","https://openalex.org/W2268535217","https://openalex.org/W2275395982","https://openalex.org/W2298380537","https://openalex.org/W2344198663","https://openalex.org/W2502094132","https://openalex.org/W2549743857","https://openalex.org/W2563248907","https://openalex.org/W2563898808","https://openalex.org/W2610675089","https://openalex.org/W2617513782","https://openalex.org/W2889245268","https://openalex.org/W2949491553","https://openalex.org/W2949836530","https://openalex.org/W2950920780","https://openalex.org/W2951215058","https://openalex.org/W2951767300","https://openalex.org/W2952401567","https://openalex.org/W2962711478","https://openalex.org/W2962720357","https://openalex.org/W2962924022","https://openalex.org/W2963249463","https://openalex.org/W2963464038","https://openalex.org/W2963496257","https://openalex.org/W2963540380","https://openalex.org/W2963731539","https://openalex.org/W2963734142","https://openalex.org/W2964214341","https://openalex.org/W2964334937","https://openalex.org/W2965052587","https://openalex.org/W2965885938","https://openalex.org/W2990108307","https://openalex.org/W3034598969","https://openalex.org/W3162639174","https://openalex.org/W3162861602","https://openalex.org/W4253280466","https://openalex.org/W4253579101","https://openalex.org/W6637432206","https://openalex.org/W6682490724"],"related_works":["https://openalex.org/W2164943659","https://openalex.org/W2293269701","https://openalex.org/W2600242401","https://openalex.org/W1965161364","https://openalex.org/W1571950539","https://openalex.org/W2399045738","https://openalex.org/W53387826","https://openalex.org/W2492074436","https://openalex.org/W3123927169","https://openalex.org/W15370767"],"abstract_inverted_index":{"We":[0,65,88],"study":[1],"the":[2,27,49,96,130],"communication":[3,51,75,98,136],"complexity":[4,52,76,99,137],"of":[5,41,53,100,110,138,153],"incentive":[6,68,111,144],"compatible":[7,112,145],"auction-protocols":[8,72,113],"between":[9,135],"a":[10,14,18,107,142],"monopolist":[11],"seller":[12],"and":[13,44,70,155],"single":[15],"buyer":[16],"with":[17],"combinatorial":[19],"valuation":[20],"function":[21],"over":[22],"n":[23],"items.":[24],"Motivated":[25],"by":[26,37],"fact":[28,80],"that":[29,114],"revenue-optimal":[30,71],"auctions":[31],"are":[32],"randomized":[33,50,122],"(as":[34],"well":[35],"as":[36],"an":[38,150],"open":[39,151],"problem":[40,55],"Babaioff,":[42],"Gonczarowski,":[43],"Nisan),":[45],"we":[46],"focus":[47],"on":[48,62,95],"this":[54],"(in":[56,79],"contrast":[57],"to":[58,117],"most":[59],"prior":[60],"work":[61],"deterministic":[63,86],"communication).":[64],"design":[66],"simple,":[67],"compatible,":[69],"whose":[73],"expected":[74,97],"is":[77],"much":[78],"infinitely)":[81],"more":[82],"efficient":[83],"than":[84],"their":[85],"counterparts.":[87],"also":[89],"give":[90,129],"nearly":[91],"matching":[92],"lower":[93,119,127],"bounds":[94,120,128],"approximately-revenue-optimal":[101],"auctions.":[102],"These":[103],"results":[104],"follow":[105],"from":[106],"simple":[108],"characterization":[109],"allows":[115],"us":[116],"prove":[118],"against":[121],"auction-protocols.":[123],"In":[124],"particular,":[125],"our":[126],"first":[131],"approximation-resistant,":[132],"exponential":[133],"separation":[134],"incentivizing":[139],"vs":[140],"implementing":[141],"Bayesian":[143],"social":[146],"choice":[147],"rule,":[148],"settling":[149],"question":[152],"Fadel":[154],"Segal.":[156]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}