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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aiyer, A., Alvisi, L., Clement, A., Dahlin, M., Martin, J.-P., Porth, C.: BAR Fault Tolerance for Cooperative Services. In: Proc. 20th ACM Symposium on Operating Systems Principles (SOSP), pp. 45–58 (2005)
Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash Equilibria for a Network Creation Game. In: Proc. 17th ACM Symposium on Discrete Algorithms, SODA (2006)
Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proc. 45th Symposium on Foundations of Computer Science (FOCS), pp. 295–304 (2004)
Babaioff, M., Kleinberg, R., Papadimitriou, C.: Congestion Games with Malicious Players. In: Proc. ACM Conference on Electronic Commerce (EC), San Diego, CA, USA (2007)
Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance. In: Proc. 3rd Symposium on Operating Systems Design and Implementation (OSDI), pp. 173–186 (1999)
Chen, H.-L., Roughgarden, T.: Network Design with Weighted Players. In: Proc. 18th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 29–38 (2006)
Corbo, J., Parkes, D.C.: The Price of Selfish Behavior in Bilateral Network Formation. In: Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 99–107 (2005)
Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The Price of Anarchy in Network Creation Games. In: Proc. 26th Annual Symposium on Principles of Distributed Computing (PODC) (2007)
Eliaz, K.: Fault Tolerant Implementation. Review of Economic Studies 69, 589–610 (2002)
Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a Network Creation Game. In: Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 347–351 (2003)
Friedkin, N.E., Johnsen, E.C.: Social Influence Networks and Opinion Change. Advances in Group Processes 16 (1999)
Hoefer, M., Skopalik, A.: Altruism in Atomic Congestion Games. In: Proc. European Symposium on Algorithms (ESA) (2009)
Karakostas, G., Viglas, A.: Equilibria for Networks with Malicious Users. Mathematical Programming A 110(3), 591–613 (2007)
Li, H., Clement, A., Marchetti, M., Kapritsos, M., Robinson, L., Alvisi, L., Dahlin, M.: FlightPath: Obedience vs Choice in Cooperative Services. In: Proc. Symposium on Operating Systems Design and Implementation, OSDI (2008)
Meier, D., Oswald, Y.A., Schmid, S., Wattenhofer, R.: On the Windfall of Friendship: Inoculation Strategies on Social Networks. In: Proc. 9th ACM Conference on Electronic Commerce (EC) (2008)
Moscibroda, T., Schmid, S., Wattenhofer, R.: On the Topologies Formed by Selfish Peers. In: Proc. 25th Annual Symposium on Principles of Distributed Computing, PODC (2006)
Moscibroda, T., Schmid, S., Wattenhofer, R.: When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game. In: Proc. 25th Annual Symposium on Principles of Distributed Computing (PODC) (2006)
Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
Roughgarden, T.: Stackelberg Scheduling Strategies. In: Proc. 33rd ACM Symposium on Theory of Computing (STOC), pp. 104–113 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuznetsov, P., Schmid, S. (2010). Towards Network Games with Social Preferences. In: Patt-Shamir, B., Ekim, T. (eds) Structural Information and Communication Complexity. SIROCCO 2010. Lecture Notes in Computer Science, vol 6058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-13284-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13283-4
Online ISBN: 978-3-642-13284-1
eBook Packages: Computer ScienceComputer Science (R0)