Asynchronous distributed algorithm for seeking generalized Nash equilibria
In this paper, we propose an asynchronous distributed algorithm with delayed information for computing a generalized Nash equilibrium over multi-agent systems. We consider a game where all players' local decisions are coupled via a shared affine constraint. We assume each player can only access...
Uloženo v:
| Vydáno v: | 2018 European Control Conference (ECC) s. 2164 - 2169 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
European Control Association (EUCA)
01.06.2018
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper, we propose an asynchronous distributed algorithm with delayed information for computing a generalized Nash equilibrium over multi-agent systems. We consider a game where all players' local decisions are coupled via a shared affine constraint. We assume each player can only access its local objective function, local constraint, and a local block matrix of the affine constraint. With the help of auxiliary edge variables and edge Laplacian matrix, each player can perform its local iteration in an asynchronous manner, using only local data and possibly delayed neighbour information, without any centralized clock coordination. Therefore, the algorithm fully exploits the local computation resource of each player, and reduces the idle time due to waiting for the "slowest" agent. The algorithm convergence is shown using asynchronous fixed-point iterations. Numerical studies verify its convergence. |
|---|---|
| AbstractList | In this paper, we propose an asynchronous distributed algorithm with delayed information for computing a generalized Nash equilibrium over multi-agent systems. We consider a game where all players' local decisions are coupled via a shared affine constraint. We assume each player can only access its local objective function, local constraint, and a local block matrix of the affine constraint. With the help of auxiliary edge variables and edge Laplacian matrix, each player can perform its local iteration in an asynchronous manner, using only local data and possibly delayed neighbour information, without any centralized clock coordination. Therefore, the algorithm fully exploits the local computation resource of each player, and reduces the idle time due to waiting for the "slowest" agent. The algorithm convergence is shown using asynchronous fixed-point iterations. Numerical studies verify its convergence. |
| Author | Yi, Peng Pavel, Lacra |
| Author_xml | – sequence: 1 givenname: Peng surname: Yi fullname: Yi, Peng organization: Department of Electrical and Systems Engineering, Washington University in St. Louis, USA – sequence: 2 givenname: Lacra surname: Pavel fullname: Pavel, Lacra organization: Department of Electrical and Computer Engineering, University of Toronto, Canada |
| BookMark | eNotj7tOwzAAAI0EElDyAYjFP5Dg92OsokJBFSwwV44fiSF1wE6G8vUg0emW00l3Dc7TlDwAtxg1hGqs7zdt2xCEVaM4R5TiM1BpqajmhBGhFbkEVSkfCCEiFGWMXYHndTkmO-QpTUuBLpY5x26ZvYNm7Kcc5-EAw5Rh8f4zph72PvlsxvjzZ7yYMkD_vcQxdjmaG3ARzFh8deIKvD9s3tptvXt9fGrXuzpiyec6MCqsDCzYYLHAXAoUsO2EdAFxR5UV3DCrre5MCEhawbyTzlLXUcqxsHQF7v670Xu__8rxYPJxfzqmv7C9T5g |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.23919/ECC.2018.8550331 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9783952426982 3952426989 |
| EndPage | 2169 |
| ExternalDocumentID | 8550331 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IL 6IN AAJGR AAWTH ABLEC ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-i175t-f436c7f4fcfc1615760f1cb67df05d38c65a4c9c9baff07c64ed7dc3db33516c3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000467725302032&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:51:20 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-f436c7f4fcfc1615760f1cb67df05d38c65a4c9c9baff07c64ed7dc3db33516c3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_8550331 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-June |
| PublicationDateYYYYMMDD | 2018-06-01 |
| PublicationDate_xml | – month: 06 year: 2018 text: 2018-June |
| PublicationDecade | 2010 |
| PublicationTitle | 2018 European Control Conference (ECC) |
| PublicationTitleAbbrev | ECC |
| PublicationYear | 2018 |
| Publisher | European Control Association (EUCA) |
| Publisher_xml | – name: European Control Association (EUCA) |
| SSID | ssj0002683444 |
| Score | 1.7172025 |
| Snippet | In this paper, we propose an asynchronous distributed algorithm with delayed information for computing a generalized Nash equilibrium over multi-agent systems.... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 2164 |
| SubjectTerms | Convergence Couplings Distributed algorithms Games Linear programming Nash equilibrium Symmetric matrices |
| Title | Asynchronous distributed algorithm for seeking generalized Nash equilibria |
| URI | https://ieeexplore.ieee.org/document/8550331 |
| WOSCitedRecordID | wos000467725302032&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGA5zeNCLH5v4TQ4e7dY2aT6OMjbEw9hBYbeRvnmzFbTTtRP019u0Yyp48RZCQuDN4Xk_n4eQGyUYB0-FWEGPDbjRLFAoXBABlzyJUTGT1mITcjxW06metMjtdhYGEevmM-z5ZV3Lt0tY-1RZ35NvMT80vSOlaGa1tvmUWHjFCN4ULmOmI90fDga-d0v1Nvd-CajU-DE6-N_Lh6T7PYhHJ1uIOSItzI_J_g8OwQ55uCs-cvAUt1UMT63nwfUSVmipeZ4vq9B_8UIrx5QWiD4rTucNz3T2WZ0Ym2JB8W2d1Y3_pkueRsPHwX2wEUgIsgr1y8BxJkA67sCB99ykCF0EqZDWhYllCkRiOGjQqXEulCA4WmmB2ZSxJBLATkg7X-Z4SijaNMTURMYZ4DEXKjRaYmgFGsEsY2ek460ye204MGYbg5z_vX1B9rzhm5aqS9IuV2u8IrvwXmbF6rr-uC_kx5wf |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGA5jCurFj038NgePdmubNGmPMhxTZ9lhwm4jffNmK2in6ybor7dpx1Tw4i2EhMCbw_N-Pg8hV6FgHCwVYgE92uEqYk6IwjgecMkDH0OmklJsQsZxOBpFgxq5Xs_CIGLZfIYtuyxr-XoGS5sqa1vyLWaHpjcCzn23mtZaZ1R8YTUjeFW69FnkRe3bTsd2b4Wt1c1fEiolgnR3__f2Hml-j-LRwRpk9kkNswOy84NFsEHub_KPDCzJbRHFU22ZcK2IFWqqniezIvifvtDCNaU5os2L00nFNJ1-FidilU8pvi3TsvVfNclT93bY6TkriQQnLXB_4RjOBEjDDRiwvpsUrvEgEVIbN9AsBBEoDhFEiTLGlSA4aqmB6YSxwBPADkk9m2V4RCjqxMVEecoo4D4Xoasiia4WqATTjB2ThrXK-LViwRivDHLy9_Yl2eoNH_vj_l38cEq27SdUDVZnpL6YL_GcbML7Is3nF-UnfgEvz59m |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2018+European+Control+Conference+%28ECC%29&rft.atitle=Asynchronous+distributed+algorithm+for+seeking+generalized+Nash+equilibria&rft.au=Yi%2C+Peng&rft.au=Pavel%2C+Lacra&rft.date=2018-06-01&rft.pub=European+Control+Association+%28EUCA%29&rft.spage=2164&rft.epage=2169&rft_id=info:doi/10.23919%2FECC.2018.8550331&rft.externalDocID=8550331 |