{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:39:52Z","timestamp":1725521992894},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921844"},{"type":"electronic","value":"9783540921851"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_27","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T11:44:33Z","timestamp":1228909473000},"page":"198-209","source":"Crossref","is-referenced-by-count":2,"title":["Equilibria of Graphical Games with Symmetries"],"prefix":"10.1007","author":[{"given":"Felix","family":"Brandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Brandt, F., Fischer, F., Holzer, M.: Symmetries and the complexity of pure Nash equilibrium. Journal of Computer and System Sciences (to appear, 2008)","DOI":"10.1016\/j.jcss.2008.09.001"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11561071_9","volume-title":"Algorithms \u2013 ESA 2005","author":"C. Daskalakis","year":"2005","unstructured":"Daskalakis, C., Papadimitriou, C.H.: The complexity of games on highly regular graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 71\u201382. Springer, Heidelberg (2005)"},{"key":"27_CR3","first-page":"83","volume-title":"Proc.\u00a0of 48th FOCS Symposium","author":"C. Daskalakis","year":"2007","unstructured":"Daskalakis, C., Papadimitriou, C.H.: Computing equilibria in anonymous games. In: Proc.\u00a0of 48th FOCS Symposium, pp. 83\u201393. IEEE Press, Los Alamitos (2007)"},{"key":"27_CR4","first-page":"71","volume-title":"Proc.\u00a0of 38th STOC","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Proc.\u00a0of 38th STOC, pp. 71\u201378. ACM Press, New York (2006)"},{"key":"27_CR5","first-page":"100","volume-title":"Proc.\u00a0of 7th ACM-EC Conference","author":"E. Elkind","year":"2006","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P.W.: Equilibria in graphical games on trees revisited. In: Proc.\u00a0of 7th ACM-EC Conference, pp. 100\u2013109. ACM Press, New York (2006)"},{"key":"27_CR6","first-page":"162","volume-title":"Proc.\u00a0of 8th ACM-EC Conference","author":"E. Elkind","year":"2007","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P.W.: Computing good Nash equilibria in graphical games. In: Proc.\u00a0of 8th ACM-EC Conference, pp. 162\u2013171. ACM Press, New York (2007)"},{"issue":"6","key":"27_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ipl.2006.03.010","volume":"99","author":"F. Fischer","year":"2006","unstructured":"Fischer, F., Holzer, M., Katzenbeisser, S.: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Information Processing Letters\u00a099(6), 239\u2013245 (2006)","journal-title":"Information Processing Letters"},{"key":"27_CR8","first-page":"61","volume-title":"Proc.\u00a0of 38th STOC","author":"P.W. Goldberg","year":"2006","unstructured":"Goldberg, P.W., Papadimitriou, C.H.: Reducibility among equilibrium problems. In: Proc.\u00a0of 38th STOC, pp. 61\u201370. ACM Press, New York (2006)"},{"key":"27_CR9","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. Journal of Artificial Intelligence Research\u00a024, 195\u2013220 (2005)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"27_CR10","first-page":"253","volume-title":"Proc.\u00a0of 17th UAI Conference","author":"M.J. Kearns","year":"2001","unstructured":"Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical models for game theory. In: Proc.\u00a0of 17th UAI Conference, pp. 253\u2013260. Morgan Kaufmann, San Francisco (2001)"},{"key":"27_CR11","volume-title":"Games and Decisions: Introduction and Critical Survey","author":"R.D. Luce","year":"1957","unstructured":"Luce, R.D., Raiffa, H.: Games and Decisions: Introduction and Critical Survey. John Wiley & Sons Inc., Chichester (1957)"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"27_CR13","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"27_CR14","first-page":"82","volume-title":"Proc.\u00a0of 16th SODA","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Roughgarden, T.: Computing equilibria in multi-player games. In: Proc.\u00a0of 16th SODA, pp. 82\u201391. SIAM, Philadelphia (2005)"},{"issue":"4","key":"27_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. Journal of the ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"929","DOI":"10.2307\/121059","volume":"150","author":"N. Robertson","year":"1999","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. Annals of Mathematics\u00a0150, 929\u2013975 (1999)","journal-title":"Annals of Mathematics"},{"key":"27_CR17","first-page":"216","volume-title":"Proc.\u00a0of 10th STOC","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc.\u00a0of 10th STOC, pp. 216\u2013226. ACM Press, New York (1978)"},{"key":"27_CR18","first-page":"270","volume-title":"Proc.\u00a0of 7th ACM-EC Conference","author":"G. Schoenebeck","year":"2006","unstructured":"Schoenebeck, G., Vadhan, S.: The computational complexity of Nash equilibria in concisely represented games. In: Proc.\u00a0of 7th ACM-EC Conference, pp. 270\u2013279. ACM Press, New York (2006)"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1093\/qmath\/25.1.303","volume":"25","author":"P.D. Seymour","year":"1974","unstructured":"Seymour, P.D.: On the two-colouring of hypergraphs. The Quarterly Journal of Mathematics\u00a025, 303\u2013312 (1974)","journal-title":"The Quarterly Journal of Mathematics"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0195-6698(85)80025-1","volume":"6","author":"C. Thomassen","year":"1985","unstructured":"Thomassen, C.: Even cycles in directed graphs. European Journal of Combinatorics\u00a06, 85\u201389 (1985)","journal-title":"European Journal of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T16:58:48Z","timestamp":1684774728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}