{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:18:19Z","timestamp":1743056299097,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_27","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:07:44Z","timestamp":1286957264000},"page":"312-322","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Pareto-optimal Nash and Strong Equilibria"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM\u00a055(6) (2008)","DOI":"10.1145\/1455248.1455249"},{"issue":"2","key":"27_CR2","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.\u00a065(2), 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Aumann, R.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games IV. Annals of Mathematics Study, vol.\u00a040, pp. 287\u2013324 (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/game.1998.0699","volume":"28","author":"M. Blonski","year":"1999","unstructured":"Blonski, M.: Anonymous games with binary actions. Games Econ. Behav.\u00a028, 171\u2013180 (1999)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-4068(99)00008-7","volume":"34","author":"M. Blonski","year":"2000","unstructured":"Blonski, M.: Characterization of pure strategy equilibria in finite anonymous games. J. Math. Econ.\u00a034(2), 225\u2013233 (2000)","journal-title":"J. Math. Econ."},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jcss.2008.09.001","volume":"75","author":"F. Brandt","year":"2009","unstructured":"Brandt, F., Fischer, F., Holzer, M.: Symmetries and the complexity of pure Nash equilibrium. J. Comput. Syst. Sci.\u00a075(3), 163\u2013177 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Chien, S., Sinclair, A.: Strong and Pareto price of anarchy in congestion games. In: Proc. 36th Intl. Coll. Automata, Languages and Programming (ICALP), pp. 279\u2013291 (2009)","DOI":"10.1007\/978-3-642-02927-1_24"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Papadimitriou, C.: Computing equilibria in anonymous games. In: Proc. 48th Symp. Foundations of Computer Science (FOCS), pp. 83\u201393 (2007)","DOI":"10.1109\/FOCS.2007.24"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Papadimitriou, C.: Discretized multinomial distributions and Nash equilibria in anonymous games. In: Proc. 49th Symp. Foundations of Computer Science (FOCS), pp. 25\u201334 (2008)","DOI":"10.1109\/FOCS.2008.84"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/moor.1080.0322","volume":"33","author":"J. Dunkel","year":"2008","unstructured":"Dunkel, J., Schulz, A.: On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. Math. Oper. Res.\u00a033(4), 851\u2013868 (2008)","journal-title":"Math. Oper. Res."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. 36th Symp. Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1613\/jair.1683","volume":"24","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Pure Nash equilibria: Hard and easy games. J. Artif. Intell. Res.\u00a024, 195\u2013220 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Harks, T., Hoefer, M., Klimm, M., Skopalik, A.: Computing pure Nash and strong equilibria in bottleneck congestion games. In: Proc. 18th European Symposium on Algorithms, ESA (to appear 2010)","DOI":"10.1007\/978-3-642-15781-3_3"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-10841-9_43","volume-title":"Internet and Network Economics","author":"T. Harks","year":"2009","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Strong Nash equilibria in games with the lexicographical improvement property. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 463\u2013470. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"27_CR15","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 Econ. Behav.\u00a021(1-2), 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jeth.1996.2203","volume":"72","author":"H. Konishi","year":"1997","unstructured":"Konishi, H., Breton, M.L., Weber, S.: Equilibria in a model with partial rivalry. J. Econ. Theory\u00a072(1), 225\u2013237 (1997)","journal-title":"J. Econ. Theory"},{"key":"27_CR17","volume-title":"Microeconomic Theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M., Green, J.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"key":"27_CR18","unstructured":"Meyers, C.: Network Flow Problems and Congestion Games: Complexity and Approximation Results. PhD thesis, MIT (June 2006)"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games Econ. Behav.\u00a013(1), 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. Intl. J. Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Intl. J. Game Theory"},{"key":"27_CR21","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.\u00a04286, pp. 74\u201386. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:21:48Z","timestamp":1559722908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}