{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:58Z","timestamp":1725488938503},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_55","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"621-632","source":"Crossref","is-referenced-by-count":1,"title":["Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","first-page":"295","volume-title":"Proceedings of FOCS 2004","author":"E. Anshelevich","year":"2004","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: Proceedings of FOCS 2004, pp. 295\u2013304. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"55_CR2","first-page":"511","volume-title":"Proceedings of STOC 2003","author":"E. Anshelevich","year":"2003","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: Proceedings of STOC 2003, pp. 511\u2013520. ACM Press, New York (2003)"},{"key":"55_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R.J. Aumann","year":"1974","unstructured":"Aumann, R.J.: Subjectivity and Correlation in Randomized Strategies. Journal of Mathematical Economics\u00a01, 67\u201396 (1974)","journal-title":"Journal of Mathematical Economics"},{"key":"55_CR4","first-page":"109","volume":"21","author":"M.J. Beckmann","year":"1967","unstructured":"Beckmann, M.J.: On the theory of Traffic Flow in Networks. Traffic Quart\u00a021, 109\u2013116 (1967)","journal-title":"Traffic Quart"},{"key":"55_CR5","unstructured":"Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"55_CR6","volume-title":"Proceedings of IPDPS 2006","author":"V. Bil\u00f2","year":"2006","unstructured":"Bil\u00f2, V.: On the Packing of Selfish Items. In: Proceedings of IPDPS 2006, IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"55_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/978-3-540-31856-9_37","volume-title":"STACS 2005","author":"V. Bil\u00f2","year":"2005","unstructured":"Bil\u00f2, V., Flammini, M., Moscardelli, L.: On Nash Equilibria in Non-cooperative All-Optical Networks. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 448\u2013459. Springer, Heidelberg (2005)"},{"key":"55_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-30551-4_17","volume-title":"Algorithms and Computation","author":"V. Bil\u00f2","year":"2004","unstructured":"Bil\u00f2, V., Flammini, M., Melideo, G., Moscardelli, L.: On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 172\u2013183. Springer, Heidelberg (2004)"},{"key":"55_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/BF01918335","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: Uber ein Paradoxon der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"55_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"key":"55_CR11","unstructured":"Czumaj, A., Vocking, B.: Tight Bounds for Worst-Case Equilibria. In: Proceedings of SODA 2002, pp. 413-420, ACM-SIAM (2002)"},{"key":"55_CR12","first-page":"287","volume-title":"Proceedings of STOC 2002","author":"A. Czumaj","year":"2002","unstructured":"Czumaj, A., Krysta, P., Vocking, B.: Selfish Traffic Allocation for Server Farms. In: Proceedings of STOC 2002, pp. 287\u2013296. ACM Press, New York (2002)"},{"issue":"2","key":"55_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73B","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The Traffic Assignment Problem for a General Network. Journal of Research of the National Bureau of Standards - B. Mathematical Sciences\u00a073B(2), 91\u2013118 (1969)","journal-title":"Journal of Research of the National Bureau of Standards - B. Mathematical Sciences"},{"key":"55_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"key":"55_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/872035.872088","volume-title":"Proceedings of PODC 2003","author":"A. Fabrikant","year":"2003","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a Network Creation Game. In: Proceedings of PODC 2003, pp. 347\u2013351. ACM Press, New York (2003)"},{"key":"55_CR16","doi-asserted-by":"crossref","unstructured":"Feldmann, R., Gairing, M., L\u00facking, T.: Nashification and the Coordination Ratio for a Selfish Routing Game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 514\u2013526. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-45061-0_42"},{"key":"55_CR17","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":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: 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.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"55_CR18","first-page":"613","volume-title":"Proceedings of STOC 2004","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., Lucking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: Proceedings of STOC 2004, pp. 613\u2013622. ACM Press, New York (2004)"},{"key":"55_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/978-3-540-28629-5_44","volume-title":"Mathematical Foundations of Computer Science 2004","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., Lucking, T., Mavronicolas, M., Monien, B.: The price of anarchy for polynomial social cost. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 574\u2013585. Springer, Heidelberg (2004)"},{"key":"55_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., Lucking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"key":"55_CR21","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theoretical Computer Science","author":"M. Gairing","year":"2003","unstructured":"Gairing, M., Lucking, T., Mavronicolas, M., Monien, B., Spirakis, P.: Extreme Nash Equilibria. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol.\u00a02841, pp. 1\u201320. Springer, Heidelberg (2003)"},{"key":"55_CR22","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/989459.989467","volume-title":"Proceedings of MobiHoc 2004","author":"M.X. Goemans","year":"2004","unstructured":"Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market Sharing Games Applied to the Content Distribution in Ad-Hoc Networks. In: Proceedings of MobiHoc 2004, pp. 55\u201366. ACM Press, New York (2004)"},{"key":"55_CR23","first-page":"142","volume-title":"Proceedings of FOCS 2005","author":"M.X. Goemans","year":"2005","unstructured":"Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink Equilibria and Convergence. In: Proceedings of FOCS 2005, pp. 142\u2013154. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"55_CR24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/mnsc.14.3.159","volume":"14","author":"J.C. Harsanyi","year":"1967","unstructured":"Harsanyi, J.C.: Games with Incomplete Information Played by \u2018Bayesian\u2019 Players. Management Science, 14:159\u2013182, 320\u2013334, 486\u2013502 (1967)","journal-title":"Management Science"},{"key":"55_CR25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.2307\/2951777","volume":"61","author":"M. Kandori","year":"1993","unstructured":"Kandori, M., Mailath, G., Rob, R.: Learning, Mutation and Long-Run Equilibria in Games. Econometrica\u00a061, 29\u201356 (1993)","journal-title":"Econometrica"},{"issue":"5","key":"55_CR26","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.2307\/1912320","volume":"54","author":"M. Kohlberg","year":"1986","unstructured":"Kohlberg, M., Mertens, J.: On the Strategic Stability of Equilibria. Econometrica\u00a054(5), 1003\u20131037 (1986)","journal-title":"Econometrica"},{"key":"55_CR27","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate Equilibria and Ball Fusion. In: Proceedings of SIROCCO 2002. Proceedings in Informatics. Carleton Scientific, vol.\u00a013, pp. 223\u2013235 (2002)"},{"key":"55_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 1999","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"55_CR29","doi-asserted-by":"publisher","first-page":"863","DOI":"10.2307\/1912767","volume":"50","author":"D. Kreps","year":"1982","unstructured":"Kreps, D., Wilson, R.: Sequential Equilibria. Econometrica\u00a050, 863\u2013894 (1982)","journal-title":"Econometrica"},{"key":"55_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"T. Lucking","year":"2004","unstructured":"Lucking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 547\u2013558. Springer, Heidelberg (2004)"},{"key":"55_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/978-3-540-45138-9_49","volume-title":"Mathematical Foundations of Computer Science 2003","author":"T. Lucking","year":"2003","unstructured":"Lucking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., Vrto, I.: Which is the Worst-case Nash Equilibrium? In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 551\u2013561. Springer, Heidelberg (2003)"},{"key":"55_CR32","first-page":"510","volume-title":"Proceedings of STOC 2001","author":"M. Mavronicolas","year":"2001","unstructured":"Mavronicolas, M., Spirakis, P.: The Price of Selfish Routing. In: Proceedings of STOC 2001, pp. 510\u2013519. ACM Press, New York (2001)"},{"key":"55_CR33","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"55_CR34","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"55_CR35","first-page":"749","volume-title":"Proceedings of STOC 2001","author":"C.H. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proceedings of STOC 2001, pp. 749\u2013753. ACM Press, New York (2001)"},{"key":"55_CR36","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"55_CR37","first-page":"428","volume-title":"Proceedings of STOC 2002","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T.: The Price of Anarchy is Independent of the Network Topology. In: Proceedings of STOC 2002, pp. 428\u2013437. ACM Press, New York (2002)"},{"key":"55_CR38","unstructured":"Roughgarden, T.: Selfish Routing. Ph. D. Thesis, Department of Computer Science, Cornell University (May 2002)"},{"key":"55_CR39","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How Bad is Selfish Routing? Journal of ACM\u00a049, 236\u2013259 (2002)","journal-title":"Journal of ACM"},{"key":"55_CR40","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01766400","volume":"4","author":"R. Selten","year":"1975","unstructured":"Selten, R.: Reexamination of the Perfectness Concept for Equilibrium Points in Extensive Games. International Journal of Game Theory\u00a04, 25\u201355 (1975)","journal-title":"International Journal of Game Theory"},{"key":"55_CR41","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol.\u00a01, pp. 325\u2013378 (1956)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:25Z","timestamp":1619519365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}