Fast algorithms for finding randomized strategies in game trees

This paper describes a new representation of strategies which results in a practical linear formulation of the problem of two-player games with perfect recall (i.e., games where players never forget anything, which is a standard assumption).

Abstract

Article Fast algorithms for finding randomized strategies in game trees Share on Authors: Daphne Koller Computer Science Division, University of California, Berkeley, CA; and IBM Almaden Research Center, 650 Harry Road, San Jose, CA Computer Science Division, University of California, Berkeley, CA; and IBM Almaden Research Center, 650 Harry Road, San Jose, CAView Profile , Nimrod Megiddo IBM Almaden Research Center, 650 Harry Road, San Jose, CA and School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel IBM Almaden Research Center, 650 Harry Road, San Jose, CA and School of Mathematical Sciences, Tel Aviv University, Tel Aviv, IsraelView Profile , Bernhard von Stengel Informatik 5, University of the Federal Armed Forces at Munich, 85577 Neubiberg, Germany Informatik 5, University of the Federal Armed Forces at Munich, 85577 Neubiberg, GermanyView Profile Authors Info & Claims STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of ComputingMay 1994 Pages 750–759https://doi.org/10.1145/195058.195451Online:23 May 1994Publication History 60citation944DownloadsMetricsTotal Citations60Total Downloads944Last 12 Months38Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access