{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T16:14:49Z","timestamp":1692980089382},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T00:00:00Z","timestamp":1351123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00224-012-9433-0","type":"journal-article","created":{"date-parts":[[2012,10,24]],"date-time":"2012-10-24T08:57:54Z","timestamp":1351069074000},"page":"441-453","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Pareto-Optimal Nash and Strong Equilibria"],"prefix":"10.1007","volume":"53","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","published-online":{"date-parts":[[2012,10,25]]},"reference":[{"issue":"6","key":"9433_CR1","volume":"55","author":"H. Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J.\u00a0ACM 55(6), 25 (2008)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"9433_CR2","doi-asserted-by":"crossref","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."},{"key":"9433_CR3","series-title":"Annals of Mathematics Study","first-page":"287","volume-title":"Contributions to the Theory of Games IV","author":"R. Aumann","year":"1959","unstructured":"Aumann, R.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games IV. Annals of Mathematics Study, vol. 40, pp. 287\u2013324. Princeton University Press, Princeton (1959)"},{"key":"9433_CR4","doi-asserted-by":"crossref","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. 28, 171\u2013180 (1999)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"9433_CR5","doi-asserted-by":"crossref","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. 34(2), 225\u2013233 (2000)","journal-title":"J. Math. Econ."},{"issue":"3","key":"9433_CR6","doi-asserted-by":"crossref","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. 75(3), 163\u2013177 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"9433_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-3-642-02927-1_24","volume-title":"Proc. 36th Intl. Coll. Automata, Languages and Programming (ICALP)","author":"S. Chien","year":"2009","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)"},{"key":"9433_CR8","first-page":"83","volume-title":"Proc. 48th Symp. Foundations of Computer Science (FOCS)","author":"C. Daskalakis","year":"2007","unstructured":"Daskalakis, C., Papadimitriou, C.: Computing equilibria in anonymous games. In: Proc. 48th Symp. Foundations of Computer Science (FOCS), pp. 83\u201393 (2007)"},{"key":"9433_CR9","first-page":"25","volume-title":"Proc. 49th Symp. Foundations of Computer Science (FOCS)","author":"C. Daskalakis","year":"2008","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)"},{"issue":"4","key":"9433_CR10","doi-asserted-by":"crossref","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. 33(4), 851\u2013868 (2008)","journal-title":"Math. Oper. Res."},{"key":"9433_CR11","first-page":"604","volume-title":"Proc. 36th Symp. Theory of Computing (STOC)","author":"A. Fabrikant","year":"2004","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)"},{"key":"9433_CR12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/978-3-540-73420-8_51","volume-title":"Proc. 34th Intl. Coll. Automata, Languages and Programming (ICALP)","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S.: Strong price of anarchy for machine load balancing. In: Proc. 34th Intl. Coll. Automata, Languages and Programming (ICALP), pp. 583\u2013594 (2007)"},{"key":"9433_CR13","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. 24, 195\u2013220 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"9433_CR14","first-page":"29","volume-title":"Proc. 18th European Symposium on Algorithms (ESA)","author":"T. Harks","year":"2010","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), vol. 2, pp. 29\u201338 (2010)"},{"key":"9433_CR15","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/978-3-642-10841-9_43","volume-title":"Proc. 5th Intl. Workshop Internet & Network Economics (WINE)","author":"T. Harks","year":"2009","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.: Strong Nash equilibria in games with the lexicographical improvement property. In: Proc. 5th Intl. Workshop Internet & Network Economics (WINE), pp. 463\u2013470 (2009)"},{"key":"9433_CR16","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/978-3-642-16170-4_27","volume-title":"Proc. 3rd Intl. Symp. Algorithmic Game Theory (SAGT)","author":"M. Hoefer","year":"2010","unstructured":"Hoefer, M., Skopalik, A.: On the complexity of Pareto-optimal Nash and strong equilibria. In: Proc. 3rd Intl. Symp. Algorithmic Game Theory (SAGT), pp. 312\u2013322 (2010)"},{"issue":"1\u20132","key":"9433_CR17","doi-asserted-by":"crossref","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. 21(1\u20132), 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"9433_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jeth.1996.2203","volume":"72","author":"H. Konishi","year":"1997","unstructured":"Konishi, H., Le Breton, M., Weber, S.: Equilibria in a model with partial rivalry. J. Econ. Theory 72(1), 225\u2013237 (1997)","journal-title":"J. Econ. Theory"},{"key":"9433_CR19","volume-title":"Microeconomic Theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M., Green, J.: Microeconomic Theory. Oxford University Press, London (1995)"},{"key":"9433_CR20","unstructured":"Meyers, C.: Network flow problems and congestion games: complexity and approximation results. Ph.D. thesis, MIT (2006)"},{"issue":"1","key":"9433_CR21","doi-asserted-by":"crossref","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. 13(1), 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"9433_CR22","doi-asserted-by":"crossref","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. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9433_CR23","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/11944874_8","volume-title":"Proc. 2nd Intl. Workshop Internet & Network Economics (WINE)","author":"O. Rozenfeld","year":"2006","unstructured":"Rozenfeld, O., Tennenholtz, M.: Strong and correlated strong equilibria in monotone congestion games. In: Proc. 2nd Intl. Workshop Internet & Network Economics (WINE), pp. 74\u201386 (2006)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9433-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9433-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9433-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T19:33:24Z","timestamp":1562268804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9433-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,25]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9433"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9433-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,25]]}}}