✦ LIBER ✦

Absolutely expedient algorithms for learning Nash equilibria

✍ Scribed by V. V. Phansalkar; P. S. Sastry; M. A. L. Thathachar

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Absolute Expediency of Q-and S-Model Lea

✍ Lakshmivarahan, S.; Thathachar, M. A. L. 📂 Article 📅 1976 🏛 Institute of Electrical and Electronics Engineers ⚖ 1022 KB

Algorithms for computing Nash equilibria

✍ Jacob Engwerda 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 356 KB

Uniqueness results and algorithm for Sta

✍ Roger L. Tobin 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 917 KB

Learning algorithms for repeated bimatri

✍ G. P. Papavassilopoulos 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 856 KB

A Spurious Equilibria-free Learning Algo

✍ Seungjin Choi; Ruey-Wen Liu; Andrzej Cichocki 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 138 KB

[Lecture Notes in Computer Science] Inte

✍ Deng, Xiaotie; Graham, Fan Chung 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 526 KB