Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We study the price of anarchy of such games, and show that it is bounded above by 3. We develop a quasi-polynomial algorithm O(n2+lnD), where n is the number of players and D is the...
Saved in:
| Published in: | Automatica (Oxford) Vol. 76; pp. 153 - 163 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.02.2017
|
| Subjects: | |
| ISSN: | 0005-1098, 1873-2836 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We study the price of anarchy of such games, and show that it is bounded above by 3. We develop a quasi-polynomial algorithm O(n2+lnD), where n is the number of players and D is the diameter of the network, 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 (NE) of the game. Proof of this result uses a novel potential function. We further show that when the underlying network has a tree structure, every globally optimal allocation is an NE, which can be reached in only linear time. We formulate the optimal solutions and NE points of the CSR game using integer linear programs. Finally, we introduce the LCSR game as a localized version of the CSR game, wherein the actions of the players are restricted to only their close neighborhoods. |
|---|---|
| AbstractList | We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We study the price of anarchy of such games, and show that it is bounded above by 3. We develop a quasi-polynomial algorithm O(n2+lnD), where n is the number of players and D is the diameter of the network, 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 (NE) of the game. Proof of this result uses a novel potential function. We further show that when the underlying network has a tree structure, every globally optimal allocation is an NE, which can be reached in only linear time. We formulate the optimal solutions and NE points of the CSR game using integer linear programs. Finally, we introduce the LCSR game as a localized version of the CSR game, wherein the actions of the players are restricted to only their close neighborhoods. |
| Author | Başar, Tamer Etesami, Seyed Rasoul |
| Author_xml | – sequence: 1 givenname: Seyed Rasoul surname: Etesami fullname: Etesami, Seyed Rasoul email: etesami1@illinois.edu – sequence: 2 givenname: Tamer surname: Başar fullname: Başar, Tamer email: basar1@illinois.edu |
| BookMark | eNqNkN9KwzAUh4NMcJu-Q16gNWm6Nr0RdPgPBnqh1yFNTtaMrilJFPf2plMQvNGLcDgnOR-_fAs0G9wACGFKckpodbnL5Vt0exmtknmRJmmcE1KcoDnlNcsKzqoZmhNCVhklDT9DixB2qS0pL-ZoePZWAXYGy0F61R1S1elgOY7efdgJ7FLXb523sdtj4zyOHeDWpveHbPRgwMOQGEqOUtkoI2gcoDc2dNjD2KdgR8ZW7uEcnRrZB7j4rkv0enf7sn7INk_3j-vrTaYY5TGjlayl5m0rmSaqAmBlxZQuWKMpkaxZ1QRKs2porXldGV2qkreGkLqpSwqsYkt09cVV3oWQMopjshQjeml7QYmY7Imd-LEnJnvTTbKXAPwXYPRJhj_8Z_XmaxXSB98teBGUnQxp60FFoZ39G_IJEpGVhA |
| CitedBy_id | crossref_primary_10_1007_s00224_019_09939_7 crossref_primary_10_1137_19M1242525 |
| Cites_doi | 10.1023/B:GRUP.0000003745.98183.8d 10.1145/1455248.1455249 10.1109/TAC.2005.858687 10.1006/game.1996.0027 10.1006/game.1996.0044 10.1109/JSAC.2006.872884 10.1109/TPDS.2006.171 10.1109/JSAC.2012.121211 10.2307/1969503 10.1109/CDC.2015.7402771 10.1287/moor.1040.0098 10.1080/00029890.1971.11992886 10.1109/ALLERTON.2014.7028557 |
| ContentType | Journal Article |
| Copyright | 2016 Elsevier Ltd |
| Copyright_xml | – notice: 2016 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.automatica.2016.10.002 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1873-2836 |
| EndPage | 163 |
| ExternalDocumentID | 10_1016_j_automatica_2016_10_002 S0005109816303934 |
| GrantInformation_xml | – fundername: AFOSR MURI grantid: FA 9550-10-1-0573 – fundername: NSF grantid: CCF 11-11342 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 3R3 4.4 457 4G. 5GY 5VS 6TJ 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABDEX ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACBEA ACDAQ ACGFO ACGFS ACNNM ACRLP ADBBV ADEZE ADIYS ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHPGS AI. AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ RXW SBC SDF SDG SDP SES SET SEW SPC SPCBC SSB SSD SST SSZ T5K T9H TAE TN5 VH1 WH7 WUQ X6Y XFK XPP ZMT ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABUFD ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c318t-16a7ad8bba3d0c6ee3463cd239d10a39570e4f5917d876fd4c48bf0079741e363 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000392788100019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0005-1098 |
| IngestDate | Sat Nov 29 07:29:11 EST 2025 Tue Nov 18 22:43:14 EST 2025 Fri Feb 23 02:23:48 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Capacitated selfish replication game Quasi-polynomial algorithm Potential function Optimal allocation Pure Nash equilibrium (NE) Price of anarchy |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c318t-16a7ad8bba3d0c6ee3463cd239d10a39570e4f5917d876fd4c48bf0079741e363 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_automatica_2016_10_002 crossref_primary_10_1016_j_automatica_2016_10_002 elsevier_sciencedirect_doi_10_1016_j_automatica_2016_10_002 |
| PublicationCentury | 2000 |
| PublicationDate | February 2017 2017-02-00 |
| PublicationDateYYYYMMDD | 2017-02-01 |
| PublicationDate_xml | – month: 02 year: 2017 text: February 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | Automatica (Oxford) |
| PublicationYear | 2017 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Nisan, Roughgarden, Tardos, Vazirani (br000125) 2007 Dilworth (br000030) 1950 (pp. 3621–3626). Vetta (br000145) 2002 Etesami, Seyed Rasoul, & Başar, Tamer (2015). An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game. In Laoutaris, Telelis, Zissimopoulos, Stavrakakis (br000085) 2006; 17 Monderer, Shapley (br000120) 1996; 14 Chun, Chaudhuri, Wee, Barreno, Papadimitriou, Kubiatowicz (br000020) 2004 Ghosh, Muthukrishnan (br000055) 1994 Anantharam (br000010) 2004 Etesami, Seyed Rasoul, & Başar, Tamer (2014). Pure Nash equilibrium in a binary capacitated resource allocation game. ArXiv Preprint Maheswaran, Başar (br000090) 2001 Maheswaran, Başar (br000095) 2003; 12 Goemans, Li, Mirrokni, Thottan (br000060) 2006; 24 Milchtaich (br000110) 1996; 13 Friedman, Halpern, Kash (br000050) 2006 Goyal, Vega-Redondo (br000070) 2000 Masucci, Antonia Maria, & Silva, Alonso (2014). Strategic resource allocation for competitive influence in social networks. ArXiv Preprint Fabrikant, Papadimitriou, Talwar (br000045) 2004 Koutsoupias, Papadimitriou (br000080) 1999 Panagopoulou, Spirakis (br000135) 2008 . Gopalakrishnan, Kanoulas, Karuturi, Pandu Rangan, Rajaraman, Sundaram (br000065) 2012 Marden, Roughgarden (br000100) 2010 Pacifici, Dan (br000130) 2012; 30 Correa, Schulz, Stier-Moses (br000025) 2004; 29 Johari, Mannor, Tsitsiklis (br000075) 2005; 50 Pollatos, Telelis, Zissimopoulos (br000140) 2008 Ackermann, Röglin, Vöcking (br000005) 2008; 55 Caragiannis, Flammini, Kaklamanis, Kanellopoulos, Moscardelli (br000015) 2006 Mirsky (br000115) 1971 Dilworth (10.1016/j.automatica.2016.10.002_br000030) 1950 10.1016/j.automatica.2016.10.002_br000035 Maheswaran (10.1016/j.automatica.2016.10.002_br000090) 2001 Fabrikant (10.1016/j.automatica.2016.10.002_br000045) 2004 Chun (10.1016/j.automatica.2016.10.002_br000020) 2004 Maheswaran (10.1016/j.automatica.2016.10.002_br000095) 2003; 12 Panagopoulou (10.1016/j.automatica.2016.10.002_br000135) 2008 Anantharam (10.1016/j.automatica.2016.10.002_br000010) 2004 Ackermann (10.1016/j.automatica.2016.10.002_br000005) 2008; 55 Marden (10.1016/j.automatica.2016.10.002_br000100) 2010 Pollatos (10.1016/j.automatica.2016.10.002_br000140) 2008 Koutsoupias (10.1016/j.automatica.2016.10.002_br000080) 1999 Pacifici (10.1016/j.automatica.2016.10.002_br000130) 2012; 30 Johari (10.1016/j.automatica.2016.10.002_br000075) 2005; 50 Monderer (10.1016/j.automatica.2016.10.002_br000120) 1996; 14 Gopalakrishnan (10.1016/j.automatica.2016.10.002_br000065) 2012 Correa (10.1016/j.automatica.2016.10.002_br000025) 2004; 29 10.1016/j.automatica.2016.10.002_br000105 Laoutaris (10.1016/j.automatica.2016.10.002_br000085) 2006; 17 10.1016/j.automatica.2016.10.002_br000040 Ghosh (10.1016/j.automatica.2016.10.002_br000055) 1994 Vetta (10.1016/j.automatica.2016.10.002_br000145) 2002 Goyal (10.1016/j.automatica.2016.10.002_br000070) 2000 Milchtaich (10.1016/j.automatica.2016.10.002_br000110) 1996; 13 Caragiannis (10.1016/j.automatica.2016.10.002_br000015) 2006 Mirsky (10.1016/j.automatica.2016.10.002_br000115) 1971 Friedman (10.1016/j.automatica.2016.10.002_br000050) 2006 Goemans (10.1016/j.automatica.2016.10.002_br000060) 2006; 24 Nisan (10.1016/j.automatica.2016.10.002_br000125) 2007 |
| References_xml | – start-page: 140 year: 2006 end-page: 149 ident: br000050 article-title: Efficiency and Nash equilibria in a scrip system for P2P networks publication-title: Proceedings of the 7th ACM conference on electronic commerce – volume: 55 start-page: 25 year: 2008 ident: br000005 article-title: On the impact of combinatorial structure on congestion games publication-title: Journal of the ACM – start-page: 4565 year: 2001 end-page: 4570 ident: br000090 article-title: Decentralized network resource allocation as a repeated noncooperative market game publication-title: Proceedings of the 40th IEEE conference on decision and control, 2001, Vol. 5 – year: 2007 ident: br000125 article-title: Algorithmic game theory, Vol. 1 – reference: Etesami, Seyed Rasoul, & Başar, Tamer (2015). An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game. In – start-page: 183 year: 2008 end-page: 195 ident: br000135 article-title: A game theoretic approach for efficient graph coloring publication-title: Algorithms and computation – start-page: 420 year: 2012 end-page: 432 ident: br000065 article-title: Cache me if you can: capacitated selfish replication games publication-title: LATIN 2012: theoretical informatics – volume: 17 start-page: 1401 year: 2006 end-page: 1413 ident: br000085 article-title: Distributed selfish replication publication-title: IEEE Transactions on Parallel and Distributed Systems – volume: 12 start-page: 361 year: 2003 end-page: 395 ident: br000095 article-title: Nash equilibrium and decentralized negotiation in auctioning divisible resources publication-title: Group Decision and Negotiation – start-page: 2233 year: 2010 end-page: 2238 ident: br000100 article-title: Generalized efficiency bounds in distributed resource allocation publication-title: 2010 49th IEEE conference on decision and control – volume: 13 start-page: 111 year: 1996 end-page: 124 ident: br000110 article-title: Congestion games with player-specific payoff functions publication-title: Games and Economic Behavior – start-page: 195 year: 2008 end-page: 206 ident: br000140 article-title: On the social cost of distributed selfish content replication publication-title: NETWORKING 2008 ad hoc and sensor networks, wireless networks, next generation Internet – volume: 14 start-page: 124 year: 1996 end-page: 143 ident: br000120 article-title: Potential games publication-title: Games and Economic Behavior – start-page: 604 year: 2004 end-page: 612 ident: br000045 article-title: The complexity of pure Nash equilibria publication-title: Proceedings of the thirty-sixth annual ACM symposium on theory of computing – start-page: 4673 year: 2004 end-page: 4678 ident: br000010 article-title: On the Nash dynamics of congestion games with player-specific utility publication-title: 43rd IEEE conference on decision and control, 2004. CDC, Vol. 5 – volume: 24 start-page: 1020 year: 2006 end-page: 1033 ident: br000060 article-title: Market sharing games applied to content distribution in ad hoc networks publication-title: IEEE Journal on Selected Areas in Communications – start-page: 416 year: 2002 end-page: 425 ident: br000145 article-title: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions publication-title: The 43rd annual IEEE symposium on foundations of computer science, 2002. Proceedings – start-page: 876 year: 1971 end-page: 877 ident: br000115 article-title: A dual of Dilworth’s decomposition theorem publication-title: American Mathematical Monthly – reference: Etesami, Seyed Rasoul, & Başar, Tamer (2014). Pure Nash equilibrium in a binary capacitated resource allocation game. ArXiv Preprint – start-page: 21 year: 2004 end-page: 30 ident: br000020 article-title: Selfish caching in distributed systems: a game-theoretic analysis publication-title: Proceedings of the twenty-third annual ACM symposium on principles of distributed computing – volume: 30 start-page: 2190 year: 2012 end-page: 2199 ident: br000130 article-title: Convergence in player-specific graphical resource allocation games publication-title: IEEE Journal on Selected Areas in Communications – reference: . – start-page: 161 year: 1950 end-page: 166 ident: br000030 article-title: A decomposition theorem for partially ordered sets publication-title: Annals of Mathematics – start-page: 226 year: 1994 end-page: 235 ident: br000055 article-title: Dynamic load balancing in parallel and distributed networks by random matchings publication-title: Proceedings of the sixth annual ACM symposium on parallel algorithms and architectures – start-page: 311 year: 2006 end-page: 322 ident: br000015 article-title: Tight bounds for selfish and greedy load balancing. publication-title: Automata, languages and programming – volume: 50 start-page: 1712 year: 2005 end-page: 1724 ident: br000075 article-title: Efficiency loss in a network resource allocation game: the case of elastic supply publication-title: IEEE Transactions on Automatic Control – start-page: 404 year: 1999 end-page: 413 ident: br000080 article-title: Worst-case equilibria publication-title: STACS 99 – year: 2000 ident: br000070 article-title: Learning, network formation and coordination. Technical Report – reference: (pp. 3621–3626). – volume: 29 start-page: 961 year: 2004 end-page: 976 ident: br000025 article-title: Selfish routing in capacitated networks publication-title: Mathematics of Operations Research – reference: Masucci, Antonia Maria, & Silva, Alonso (2014). Strategic resource allocation for competitive influence in social networks. ArXiv Preprint – start-page: 604 year: 2004 ident: 10.1016/j.automatica.2016.10.002_br000045 article-title: The complexity of pure Nash equilibria – start-page: 416 year: 2002 ident: 10.1016/j.automatica.2016.10.002_br000145 article-title: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions – start-page: 2233 year: 2010 ident: 10.1016/j.automatica.2016.10.002_br000100 article-title: Generalized efficiency bounds in distributed resource allocation – start-page: 195 year: 2008 ident: 10.1016/j.automatica.2016.10.002_br000140 article-title: On the social cost of distributed selfish content replication – year: 2000 ident: 10.1016/j.automatica.2016.10.002_br000070 – volume: 12 start-page: 361 issue: 5 year: 2003 ident: 10.1016/j.automatica.2016.10.002_br000095 article-title: Nash equilibrium and decentralized negotiation in auctioning divisible resources publication-title: Group Decision and Negotiation doi: 10.1023/B:GRUP.0000003745.98183.8d – start-page: 140 year: 2006 ident: 10.1016/j.automatica.2016.10.002_br000050 article-title: Efficiency and Nash equilibria in a scrip system for P2P networks – start-page: 4673 year: 2004 ident: 10.1016/j.automatica.2016.10.002_br000010 article-title: On the Nash dynamics of congestion games with player-specific utility – volume: 55 start-page: 25 issue: 6 year: 2008 ident: 10.1016/j.automatica.2016.10.002_br000005 article-title: On the impact of combinatorial structure on congestion games publication-title: Journal of the ACM doi: 10.1145/1455248.1455249 – volume: 50 start-page: 1712 issue: 11 year: 2005 ident: 10.1016/j.automatica.2016.10.002_br000075 article-title: Efficiency loss in a network resource allocation game: the case of elastic supply publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2005.858687 – volume: 13 start-page: 111 issue: 1 year: 1996 ident: 10.1016/j.automatica.2016.10.002_br000110 article-title: Congestion games with player-specific payoff functions publication-title: Games and Economic Behavior doi: 10.1006/game.1996.0027 – volume: 14 start-page: 124 issue: 1 year: 1996 ident: 10.1016/j.automatica.2016.10.002_br000120 article-title: Potential games publication-title: Games and Economic Behavior doi: 10.1006/game.1996.0044 – volume: 24 start-page: 1020 issue: 5 year: 2006 ident: 10.1016/j.automatica.2016.10.002_br000060 article-title: Market sharing games applied to content distribution in ad hoc networks publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/JSAC.2006.872884 – start-page: 420 year: 2012 ident: 10.1016/j.automatica.2016.10.002_br000065 article-title: Cache me if you can: capacitated selfish replication games – start-page: 311 year: 2006 ident: 10.1016/j.automatica.2016.10.002_br000015 article-title: Tight bounds for selfish and greedy load balancing. – ident: 10.1016/j.automatica.2016.10.002_br000035 – volume: 17 start-page: 1401 issue: 12 year: 2006 ident: 10.1016/j.automatica.2016.10.002_br000085 article-title: Distributed selfish replication publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2006.171 – year: 2007 ident: 10.1016/j.automatica.2016.10.002_br000125 – volume: 30 start-page: 2190 issue: 11 year: 2012 ident: 10.1016/j.automatica.2016.10.002_br000130 article-title: Convergence in player-specific graphical resource allocation games publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/JSAC.2012.121211 – start-page: 161 year: 1950 ident: 10.1016/j.automatica.2016.10.002_br000030 article-title: A decomposition theorem for partially ordered sets publication-title: Annals of Mathematics doi: 10.2307/1969503 – ident: 10.1016/j.automatica.2016.10.002_br000040 doi: 10.1109/CDC.2015.7402771 – start-page: 226 year: 1994 ident: 10.1016/j.automatica.2016.10.002_br000055 article-title: Dynamic load balancing in parallel and distributed networks by random matchings – volume: 29 start-page: 961 issue: 4 year: 2004 ident: 10.1016/j.automatica.2016.10.002_br000025 article-title: Selfish routing in capacitated networks publication-title: Mathematics of Operations Research doi: 10.1287/moor.1040.0098 – start-page: 876 year: 1971 ident: 10.1016/j.automatica.2016.10.002_br000115 article-title: A dual of Dilworth’s decomposition theorem publication-title: American Mathematical Monthly doi: 10.1080/00029890.1971.11992886 – start-page: 404 year: 1999 ident: 10.1016/j.automatica.2016.10.002_br000080 article-title: Worst-case equilibria – start-page: 21 year: 2004 ident: 10.1016/j.automatica.2016.10.002_br000020 article-title: Selfish caching in distributed systems: a game-theoretic analysis – start-page: 183 year: 2008 ident: 10.1016/j.automatica.2016.10.002_br000135 article-title: A game theoretic approach for efficient graph coloring – ident: 10.1016/j.automatica.2016.10.002_br000105 doi: 10.1109/ALLERTON.2014.7028557 – start-page: 4565 year: 2001 ident: 10.1016/j.automatica.2016.10.002_br000090 article-title: Decentralized network resource allocation as a repeated noncooperative market game |
| SSID | ssj0004182 |
| Score | 2.2526786 |
| Snippet | We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We study the price of anarchy of such... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 153 |
| SubjectTerms | Capacitated selfish replication game Optimal allocation Potential function Price of anarchy Pure Nash equilibrium (NE) Quasi-polynomial algorithm |
| Title | Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game |
| URI | https://dx.doi.org/10.1016/j.automatica.2016.10.002 |
| Volume | 76 |
| WOSCitedRecordID | wos000392788100019&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 | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-2836 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004182 issn: 0005-1098 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZKxwEOEz_FGCAf2KnKlMROnIhTmToBQhNiBfUWOY6zdeqSKs2m7safzvOPOqk2iSHEoWmVyG7i9-X52f7eZ4TeUyZj7udUaYZKj3JGPE5D6kVqCS6N_JJqtvvPr-zkJJnN0m-Dwa9NLsz1glVVsl6ny_9qajgHxlaps39hblcpnIDfYHQ4gtnheC_D643c9fJ-pZ7sxsqxGvXw9dykKo744qxu5u35peMZ5joz11u6jUdGAjpSoXLQIChdyUWpxI8a6Ra8R2d8W-lgfNXWWgGWaxHTteHNu5mGCUS1_FKzB07lDdT5na_qjpf4kR8cRQfpsWF8T6Hupj8lAd2cv0XvcLkyHTHJ-F6leWr2nD6Uxt0mgA0IcOK-P2Z9hxoYKWHbNwfGGd5y-2YG4kKRfuxzKtJefKh5e2HX1TkC4qmOXeFmoEaVnUwfoJ2QRWkyRDvjz5PZly63NkiM4ry9e8sGMxzBu__v7hCnF7ZMn6BdO97AY4OTp2ggq2focU-F8jmqNGJwXWKLGPgu4IO3EIMdYjDYFQNi8C3E4B5isEUM7iEGK8S8QD-OJ9OjT57dhsMT4PBbL4g540WS55wUvoilJDQmoghJWgQ-V-u8vqRlBOP-ArrWsqCCJnkJsScMVQNJYvISDau6kq8QVjtUwRA5zImIKAxt85hwWuaFkCxRkxN7iG1aLhNWo15tlbLINmTEi6xr80y1uboCbb6HAldyaXRa7lHmw8Y4mY03TRyZAa7-WPr1P5XeR4-6N-cNGrbNlXyLHorrdr5q3lkQ_gazHKvv |
| linkProvider | Elsevier |
| 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=Price+of+anarchy+and+an+approximation+algorithm+for+the+binary-preference+capacitated+selfish+replication+game&rft.jtitle=Automatica+%28Oxford%29&rft.au=Etesami%2C+Seyed+Rasoul&rft.au=Ba%C5%9Far%2C+Tamer&rft.date=2017-02-01&rft.pub=Elsevier+Ltd&rft.issn=0005-1098&rft.eissn=1873-2836&rft.volume=76&rft.spage=153&rft.epage=163&rft_id=info:doi/10.1016%2Fj.automatica.2016.10.002&rft.externalDocID=S0005109816303934 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0005-1098&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0005-1098&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0005-1098&client=summon |