{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:27Z","timestamp":1742913327152,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_15","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"236-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Profitable Deviation Strong Equilibria"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Gourv\u00e8s","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00224-013-9463-2","volume":"53","author":"E Anshelevich","year":"2013","unstructured":"Anshelevich, E., Caskurlu, B., Hate, A.: Partition equilibrium always exists in resource selection games. Theory Comput. Syst. 53(1), 73\u201385 (2013)","journal-title":"Theory Comput. Syst."},{"key":"15_CR3","unstructured":"Anshelevich, E., Postl, J., Wexler, T.: Assignment games with conflicts: price of total anarchy and convergence results via semi-smoothness. CoRR abs\/1304.5149 (2013). http:\/\/arxiv.org\/abs\/1304.5149"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Tucker, A.W., Luce, R.D. (eds.) Contribution to the Theory of Games. Annals of Mathematics Studies, 40, vol. IV, pp. 287\u2013324. Princeton University Press (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-44803-8_5","volume-title":"Algorithmic Game Theory","author":"I Caragiannis","year":"2014","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N.: Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 49\u201360. Springer, Heidelberg (2014)"},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2597893","volume":"2","author":"P Chen","year":"2014","unstructured":"Chen, P., de Keijzer, B., Kempe, D., Sch\u00e4fer, G.: Altruism and its impact on the price of anarchy. ACM Trans. Econ. Comput. 2(4), 17 (2014). http:\/\/doi.acm.org\/10.1145\/2597893","journal-title":"ACM Trans. Econ. Comput."},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-02927-1_24","volume-title":"Automata, Languages and Programming","author":"S Chien","year":"2009","unstructured":"Chien, S., Sinclair, A.: Strong and pareto price of anarchy in congestion games. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 279\u2013291. Springer, Heidelberg (2009)"},{"key":"15_CR8","unstructured":"Epstein, L., Kleiman, E.: On the quality and complexity of Pareto equilibria in the job scheduling game. In: Sonenberg, L., Stone, P., Tumer, K., Yolum, P. (eds.) 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011). IFAAMAS, Taipei, Taiwan, 2\u20136 May 2011, vol. 1\u20133, pp. 525\u2013532 (2011). http:\/\/portal.acm.org\/citation.cfm?id=2031692&CFID=54178199&CFTOKEN=61392764"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, L., Kleiman, E., van Stee, R.: Maximizing the minimum load: the cost of selfishness. In: Leonardi, S. (ed.), [21], pp. 232\u2013243 (2009)","DOI":"10.1007\/978-3-642-10841-9_22"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2009.08.032","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein, L., van Stee, R.: Maximizing the minimum load for selfish agents. Theor. Comput. Sci. 411(1), 44\u201357 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibrium in load balancing. ACM Trans. Algorithms 3(3) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-04645-2_6","volume-title":"Algorithmic Game Theory","author":"M Feldman","year":"2009","unstructured":"Feldman, M., Tennenholtz, M.: Partition equilibrium. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 48\u201359. Springer, Heidelberg (2009)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"DA Fotakis","year":"2002","unstructured":"Fotakis, D.A., Kontogiannis, S.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, p. 123. Springer, Heidelberg (2002)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-642-10841-9_62","volume-title":"Internet and Network Economics","author":"L Gourv\u00e8s","year":"2009","unstructured":"Gourv\u00e8s, L., Monnot, J.: On strong equilibria in the max cut game. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 608\u2013615. Springer, Heidelberg (2009)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-13562-0_22","volume-title":"Theory and Applications of Models of Computation","author":"L Gourv\u00e8s","year":"2010","unstructured":"Gourv\u00e8s, L., Monnot, J.: The max k-cut game and its strong equilibria. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 234\u2013246. Springer, Heidelberg (2010)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Monnot, J., Moretti, S., Thang, N.: Congestion games with capacitated resources. Theory of Computing Systems pp. 1\u201319 (2014)","DOI":"10.1007\/s00224-014-9541-0"},{"key":"15_CR17","unstructured":"Hoefer, M.: Cost Sharing and Clustering under Distributed Competition. Ph.D. thesis, Universit\u00e4t Konstanz (2007)"},{"key":"15_CR18","unstructured":"Hoefer, M., Penn, M., Polukarov, M., Skopalik, A., V\u00f6cking, B.: Considerate equilibrium. In: Walsh, T. (ed.) IJCAI. pp. 234\u2013239. IJCAI\/AAAI (2011)"},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00224-012-9433-0","volume":"53","author":"M Hoefer","year":"2013","unstructured":"Hoefer, M., Skopalik, A.: On the complexity of Pareto-optimal Nash and strong equilibria. Theory Comput. Syst. 53(3), 441\u2013453 (2013). doi:10.1007\/s00224-012-9433-0","journal-title":"Theory Comput. Syst."},{"issue":"1\u20132","key":"15_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R Holzman","year":"1997","unstructured":"Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games and Economic Behavior 21(1\u20132), 85\u2013101 (1997)","journal-title":"Games and Economic Behavior"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Leonardi, S. (ed.): Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14\u201318, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5929. Springer (2009)","DOI":"10.1007\/978-3-642-10841-9"},{"key":"15_CR22","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1), 111\u2013124 (1996), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0899825696900275"},{"key":"15_CR23","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14(1), 124\u2013143 (1996), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0899825696900445"},{"issue":"2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative Games. The Annals of Mathematics 54(2), 286\u2013295 (1951)","journal-title":"The Annals of Mathematics"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11944874_8","volume-title":"Internet and Network Economics","author":"O Rozenfeld","year":"2006","unstructured":"Rozenfeld, O., Tennenholtz, M.: Strong and Correlated Strong Equilibria in Monotone Congestion Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 74\u201386. Springer, Heidelberg (2006)"},{"issue":"1","key":"15_CR27","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"AA Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56\u201387 (1991). doi:10.1137\/0220004","journal-title":"SIAM J. Comput."},{"key":"15_CR28","unstructured":"Voorneveld, M.: Potential Games and Interactive Decisions with Multiple Criteria. Ph.D. thesis, Tilburg University (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,26]],"date-time":"2020-12-26T20:06:18Z","timestamp":1609013178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}