✦ LIBER ✦

Bounds for best response functions in binary games

✍ Scribed by Brendan Kline; Elie Tamer

Book ID: 113700328
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 349 KB
Volume: 166
Category: Article
ISSN: 0304-4076
DOI: 10.1016/j.jeconom.2011.06.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Best response dynamics for role games

✍ Ulrich Berger 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 168 KB

Knowledge and best responses in games

✍ S. Ambroszkiewicz 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 493 KB

On best error bounds for approximation b

On best error bounds for approximation by piecewise polynomial functions

✍ Olof Widlund 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 594 KB

Best response dynamics in finite games w

Best response dynamics in finite games with additive aggregation

✍ Nikolai S. Kukushkin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 254 KB

CONFIDENCE BOUNDS FOR FREQUENCY RESPONSE

CONFIDENCE BOUNDS FOR FREQUENCY RESPONSE FUNCTIONS FROM TIME SERIES MODELS

✍ K. Worden 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 227 KB

The harmonic probing algorithm allows the generation of frequency response functions (FRFs) from discrete-time system models. If the model is non-linear, the higher-order FRFs or Volterra kernel transforms can be obtained. The object of this paper is to supplement the algorithm with a procedure for

The complexity of computing best-respons

The complexity of computing best-response automata in repeated games

✍ Itzhak Gilboa 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 662 KB