{"id":"https://openalex.org/W2500565968","doi":"https://doi.org/10.1109/acc.2016.7526806","title":"Multi-agent optimization in the presence of Byzantine adversaries: Fundamental limits","display_name":"Multi-agent optimization in the presence of Byzantine adversaries: Fundamental limits","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2500565968","doi":"https://doi.org/10.1109/acc.2016.7526806","mag":"2500565968"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2016.7526806","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2016.7526806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 American Control Conference (ACC)","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/A5101541239","display_name":"Lili Su","orcid":"https://orcid.org/0000-0003-3538-5679"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lili Su","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign (UIUC), Urbana, Illinois, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign (UIUC), Urbana, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042521435","display_name":"Nitin H. Vaidya","orcid":"https://orcid.org/0000-0001-5104-8977"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nitin Vaidya","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign (UIUC), Urbana, Illinois, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign (UIUC), Urbana, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101541239"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":3.4744,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.93170351,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"7183","last_page":"7188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6063404679298401},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5852203369140625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5786460638046265},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.5526269674301147},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5099703073501587},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.4827101230621338},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4654797911643982},{"id":"https://openalex.org/keywords/byzantine-architecture","display_name":"Byzantine architecture","score":0.4540491998195648},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42690083384513855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3227892220020294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28644227981567383},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2490030825138092}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6063404679298401},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5852203369140625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5786460638046265},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.5526269674301147},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5099703073501587},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.4827101230621338},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4654797911643982},{"id":"https://openalex.org/C104562893","wikidata":"https://www.wikidata.org/wiki/Q47591","display_name":"Byzantine architecture","level":2,"score":0.4540491998195648},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42690083384513855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3227892220020294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28644227981567383},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2490030825138092},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C195244886","wikidata":"https://www.wikidata.org/wiki/Q41493","display_name":"Ancient history","level":1,"score":0.0},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2016.7526806","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2016.7526806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W330173850","https://openalex.org/W1510375514","https://openalex.org/W1603765807","https://openalex.org/W1970063032","https://openalex.org/W1981017197","https://openalex.org/W1999197902","https://openalex.org/W2021482754","https://openalex.org/W2025375132","https://openalex.org/W2029080014","https://openalex.org/W2044212084","https://openalex.org/W2046135376","https://openalex.org/W2063403497","https://openalex.org/W2106901427","https://openalex.org/W2124541940","https://openalex.org/W2126906505","https://openalex.org/W2126924915","https://openalex.org/W2148087609","https://openalex.org/W2157462866","https://openalex.org/W2164278908","https://openalex.org/W2611515161","https://openalex.org/W3004511899","https://openalex.org/W3101665129","https://openalex.org/W3106753174","https://openalex.org/W3122377489","https://openalex.org/W3137092842","https://openalex.org/W3141595720","https://openalex.org/W4292363360","https://openalex.org/W4394661609","https://openalex.org/W6642976024","https://openalex.org/W6683124362","https://openalex.org/W6864698120"],"related_works":["https://openalex.org/W1698117324","https://openalex.org/W4290996430","https://openalex.org/W4210453042","https://openalex.org/W2997526278","https://openalex.org/W2109232026","https://openalex.org/W2775054947","https://openalex.org/W2146384899","https://openalex.org/W603186994","https://openalex.org/W2982377743","https://openalex.org/W2126087831"],"abstract_inverted_index":{"We":[0,198],"study":[1],"multi-agent":[2,84],"optimization":[3],"problem":[4,252],"in":[5],"the":[6,41,59,80,88,115,137,151,157,166,172,183,193,201,220,267],"presence":[7],"of":[8,25,61,79,99,109,142,153,161,174,203,223],"Byzantine":[9,28,83,154,224,238],"adversaries,":[10],"where":[11,56,217,253],"each":[12,175],"agent":[13],"i":[14,127],"has":[15],"a":[16,35,76,100,106,180,250],"local":[17,42,110,176],"cost":[18,43,102,111,177],"function":[19,103,178],"hi(x),":[20,55],"and":[21,136,187],"some":[22],"unknown":[23],"subset":[24],"agents":[26],"suffer":[27],"faults.":[29],"The":[30],"goal":[31,70,89],"is":[32,58,71,90,96,139,179,185,189,211,219],"to":[33,49,91,261],"optimize":[34,50],"global":[36,101],"objective":[37],"that":[38,67,95,131,171,200,207,231],"properly":[39],"aggregates":[40],"functions.":[44],"Ideally,":[45],"we":[46,65,74,148,169,228],"would":[47],"like":[48],"1":[51],"over":[52],"|N|":[53,214],"\u03a3i\u03f5N":[54,132,143],"N":[57,129],"set":[60],"non-faulty":[62,116],"agents.":[63,117,197,226],"However,":[64],"show":[66,199],"this":[68,146,233],"ideal":[69],"unachievable.":[72],"Therefore,":[73],"define":[75],"relaxed":[77],"version":[78],"problem,":[81],"named":[82],"optimization,":[85],"for":[86,126,240],"which":[87,259],"generate":[92],"an":[93,97,140],"output":[94,138],"optimum":[98,141],"formed":[104],"as":[105],"convex":[107],"combination":[108],"functions":[112,257,263],"kept":[113],"by":[114,266],"More":[118],"precisely,":[119],"there":[120,188,254],"must":[121],"exist":[122],"nonnegative":[123],"weights":[124,205],"\u03b1i":[125,133],"\u03f5":[128],"such":[130],"=":[134],"1,":[135],"\u03b1ihi(x).":[144],"In":[145],"paper,":[147],"focus":[149],"on":[150,156,192],"impact":[152],"attacks":[155],"maximal":[158],"achievable":[159],"number":[160,202,222],"nonzero":[162,204],"weights.":[163],"To":[164],"characterize":[165],"fundamental":[167],"limits,":[168],"assume":[170],"argument":[173],"(real-valued)":[181],"scalar,":[182],"network":[184],"fully-connected,":[186],"no":[190],"restriction":[191],"information":[194,241],"exchange":[195,242],"among":[196,258],"(\u03b1i's)":[206],"can":[208],"be":[209],"guaranteed":[210],"at":[212],"most":[213],"-":[215],"f,":[216],"f":[218,262],"maximum":[221],"faulty":[225],"Additionally,":[227],"present":[229],"algorithms":[230,247],"achieve":[232],"upper":[234],"bound.":[235],"By":[236],"exploiting":[237],"broadcast":[239],"between":[243],"agents,":[244],"our":[245],"proposed":[246],"essentially":[248],"solve":[249],"centralized":[251],"are":[255,264],"n":[256],"up":[260],"injected":[265],"system":[268],"adversary.":[269]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}