{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:42:55Z","timestamp":1725496975790},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771043"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_9","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:59:37Z","timestamp":1196665177000},"page":"57-69","source":"Crossref","is-referenced-by-count":10,"title":["Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Gilpin","sequence":"first","affiliation":[]},{"given":"Samid","family":"Hoda","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Pe\u00f1a","sequence":"additional","affiliation":[]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"678","volume":"3","author":"I. Romanovskii","year":"1962","unstructured":"Romanovskii, I.: Reduction of a game with complete memory to a matrix game. Soviet Mathematics\u00a03, 678\u2013681 (1962)","journal-title":"Soviet Mathematics"},{"issue":"4","key":"9_CR2","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(4), 528\u2013552 (1992)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1006\/game.1996.0050","volume":"14","author":"B.. von Stengel","year":"1996","unstructured":"von Stengel, B.: Efficient computation of behavior strategies. Games and Economic Behavior\u00a014(2), 220\u2013246 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"9_CR4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0004-3702(97)00023-4","volume":"94","author":"D. Koller","year":"1997","unstructured":"Koller, D., Pfeffer, A.: Representations and solutions for game-theoretic problems. Artificial Intelligence\u00a094(1), 167\u2013215 (1997) (Early version appeared in IJCAI-95)","journal-title":"Artificial Intelligence"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-45579-5_22","volume-title":"Computers and Games, Springer-Verlag","author":"J. Shi","year":"2001","unstructured":"Shi, J., Littman, M.: Abstraction methods for game theoretic poker. In: Computers and Games, Springer-Verlag, pp. 333\u2013345. Springer, Heidelberg (2001)"},{"key":"9_CR6","unstructured":"Gilpin, A., Sandholm, T.: Lossless abstraction method for sequential games of imperfect information. Journal of the ACM (to appear) Early version appeared as Finding equilibria in large sequential games of imperfect information. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), Ann Arbor, MI, 2006 (2007)"},{"key":"9_CR7","unstructured":"Billings, D., Burch, N., Davidson, A., Holte, R., Schaeffer, J., Schauenberg, T., Szafron, D.: Approximating game-theoretic optimal strategies for full-scale poker. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, pp. 661\u2013668 (2003)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gilpin, A., Sandholm, T.: A competitive Texas Hold\u2019em poker player via automated abstraction and real-time equilibrium computation. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), Boston, MA (2006)","DOI":"10.1145\/1160633.1160911"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Gilpin, A., Sandholm, T.: Better automated abstraction techniques for imperfect information games, with application to Texas Hold\u2019em poker. In: International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Honolulu, HI (2007)","DOI":"10.1145\/1329125.1329358"},{"key":"9_CR10","unstructured":"Gilpin, A., Sandholm, T., S\u00f8rensen, T.B.: Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold\u2019em poker. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), Vancouver, BC, Canada (2007)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Young, N.E.: Simple strategies for large zero-sum games with applications to complexity theory. In: Proceedings of the Annual Symposium on Theory of Computing (STOC), Montreal, Quebec, Canada, pp. 734\u2013740 (1994)","DOI":"10.1145\/195058.195447"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/779928.779933","volume-title":"Proceedings of the ACM Conference on Electronic Commerce (ACM-EC)","author":"R. Lipton","year":"2003","unstructured":"Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pp. 36\u201341. ACM Press, New York (2003)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_27","volume-title":"Internet and Network Economics","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, Springer, Heidelberg (2006)"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1145\/1250910.1250962","volume-title":"Proceedings of the ACM Conference on Electronic Commerce (ACM-EC)","author":"C. Daskalakis","year":"2007","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress in approximate Nash equilibria. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pp. 355\u2013358. ACM Press, New York (2007)"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/1250910.1250961","volume-title":"Proceedings of the ACM Conference on Electronic Commerce (ACM-EC)","author":"T. Feder","year":"2007","unstructured":"Feder, T., Nazerzadeh, H., Saberi, A.: Approximating Nash equilibria using small-support strategies. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pp. 352\u2013354. ACM Press, New York (2007)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.: Adaptive game playing using multiplicative weights. Games and Economic Behavior\u00a029, 79\u2013103 (1999)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S1052623403422285","volume":"16","author":"Y. Nesterov","year":"2005","unstructured":"Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization. SIAM Journal of Optimization\u00a016(1), 235\u2013249 (2005)","journal-title":"SIAM Journal of Optimization"},{"key":"9_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y. Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"2\u20133","key":"9_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10107-006-0031-2","volume":"109","author":"Z. Lu","year":"2007","unstructured":"Lu, Z., Nemirovski, A., Monteiro, R.D.C.: Large-scale semidefinite programming via a saddle point mirror-prox algorithm. Mathematical Programming, Series B\u00a0109(2\u20133), 211\u2013237 (2007)","journal-title":"Mathematical Programming, Series B"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/11496915_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"F.A. Chudak","year":"2005","unstructured":"Chudak, F.A., Eleut\u00e9rio, V.: Improved approximation schemes for linear programming relaxations of combinatorial optimization problems. In: J\u00fcnger, M., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol.\u00a03509, pp. 81\u201396. Springer, Heidelberg (2005)"},{"key":"9_CR21","unstructured":"Hoda, S., Gilpin, A.: Pe\u00f1a, J.: A gradient-based approach for computing Nash equilibria of large sequential games (2007), Available at, http:\/\/www.optimization-online.org\/"},{"issue":"1-2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0004-3702(01)00130-8","volume":"134","author":"D. Billings","year":"2002","unstructured":"Billings, D., Davidson, A., Schaeffer, J., Szafron, D.: The challenge of poker. Artificial Intelligence\u00a0134(1-2), 201\u2013240 (2002)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,29]],"date-time":"2021-08-29T19:09:20Z","timestamp":1630264160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_9","relation":{},"subject":[]}}