✦ LIBER ✦

A near-optimal polynomial time algorithm for learning in certain classes of stochastic games

✍ Scribed by Ronen I. Brafman; Moshe Tennenholtz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial-time algorithm for linear o

✍ M. El Ghami; I. Ivanov; J.B.M. Melissen; C. Roos; T. Steihaug 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB

A polynomial time algorithm for computin

✍ René van den Brink; Ilya Katsev; Gerard van der Laan 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 345 KB

Approximately optimal algorithms for det

✍ A.G. Korotchenko 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 547 KB

Synthesis of a Near Time-Optimal Control

✍ F.Y. Thomasson; G. Cook 📂 Article 📅 1970 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 670 KB