TU Berlin

Internet Network ArchitecturesAll Publications

Page Content

to Navigation

All publications

Towards Network Games with Social Preferences
Citation key KS-TNGWSP-10
Author Kuznetsov, Petr and Schmid, Stefan
Title of Book Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO '10)
Pages 14–28
Year 2010
ISBN 978-3-642-13283-4
ISSN 0302-9743
DOI http://dx.doi.org/10.1007/978-3-642-13284-1_3
Location Sirinice, Turkey
Address Berlin, Heidelberg, New York
Number 6058
Month June
Note See also arXiv TechReport No. 1001.5134.
Editor Patt-Schamir, Boaz and Ekim, Tinaz
Publisher Springer
Series Lecture Notes of Computer Science
Abstract Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such games can be evaluated through the costs of the system equilibria: the system states in which no player can increase her utility by unilaterally changing her behavior. However, assuming that all players are selfish and in particular that all players have the same utility function may not always be appropriate. Hence, several extensions to incorporate also altruistic and malicious behavior in addition to selfishness have been proposed over the last years. In this paper, we seek to go one step further and study arbitrary relationships between participants. In particular, we introduce the notion of the social range matrix and explore the effects of the social range matrix on the equilibria in a network game. In order to derive concrete results, we propose a simplistic network creation game that captures the effect of social relationships among players.
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe