{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:25:19Z","timestamp":1777339519992,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735441","type":"print"},{"value":"9783540735458","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_28","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T09:44:11Z","timestamp":1187343851000},"page":"274-284","source":"Crossref","is-referenced-by-count":2,"title":["Finding Equilibria in Games of No Chance"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troels Bjerre","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1111\/j.1467-8640.1996.tb00256.x","volume":"12","author":"J.R.S. Blair","year":"1996","unstructured":"Blair, J.R.S., Mutchler, D., van Lent, M.: Perfect recall and pruning in games with imperfect information. Computational Intelligence\u00a012, 131\u2013154 (1996)","journal-title":"Computational Intelligence"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: 47th Annual Symposium on Foundations of Computer Science, pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/0899-8256(92)90035-Q","volume":"4","author":"D. Koller","year":"1992","unstructured":"Koller, D., Megiddo, N.: The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior\u00a04, 528\u2013552 (1992)","journal-title":"Games and Economic Behavior"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Koller, D., Megiddo, N., von Stengel, B.: Fast algorithms for finding randomized strategies in game trees. In: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pp. 750\u2013759 (1994)","DOI":"10.1145\/195058.195451"},{"key":"28_CR5","first-page":"193","volume":"28","author":"H.W. Kuhn","year":"1953","unstructured":"Kuhn, H.W.: Extensive games and the problem of information. Annals of Mathematical Studies\u00a028, 193\u2013216 (1953)","journal-title":"Annals of Mathematical Studies"},{"key":"28_CR6","unstructured":"von Stengel, B., Forges, F.: Extensive form correlated equilibrium: Definition and computational complexity. Technical Report LSE-CDAM-2006-04, London School of Economics, Centre for Discrete and Applicable Mathematics (2006)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:17:52Z","timestamp":1619504272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}