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...

Celý popis

Podrobná bibliografia

Vydané v:	2015 54th IEEE Conference on Decision and Control (CDC) s. 3568 - 3573
Hlavní autori:	Etesami, Seyed Rasoul, Basar, Tamer
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2015
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!