{"id":"https://openalex.org/W4313403238","doi":"https://doi.org/10.1145/3578579","title":"Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents","display_name":"Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents","publication_year":2023,"publication_date":"2023-01-02","ids":{"openalex":"https://openalex.org/W4313403238","doi":"https://doi.org/10.1145/3578579"},"language":"en","primary_location":{"id":"doi:10.1145/3578579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578579","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5029728847","display_name":"Ivan Geffner","orcid":"https://orcid.org/0000-0001-6900-2109"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ivan Geffner","raw_affiliation_strings":["Cornell University, Ithaca, NY"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087025582","display_name":"Joseph Y. Halpern","orcid":"https://orcid.org/0000-0002-9229-1663"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Y. Halpern","raw_affiliation_strings":["Cornell University, Ithaca, NY"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029728847"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.3491,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61891239,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"70","issue":"2","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10270","display_name":"Blockchain Technology Applications and Security","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.8236241340637207},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6720744967460632},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6367771625518799},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.5695763230323792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5450267791748047},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45085281133651733},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44719836115837097},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.427853524684906},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4244692921638489},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.4189501702785492},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40902623534202576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3931536078453064},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.194782555103302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16036885976791382},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12597179412841797}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8236241340637207},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6720744967460632},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6367771625518799},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.5695763230323792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5450267791748047},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45085281133651733},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44719836115837097},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.427853524684906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4244692921638489},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.4189501702785492},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40902623534202576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3931536078453064},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.194782555103302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16036885976791382},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12597179412841797},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3578579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578579","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8709435","display_name":null,"funder_award_id":"W911NF-19-1-0217","funder_id":"https://openalex.org/F4320333591","funder_display_name":"Multidisciplinary University Research Initiative"}],"funders":[{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2006453614","https://openalex.org/W2011665720","https://openalex.org/W2025142762","https://openalex.org/W2054694168","https://openalex.org/W2077734015","https://openalex.org/W2116643105","https://openalex.org/W2141420453","https://openalex.org/W2963731586","https://openalex.org/W3014003188","https://openalex.org/W3046504732","https://openalex.org/W4253945725"],"related_works":["https://openalex.org/W2116677773","https://openalex.org/W2155261584","https://openalex.org/W2584231425","https://openalex.org/W2042919702","https://openalex.org/W2150611273","https://openalex.org/W4207086172","https://openalex.org/W4225981436","https://openalex.org/W2156185805","https://openalex.org/W2770353918","https://openalex.org/W2122502560"],"abstract_inverted_index":{"Abraham,":[0],"Dolev,":[1],"Geffner,":[2],"and":[3,20,64],"Halpern":[4],"[":[5,130,243],"1":[6],"]":[7],"proved":[8],"that,":[9],"in":[10,83,234],"asynchronous":[11,124,231],"systems,":[12],"a":[13,21,101,156,160,217],"(k,":[14],"t)-robust":[15],"equilibrium":[16,40],"for":[17,221],"n":[18,33,88,198,209],"players":[19,53,69,109],"trusted":[22],"mediator":[23,29,102],"can":[24,54,70],"be":[25,105,202],"implemented":[26,106],"without":[27],"the":[28,56,61,84,108,134,187,222,235],"as":[30,32],"long":[31],">":[34],"4(":[35,90,211],"k+t":[36,91,127,166,173,204,212],"),":[37],"where":[38],"an":[39],"is":[41,81,140,155],"(":[42,95,114,126,165,172,180,203],"k,":[43,96,115,181],"t":[44,52,97,116,182,228,240],")-robust":[45,98,117,183],"if,":[46],"roughly":[47],"speaking,":[48],"no":[49,65,141],"coalition":[50,66],"of":[51,58,60,67,136,164,226,237],"decrease":[55],"payoff":[57,73],"any":[59],"other":[62],"players,":[63],"k":[68],"increase":[71],"their":[72],"by":[74,107,191],"deviating.":[75],"We":[76,185],"prove":[77,186],"that":[78,86,103,153,193,200],"this":[79],"bound":[80,190,225],"tight,":[82],"sense":[85],"if":[87,208],"\u2264":[89,210],")":[92],"there":[93,139,154,194],"exist":[94],"equilibria":[99],"with":[100],"cannot":[104,201],"alone.":[110],"Even":[111],"though":[112],"implementing":[113,123,179],"mediators":[118],"seems":[119],"closely":[120],"related":[121],"to":[122,133,148,178,239],"multiparty":[125],")-secure":[128,167],"computation":[129,176,233],"6":[131],"],":[132],"best":[135],"our":[137],"knowledge":[138],"known":[142],"straightforward":[143],"reduction":[144,158],"from":[145,159],"one":[146],"problem":[147],"another.":[149],"Nevertheless,":[150],"we":[151,170],"show":[152],"non-trivial":[157],"slightly":[161],"weaker":[162],"notion":[163],"computation,":[168],"which":[169],"call":[171],")-strict":[174],"secure":[175,232],",":[177,245,247],"mediators.":[184],"desired":[188],"lower":[189,224],"showing":[192],"are":[195],"functions":[196],"on":[197,230],"variables":[199],")-strictly":[205],"securely":[206],"computed":[207],").":[213],"This":[214],"also":[215],"provides":[216],"simple":[218],"alternative":[219],"proof":[220],"well-known":[223],"4":[227,244],"+1":[229],"presence":[236],"up":[238],"malicious":[241],"agents":[242],"8":[246],"10":[248],"].":[249]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}