✦ LIBER ✦

α -Decisiveness In Simple Games

✍ Scribed by Francesc Carreras

Publisher: Springer US
Year: 2004
Tongue: English
Weight: 113 KB
Volume: 56
Category: Article
ISSN: 0040-5833
DOI: 10.1007/s11238-004-5637-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Incentives in simple bargaining games

✍ Martin Sefton 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Structural satisfaction in simple games

✍ Christopher H. Nevison 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Inferior players in simple games

✍ Stefan Napel; Mika Widgrén 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 127 KB

Hierarchies achievable in simple games

✍ Josep Freixas; Montserrat Pons 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 150 KB

Winners, blockers, and the status quo: S

Winners, blockers, and the status quo: Simple collective decision games and the core

✍ James D. Laing; Sampei Nakabayashi; Benjamin Slotznick 📂 Article 📅 1983 🏛 Springer US 🌐 English ⚖ 834 KB

We thank Robin Forman for two useful proofs, Peter H. Aranson, Howard Rosenthal, Kriss A. Sjoblom, and anonymous referees for thoughtful comments, DouglasH. Blair for calling Greenberg's (1979) important results to our attention, and Patricia Cook for typing the manuscript.

Arthur–Merlin Games in Boolean Decision

Arthur–Merlin Games in Boolean Decision Trees

✍ Ran Raz; Gábor Tardos; Oleg Verbitsky; Nikolai Vereshchagin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones (N. Nisan, SIAM J. Comput. 20, No. 6 (1991), 999 1007). Motivated by a question if randomization can significantly speed up a nondeterministic computation via a boolean decision tree, we a