Dynamic Resilient Network Games with Applications to Multi-Agent Consensus
A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of the underlying graph of the network system is reduced by an attacker who removes some of the edges whereas the defender attempts to recover the...
Uloženo v:
| Vydáno v: | arXiv.org |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Paper |
| Jazyk: | angličtina |
| Vydáno: |
Ithaca
Cornell University Library, arXiv.org
07.07.2020
|
| Témata: | |
| ISSN: | 2331-8422 |
| 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 | A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of the underlying graph of the network system is reduced by an attacker who removes some of the edges whereas the defender attempts to recover them. Both players are subject to energy constraints so that their actions are restricted and cannot be performed continuously. For this two-stage game, which is played repeatedly over time, we characterize the optimal strategies for the attacker and the defender in terms of edge connectivity and the number of connected components of the graph. The resilient graph game is then applied to a multi-agent consensus problem. We study how the attacks and the recovery on the edges affect the consensus process. Finally, we also provide numerical simulation to illustrate the results. |
|---|---|
| AbstractList | A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of the underlying graph of the network system is reduced by an attacker who removes some of the edges whereas the defender attempts to recover them. Both players are subject to energy constraints so that their actions are restricted and cannot be performed continuously. For this two-stage game, which is played repeatedly over time, we characterize the optimal strategies for the attacker and the defender in terms of edge connectivity and the number of connected components of the graph. The resilient graph game is then applied to a multi-agent consensus problem. We study how the attacks and the recovery on the edges affect the consensus process. Finally, we also provide numerical simulation to illustrate the results. |
| Author | Ishii, Hideaki Zhu, Quanyan Cetinkaya, Ahmet Nugraha, Yurid Hayakawa, Tomohisa |
| Author_xml | – sequence: 1 givenname: Yurid surname: Nugraha fullname: Nugraha, Yurid – sequence: 2 givenname: Ahmet surname: Cetinkaya fullname: Cetinkaya, Ahmet – sequence: 3 givenname: Tomohisa surname: Hayakawa fullname: Hayakawa, Tomohisa – sequence: 4 givenname: Hideaki surname: Ishii fullname: Ishii, Hideaki – sequence: 5 givenname: Quanyan surname: Zhu fullname: Zhu, Quanyan |
| BookMark | eNotjc1Kw0AURgdRsNY-gLsB16l3_pNliFqVqiDdl0lyo1PTScxMrL69EV19cPg454wc-84jIRcMljJVCq7s8OU-lxxALJlQSh6RGReCJank_JQsQtgBANeGKyVm5OH629u9q-gLBtc69JE-YTx0wztd2T0GenDxjeZ937rKRtf5QGNHH8c2uiR__b0XE0MfxnBOThrbBlz875xsbm82xV2yfl7dF_k6sYqbhFkQimuwTYoMKzDa6FI0lQImSgZQy1JzlZXMMKNrCWbimAks61rJrMrEnFz-afuh-xgxxO2uGwc_FbdcpFJPcmnED4UST0E |
| ContentType | Paper |
| Copyright | 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.2003.13554 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central Technology Collection ProQuest One ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic Publicly Available Content Database (ProQuest) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a527-1a035260af8e1ec07676b3fc5013b100d4b6259b17176d407013e93ebdd549c93 |
| IEDL.DBID | BENPR |
| IngestDate | Mon Jun 30 09:22:57 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a527-1a035260af8e1ec07676b3fc5013b100d4b6259b17176d407013e93ebdd549c93 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2384652647?pq-origsite=%requestingapplication% |
| PQID | 2384652647 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2384652647 |
| PublicationCentury | 2000 |
| PublicationDate | 20200707 |
| PublicationDateYYYYMMDD | 2020-07-07 |
| PublicationDate_xml | – month: 07 year: 2020 text: 20200707 day: 07 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2020 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.7275022 |
| SecondaryResourceType | preprint |
| Snippet | A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Computer simulation Cybersecurity Game theory Multiagent systems |
| Title | Dynamic Resilient Network Games with Applications to Multi-Agent Consensus |
| URI | https://www.proquest.com/docview/2384652647 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwED1BCxIT3-KjVB5YrSZxEjsTKtDyIYiiUqEyVbHjSJFQW5JS8fPxuSkgBhbGyEtkW3d-797dAzhPU9QsMkZzk2upn0eCCiEl9VzpOkIHktvequcHHsdiNIqSmnCralnlKibaQJ1NFXLkHZNa_DAw6ZtfzN4oukZhdbW20FiHJk4q8xvQvOzFyeCLZfFCbt7MbFnOtMO7Omn5USzsIFD0fEAbgF9B2GaW_vZ__2kHmkk60-UurOnJHmxaRaeq9uH-euk1Twa6Kl6x65HES8k3uUFlLEEGlnR_1K_JfEpsPy7tYr8VQS9PNMKoDmDY7w2vbmltnEDTwOPUTXHIaeikudCuVg4PeShZrgLz3DMn4GS-RNQjXQPlwswgOqRCI6Zllhm0qCJ2CI3JdKKPgJhk7uQycBX2z2qZy4xpJXwD0qQbauYfQ2u1M-P68lfj7205-Xv5FLY8hK-WLW1BY16-6zPYUIt5UZXt-izbKMd8Ml_J3WPy8gmYI6tr |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8JAEJ4Q0OjJd3yg7kGPG_puORhDRATBhigx3Jrudps00YItovwo_6M7C1XjwRsHz71sOrsz8818Mx_AWRgiZ9E0aSxjLbXiukc9jzFq6EzXPGEzV81WPfZc3_eGw3q_BB_FLAzSKgufqBx1NOJYI6_J0GI5tgzf7uX4haJqFHZXCwmN-bXoitmbhGz5Racp7XtuGK3rwVWbLlQFaGgbLtVD3ADqaGHsCV1wCeNdh5kxt2UuJI-nRRZDSMB0iXOcSMIdrBPWTcGiSEIpjruXpMevWOj8FVPw4aukYziuTNDNee9UbQqrhdl7MlVbR1FgAjUHfnl8FcZaG__sB2xCpR-ORbYFJZFuw6piq_J8B26bszR8Tji5F3nyhBOdxJ_T2ckNsn4JVpdJ40dvnkxGRM0a0wbOkhHUKUWRj3wXBss4_R6U01Eq9oHIREWLma1znA0WLGaRKbhnSQDKdEeY1gFUC0MEi4edB99WOPz78ymstQd3vaDX8btHsG4gTFdV4SqUJ9mrOIYVPp0keXaiLhGBYMk2-wScJAA2 |
| 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%3Ajournal&rft.genre=article&rft.atitle=Dynamic+Resilient+Network+Games+with+Applications+to+Multi-Agent+Consensus&rft.jtitle=arXiv.org&rft.au=Nugraha%2C+Yurid&rft.au=Cetinkaya%2C+Ahmet&rft.au=Hayakawa%2C+Tomohisa&rft.au=Ishii%2C+Hideaki&rft.date=2020-07-07&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2003.13554 |