Towards network games with social preferences
From MaRDI portal
Publication:3569112
DOI10.1007/978-3-642-13284-1_3zbMATH Open1284.91077arXiv1001.5134OpenAlexW3122636489MaRDI QIDQ3569112FDOQ3569112
Authors: Petr Kuznetsov, Stefan Schmid
Publication date: 17 June 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1001.5134
Recommendations
Games involving graphs (91A43) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cited In (3)
This page was built for publication: Towards network games with social preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569112)