✦ LIBER ✦

Computational Complexity and Communication: Coordination in Two–Player Games

✍ Scribed by Amparo Urbano; Jose E. Vila

Book ID: 108556165
Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 208 KB
Volume: 70
Category: Article
ISSN: 0012-9682
DOI: 10.1111/1468-0262.00357

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

Computing uniformly optimal strategies i

Computing uniformly optimal strategies in two-player stochastic games

✍ Eilon Solan; Nicolas Vieille 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 253 KB

Communication complexity and stability o

Communication complexity and stability of equilibria in economies and games

✍ J. S. Jordan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 240 KB

On computational complexity of membershi

On computational complexity of membership test in flow games and linear production games

✍ Qizhi Fang; Shanfeng Zhu; Maocheng Cai; Xiaotie Deng 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 101 KB

The advantage of complexity in two 2 × 2

The advantage of complexity in two 2 × 2 games

✍ Jim Engle-Warnick 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

Coordination complexes in two dimensiona

Coordination complexes in two dimensional magnets and superconductors

✍ Peter Day 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Traditionally coordination chemists have been concerned with tailoring the properties of metal ions by modifying the ligand arrangement around single centres or small groups of ions. However, over the last 10 years or so, the properties of ordered infinite aggregates of metal ions, connected by brid