An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game
We consider in this paper a simple model for human interactions as service providers of different resources over social networks, and study the dynamics of selfish behavior of such social entities using a game-theoretic model known as binary-preference capacitated selfish replication (CSR) game. It...
Uložené v:
| Vydané v: | 2015 54th IEEE Conference on Decision and Control (CDC) s. 3568 - 3573 |
|---|---|
| Hlavní autori: | , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.12.2015
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We consider in this paper a simple model for human interactions as service providers of different resources over social networks, and study the dynamics of selfish behavior of such social entities using a game-theoretic model known as binary-preference capacitated selfish replication (CSR) game. It is known that such games have an associated ordinal potential function, and hence always admit a pure-strategy Nash equilibrium (NE). We study the price of anarchy of such games, and show that it is bounded above by 3; we further provide some instances for which the price of anarchy is at least 2. We also devise a quasi-polynomial algorithm O(n2+ln D) which can find, in a distributed manner, an allocation profile that is within a constant factor of the optimal allocation, and hence of any pure-strategy Nash equilibrium of the game, where the parameters n, and D denote, respectively, the number of players, and the diameter of the network. We further show that when the underlying network has a tree structure, every globally optimal allocation is a Nash equilibrium, which can be reached in only linear time. |
|---|---|
| AbstractList | We consider in this paper a simple model for human interactions as service providers of different resources over social networks, and study the dynamics of selfish behavior of such social entities using a game-theoretic model known as binary-preference capacitated selfish replication (CSR) game. It is known that such games have an associated ordinal potential function, and hence always admit a pure-strategy Nash equilibrium (NE). We study the price of anarchy of such games, and show that it is bounded above by 3; we further provide some instances for which the price of anarchy is at least 2. We also devise a quasi-polynomial algorithm O(n2+ln D) which can find, in a distributed manner, an allocation profile that is within a constant factor of the optimal allocation, and hence of any pure-strategy Nash equilibrium of the game, where the parameters n, and D denote, respectively, the number of players, and the diameter of the network. We further show that when the underlying network has a tree structure, every globally optimal allocation is a Nash equilibrium, which can be reached in only linear time. |
| Author | Basar, Tamer Etesami, Seyed Rasoul |
| Author_xml | – sequence: 1 givenname: Seyed Rasoul surname: Etesami fullname: Etesami, Seyed Rasoul email: etesami1@illinois.edu organization: Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA – sequence: 2 givenname: Tamer surname: Basar fullname: Basar, Tamer email: basar1@illinois.edu organization: Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA |
| BookMark | eNotUMtqwzAQVKE9NGnvhV70A3Yl25HkY3CfEOilPYf1ajcW-CFkH5q_ryE5DTMMw8xsxO04jSTEk1a51qp-aV6bvFB6l9tKFdbqG7HRla1r65xx92LcjxJiTNNfGGAJ08r605TC0g0SRi9jCkhy4pVAwu4seUpy6Ui2YRXOWUzElGhcTQgRMCywkJcz9RzmTiaKfcBL8AkGehB3DP1Mj1fcit_3t5_mMzt8f3w1-0MWip1aMgRulfYWQKGxhbFY6cJ6R-zY29LbQnlkbSoPDo1rK6zQIHEJVDKzL7fi-ZIbiOi4jhjWssfrBeU_THVZBw |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/CDC.2015.7402771 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 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 | Economics |
| EISBN | 1479978868 9781479978861 9781479978847 1479978841 |
| EndPage | 3573 |
| ExternalDocumentID | 7402771 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH CBEJK RIE RIO |
| ID | FETCH-LOGICAL-i250t-cafb01d7aa0c67267c4127d8ef8fd73d720dcf164da8c68b4c4c6cef3ae3fffd3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000381554503120&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Thu Jun 29 18:36:04 EDT 2023 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i250t-cafb01d7aa0c67267c4127d8ef8fd73d720dcf164da8c68b4c4c6cef3ae3fffd3 |
| OpenAccessLink | https://zenodo.org/record/1265939 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_7402771 |
| PublicationCentury | 2000 |
| PublicationDate | 20151201 |
| PublicationDateYYYYMMDD | 2015-12-01 |
| PublicationDate_xml | – month: 12 year: 2015 text: 20151201 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | 2015 54th IEEE Conference on Decision and Control (CDC) |
| PublicationTitleAbbrev | CDC |
| PublicationYear | 2015 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.6019627 |
| Snippet | We consider in this paper a simple model for human interactions as service providers of different resources over social networks, and study the dynamics of... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 3568 |
| SubjectTerms | Capacitated selfish replication game Context Economics Games Nash equilibrium optimal allocation potential function price of anarchy pure Nash equilibrium (NE) quasi-polynomial algorithm Resource management Social network services |
| Title | An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game |
| URI | https://ieeexplore.ieee.org/document/7402771 |
| WOSCitedRecordID | wos000381554503120&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/eLvHCXMwlV1LSwMxEA61CHry0YpvcvDotvue7FGqxVPpQaG3kk0m7UK7W7qt6L93stuuCF68JSEQmEmYbzLzzTD2AIkKPdCeI0J6TWQhPCfVqetESUR4LgpAG1U1m4DRSEwmybjFHhsuDCJWyWfYs8Mqlq8LtbVfZX0IbcSRfJ0DAKi5WvvIo5v0B88Dm6oV9XbbfvVLqczF8OR_B52y7g_vjo8bi3LGWpifs6M9d7jssPwp51UV8M-sphxyuZgV5N_Pl1zmmq9siSBeGJrYC_zFCZJygng8rWi3zqrpKsIVWUllCWaoeYkLk5VzvsYmms1ncold9j58eRu8OruOCU5GUGbjKGlS19Mgpati8GMgRfigBRphNAQafFcrQx6SlkLFIg1VqGKFJpAYGGN0cMHaeZHjJeMi8QnNET4DiWHsuzIlcBZr9P1UixCTK9axcpuu6qIY053Irv9evmHHVjV1Hsgta2_WW7xjh-pjk5Xr-0qT37CSpAc |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da8IwEA_iBu5pHzr2vTzscdU2TZv0cbgNx5z44MA3SZOLFrQVq2P775e02jHYy96SEAjcJdzvcve7Q-iORZJ6THkOp-Y1GQvhObGKXSeIAoPnAp8pLYtmE2ww4ONxNKyh-4oLAwBF8hm07bCI5atMbuxXWYdRG3E0vs5eQCnxSrbWLvboRp3uY9cmawXt7cZfHVMKg_F8-L-jjlDrh3mHh5VNOUY1SE9QY8cezpsofUhxUQf8MylJh1jMp5nx8GcLLFKFl7ZIEM60mdgr_IUNKMUG5OG4IN46y6qvCJbGTkpLMQOFc5jrJJ_hFVTxbDwVC2ih9-enUbfnbHsmOIkBM2tHCh27nmJCuDJkJGRGFYQpDpprxXzFiKukNj6SElyGPKaSylCC9gX4Wmvln6J6mqVwhjCPiMFzBqExATQkrogNPAsVEBIrTiE6R00rt8myLIsx2Yrs4u_lW9Tojd76k_7L4PUSHVg1lVkhV6i-Xm3gGu3Lj3WSr24KrX4DYK-nTg |
| 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=2015+54th+IEEE+Conference+on+Decision+and+Control+%28CDC%29&rft.atitle=An+approximation+algorithm+and+price+of+anarchy+for+the+binary-preference+capacitated+selfish+replication+game&rft.au=Etesami%2C+Seyed+Rasoul&rft.au=Basar%2C+Tamer&rft.date=2015-12-01&rft.pub=IEEE&rft.spage=3568&rft.epage=3573&rft_id=info:doi/10.1109%2FCDC.2015.7402771&rft.externalDocID=7402771 |