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

Full description

Bibliographic Details

Published in:	2015 54th IEEE Conference on Decision and Control (CDC) pp. 3568 - 3573
Main Authors:	Etesami, Seyed Rasoul, Basar, Tamer
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2015
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!