{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:56:49Z","timestamp":1742385409353},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642132834"},{"type":"electronic","value":"9783642132841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13284-1_3","type":"book-chapter","created":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T07:43:53Z","timestamp":1275723833000},"page":"14-28","source":"Crossref","is-referenced-by-count":5,"title":["Towards Network Games with Social Preferences"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"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\u201358 (2005)","DOI":"10.1145\/1095810.1095816"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1109557.1109568"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Kleinberg, R., Papadimitriou, C.: Congestion Games with Malicious Players. In: Proc. ACM Conference on Electronic Commerce (EC), San Diego, CA, USA (2007)","DOI":"10.1145\/1250910.1250926"},{"key":"3_CR5","unstructured":"Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance. In: Proc. 3rd Symposium on Operating Systems Design and Implementation (OSDI), pp. 173\u2013186 (1999)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Roughgarden, T.: Network Design with Weighted Players. In: Proc. 18th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 29\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013107 (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1281100.1281142"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1111\/1467-937X.t01-1-00023","volume":"69","author":"K. Eliaz","year":"2002","unstructured":"Eliaz, K.: Fault Tolerant Implementation. Review of Economic Studies\u00a069, 589\u2013610 (2002)","journal-title":"Review of Economic Studies"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"3_CR11","unstructured":"Friedkin, N.E., Johnsen, E.C.: Social Influence Networks and Opinion Change. Advances in Group Processes\u00a016 (1999)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Skopalik, A.: Altruism in Atomic Congestion Games. In: Proc. European Symposium on Algorithms (ESA) (2009)","DOI":"10.1007\/978-3-642-04128-0_16"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10107-006-0015-2","volume":"110","author":"G. Karakostas","year":"2007","unstructured":"Karakostas, G., Viglas, A.: Equilibria for Networks with Malicious Users. Mathematical Programming A\u00a0110(3), 591\u2013613 (2007)","journal-title":"Mathematical Programming A"},{"key":"3_CR14","unstructured":"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)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1386790.1386836"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1146381.1146403"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1146381.1146391"},{"key":"3_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg Scheduling Strategies. In: Proc. 33rd ACM Symposium on Theory of Computing (STOC), pp. 104\u2013113 (2001)","DOI":"10.1145\/380752.380783"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13284-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:00:37Z","timestamp":1619784037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13284-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642132834","9783642132841"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13284-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}