✦ LIBER ✦

On two-person Nash implementable choice functions

✍ Scribed by Matthew O. Jackson; Sanjay Srivastava

No coin nor oath required. For personal study only.

✦ Synopsis

An elementary proof of a theorem on two-person Nash implementable choice functions is provided.

📜 SIMILAR VOLUMES

Impossibility of Nash implementation in

✍ Shinsuke Nakamura 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Minimal manipulability and interjacency

✍ Peter Fristrup; Hans Keiding 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 232 KB

On the implementation of the L-Nash barg

✍ Ferenc Forgó; János Fülöp 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 212 KB

Many-step two-person games with a fixed

✍ V. S. Aliev; A. F. Kononenko 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 166 KB

The role of information on the opponent'

✍ A.F. Kononenko 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 433 KB