✦ LIBER ✦

On the Complexity of Computing Winning Strategies for Finite Poset Games

✍ Scribed by Michael Soltys; Craig Wilson

Publisher: Springer
Year: 2010
Tongue: English
Weight: 480 KB
Volume: 48
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-010-9254-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of winning stra

Computational complexity of winning strategies in two-person polynomial games

✍ J. P. Jones 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 177 KB

A note on the complexity of determining

A note on the complexity of determining optimal strategies in games with common payoffs

✍ Gerhard J. Woeginger 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 239 KB

On the computational complexity of quali

On the computational complexity of qualitative coalitional games

✍ Michael Wooldridge; Paul E Dunne 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 505 KB

On the Computational Complexity of Finit

On the Computational Complexity of Finite Cellular Automata

✍ K. Sutner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

On the existence of almost-pure-strategy

On the existence of almost-pure-strategy Nash equilibrium inn-person finite games

✍ Wojciech Połowczuk; Piotr Więcek; Tadeusz Radzik 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 172 KB

On the existence of good stationary stra

On the existence of good stationary strategies for nonleavable stochastic games

✍ Piercesare Secchi 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 902 KB