{"id":"https://openalex.org/W4200345643","doi":"https://doi.org/10.1145/3505156.3505165","title":"The randomized communication complexity of revenue maximization","display_name":"The randomized communication complexity of revenue maximization","publication_year":2021,"publication_date":"2021-11-01","ids":{"openalex":"https://openalex.org/W4200345643","doi":"https://doi.org/10.1145/3505156.3505165"},"language":"en","primary_location":{"id":"doi:10.1145/3505156.3505165","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3505156.3505165","pdf_url":null,"source":{"id":"https://openalex.org/S4210233839","display_name":"ACM SIGecom Exchanges","issn_l":"1551-9031","issn":["1551-9031"],"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":"ACM SIGecom Exchanges","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/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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23274924,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"2","first_page":"75","last_page":"83"},"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.9954000115394592,"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.9887999892234802,"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/common-value-auction","display_name":"Common value auction","score":0.7511131763458252},{"id":"https://openalex.org/keywords/incentive-compatibility","display_name":"Incentive compatibility","score":0.7275137901306152},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7141080498695374},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.7020664811134338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5722827911376953},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.49204203486442566},{"id":"https://openalex.org/keywords/revenue","display_name":"Revenue","score":0.46401891112327576},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.46227508783340454},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.45653682947158813},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4521869719028473},{"id":"https://openalex.org/keywords/vickrey\u2013clarke\u2013groves-auction","display_name":"Vickrey\u2013Clarke\u2013Groves auction","score":0.4376624822616577},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.42208725214004517},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41754770278930664},{"id":"https://openalex.org/keywords/incentive","display_name":"Incentive","score":0.4069816768169403},{"id":"https://openalex.org/keywords/auction-theory","display_name":"Auction theory","score":0.3078867495059967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2683148980140686},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.25638118386268616},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.24091392755508423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18207046389579773}],"concepts":[{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.7511131763458252},{"id":"https://openalex.org/C91810955","wikidata":"https://www.wikidata.org/wiki/Q7731670","display_name":"Incentive compatibility","level":3,"score":0.7275137901306152},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7141080498695374},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.7020664811134338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5722827911376953},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.49204203486442566},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.46401891112327576},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.46227508783340454},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.45653682947158813},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4521869719028473},{"id":"https://openalex.org/C147220207","wikidata":"https://www.wikidata.org/wiki/Q773073","display_name":"Vickrey\u2013Clarke\u2013Groves auction","level":4,"score":0.4376624822616577},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.42208725214004517},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41754770278930664},{"id":"https://openalex.org/C29122968","wikidata":"https://www.wikidata.org/wiki/Q1414816","display_name":"Incentive","level":2,"score":0.4069816768169403},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.3078867495059967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2683148980140686},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.25638118386268616},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.24091392755508423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18207046389579773},{"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/3505156.3505165","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3505156.3505165","pdf_url":null,"source":{"id":"https://openalex.org/S4210233839","display_name":"ACM SIGecom Exchanges","issn_l":"1551-9031","issn":["1551-9031"],"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":"ACM SIGecom Exchanges","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1488995906","https://openalex.org/W1942817867","https://openalex.org/W1968517895","https://openalex.org/W2027552455","https://openalex.org/W2132979545","https://openalex.org/W2133387873","https://openalex.org/W2141502056","https://openalex.org/W2144132878","https://openalex.org/W2150771176","https://openalex.org/W2219868088","https://openalex.org/W2240464601","https://openalex.org/W2298380537","https://openalex.org/W2344198663","https://openalex.org/W2409015594","https://openalex.org/W2549743857","https://openalex.org/W2951767300","https://openalex.org/W2963540380","https://openalex.org/W2963734142","https://openalex.org/W2965052587","https://openalex.org/W3166375539","https://openalex.org/W4254539327","https://openalex.org/W6682490724"],"related_works":["https://openalex.org/W2479784301","https://openalex.org/W3151424609","https://openalex.org/W3123645920","https://openalex.org/W1942119678","https://openalex.org/W2122236029","https://openalex.org/W2076322160","https://openalex.org/W2764011268","https://openalex.org/W2788745994","https://openalex.org/W1924265123","https://openalex.org/W2115739908"],"abstract_inverted_index":{"We":[0,89,112],"study":[1],"the":[2,31,73,120,154],"communication":[3,75,99,122,160],"complexity":[4,76,100,123,161],"of":[5,61,77,124,134,162,177],"incentive":[6,92,135,168],"compatible":[7,136,169],"auction-protocols":[8,96,137],"between":[9,159],"a":[10,14,18,131,166],"monopolist":[11],"seller":[12],"and":[13,26,41,51,64,94,179,182],"single":[15],"buyer":[16],"with":[17],"combinatorial":[19],"valuation":[20],"function":[21],"over":[22],"n":[23],"items":[24],"[Rubinstein":[25],"Zhao":[27],"2021].":[28],"Motivated":[29],"by":[30,57],"fact":[32,104],"that":[33,138],"revenue-optimal":[34,95],"auctions":[35],"are":[36],"randomized":[37,74,146],"[Thanassoulis":[38],"2004;":[39],"Manelli":[40],"Vincent":[42],"2010;":[43,47],"Briest":[44],"et":[45,67],"al.":[46,68],"Pavlov":[48],"2011;":[49],"Hart":[50],"Reny":[52],"2015]":[53],"(as":[54],"well":[55],"as":[56],"an":[58,174],"open":[59,175],"problem":[60,79],"Babaioff,":[62],"Gonczarowski,":[63],"Nisan":[65],"[Babaioff":[66],"2017]),":[69],"we":[70],"focus":[71],"on":[72,86,119],"this":[78],"(in":[80,103],"contrast":[81],"to":[82,141],"most":[83],"prior":[84],"work":[85],"deterministic":[87,110],"communication).":[88],"design":[90],"simple,":[91],"compatible,":[93],"whose":[97],"expected":[98,121],"is":[101],"much":[102],"infinitely)":[105],"more":[106],"efficient":[107],"than":[108],"their":[109],"counterparts.":[111],"also":[113],"give":[114,153],"nearly":[115],"matching":[116],"lower":[117,143,151],"bounds":[118,144,152],"approximately-revenue-optimal":[125],"auctions.":[126],"These":[127],"results":[128],"follow":[129],"from":[130],"simple":[132],"characterization":[133],"allows":[139],"us":[140],"prove":[142],"against":[145],"auction-protocols.":[147],"In":[148],"particular,":[149],"our":[150],"first":[155],"approximation-resistant,":[156],"exponential":[157],"separation":[158],"incentivizing":[163],"vs":[164],"implementing":[165],"Bayesian":[167],"social":[170],"choice":[171],"rule,":[172],"settling":[173],"question":[176],"Fadel":[178],"Segal":[180,183],"[Fadel":[181],"2009].":[184]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}