{"id":"https://openalex.org/W2460060308","doi":null,"title":"Robust Multi-Agent Optimization: Coping with Packet-Dropping Link Failures.","display_name":"Robust Multi-Agent Optimization: Coping with Packet-Dropping Link Failures.","alternate_titles":[],"publication_year":2016,"publication_date":"2016-06-28","ids":{"openalex":"https://openalex.org/W2460060308","mag":"2460060308"},"language":"en","primary_location":{"id":"mag:2460060308","doi":null,"is_oa":true,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr1606.html#SuV16b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2460060308"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dblp.uni-trier.de/db/journals/corr/corr1606.html#SuV16b","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101541239","display_name":"Lili Su","orcid":"https://orcid.org/0000-0003-3538-5679","observed_orcids":["https://orcid.org/0000-0003-3538-5679"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Lili Su","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5042521435","display_name":"Nitin H. Vaidya","orcid":"https://orcid.org/0000-0001-5104-8977","observed_orcids":["https://orcid.org/0000-0001-5104-8977"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Nitin H. Vaidya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.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/T14083","display_name":"Extremum Seeking Control Systems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/multi-agent-optimization","display_name":"multi-agent optimization","score":0.9570000171661377},{"id":"https://openalex.org/keywords/communication-breakdown","display_name":"communication breakdown","score":0.6110000014305115},{"id":"https://openalex.org/keywords/distributed-optimization","display_name":"distributed optimization","score":0.8650000095367432},{"id":"https://openalex.org/keywords/time-varying-communication-networks","display_name":"time-varying communication networks","score":0.8569999933242798},{"id":"https://openalex.org/keywords/sublinear-convergence","display_name":"sublinear convergence","score":0.7580000162124634},{"id":"https://openalex.org/keywords/strongly-connected-networks","display_name":"strongly connected networks","score":0.527999997138977}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6038241386413574},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5516423583030701},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5395085215568542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4967513680458069},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4687407612800598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4098203778266907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39789319038391113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39254647493362427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38707858324050903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3349844813346863},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11280226707458496},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.07731416821479797},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2460060308","doi":null,"is_oa":true,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr1606.html#SuV16b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:2460060308","doi":null,"is_oa":true,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr1606.html#SuV16b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1409984952","https://openalex.org/W1603765807","https://openalex.org/W1970063032","https://openalex.org/W1982131419","https://openalex.org/W2044212084","https://openalex.org/W2059064018","https://openalex.org/W2061761917","https://openalex.org/W2063403497","https://openalex.org/W2066332749","https://openalex.org/W2106901427","https://openalex.org/W2107396783","https://openalex.org/W2110100895","https://openalex.org/W2114791779","https://openalex.org/W2117905067","https://openalex.org/W2119682789","https://openalex.org/W2130388240","https://openalex.org/W2135674292","https://openalex.org/W2137435346","https://openalex.org/W2140655807","https://openalex.org/W2148087609","https://openalex.org/W2151685478","https://openalex.org/W2161305486","https://openalex.org/W2164278908","https://openalex.org/W2165744313","https://openalex.org/W2169167445","https://openalex.org/W2169713291","https://openalex.org/W2179660836","https://openalex.org/W2394881237"],"related_works":["https://openalex.org/W2918946021","https://openalex.org/W2963680015","https://openalex.org/W2963672637","https://openalex.org/W2106901427","https://openalex.org/W3206833741","https://openalex.org/W2235438386","https://openalex.org/W2748049531","https://openalex.org/W3110438728","https://openalex.org/W4394640485"],"abstract_inverted_index":{"We":[0,48,122,145],"study":[1],"the":[2,8,36,50,53,61,71,117,166,174,192,195,209],"problem":[3,119],"of":[4,10,38,116,120,156,168,212],"multi-agent":[5],"optimization":[6,118,127],"in":[7,27,70,82,140],"presence":[9],"communication":[11,21,54,197],"failures,":[12],"where":[13,31,52,163],"agents":[14],"are":[15,25,64],"connected":[16,20],"by":[17],"a":[18,113,124,153,181],"strongly":[19],"network.":[22],"Specifically,":[23],"we":[24],"interested":[26],"optimizing":[28],"$h(x)=\\frac{1}{n}\\sum_{i=1}^n":[29],"h_i(x)$,":[30],"$\\mathcal{V}=\\{1,":[32],"\\ldots,":[33],"n\\}$":[34],"is":[35,42,77,93,106,165,199],"set":[37],"agents,":[39],"and":[40,142,202],"$h_i(\\cdot)$":[41],"agent":[43,131,205],"$i$'s":[44],"local":[45,134,149],"cost":[46],"function.":[47],"consider":[49],"scenario":[51],"links":[55,215],"may":[56],"suffer":[57],"packet-dropping":[58],"failures":[59],"(i.e.,":[60],"sent":[62],"messages":[63],"not":[65,107,207],"guaranteed":[66,108],"to":[67,152],"be":[68],"delivered":[69],"same":[72],"iteration),":[73],"but":[74],"each":[75,130,204,217],"link":[76],"reliable":[78,213],"at":[79,159,216],"least":[80],"once":[81],"every":[83],"$B$":[84],"consecutive":[85],"message":[86,103],"transmissions.":[87],"This":[88],"bounded":[89],"time":[90,200],"reliability":[91],"assumption":[92],"reasonable":[94],"since":[95],"it":[96],"has":[97],"been":[98],"shown":[99],"that":[100,147,194,203],"with":[101,180],"unbounded":[102],"delays,":[104],"convergence":[105,160],"for":[109],"reaching":[110],"consensus":[111,184],"--":[112],"special":[114],"case":[115],"interest.":[121],"propose":[123],"robust":[125,182],"distributed":[126],"algorithm":[128,172],"wherein":[129],"updates":[132],"its":[133],"estimate":[135],"using":[136],"slightly":[137],"different":[138],"routines":[139],"odd":[141],"even":[143],"iterations.":[144],"show":[146],"these":[148],"estimates":[150],"converge":[151],"common":[154],"optimum":[155],"$h(\\cdot)$":[157],"sub-linearly":[158],"rate":[161],"$O(\\frac{1}{\\sqrt{t}})$,":[162],"$t$":[164],"number":[167,211],"iteration.":[169,218],"Our":[170],"proposed":[171],"combines":[173],"Push-Sum":[175],"Distributed":[176],"Dual":[177],"Averaging":[178],"method":[179],"average":[183],"algorithm.":[185],"The":[186],"main":[187],"analysis":[188],"challenges":[189],"come":[190],"from":[191],"fact":[193],"effective":[196],"network":[198],"varying,":[201],"does":[206],"know":[208],"actual":[210],"outgoing":[214]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2460060308","counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-07-22T00:00:00"}
