✦ LIBER ✦

On the computational complexity of qualitative coalitional games

✍ Scribed by Michael Wooldridge; Paul E Dunne

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 505 KB
Volume: 158
Category: Article
ISSN: 0004-3702
DOI: 10.1016/j.artint.2004.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the formation of coalitions in infini

On the formation of coalitions in infinite player games

✍ Edward Azoff; Charles Bird 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 665 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the computational complexity of infin

On the computational complexity of infinite words

✍ Pavol Ďuriš; Ján Maňuch 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the computational complexity of the o

On the computational complexity of the order polynomial

✍ Ulrich Faigle; Rainer Schrader 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 370 KB

On computational complexity of contextua

On computational complexity of contextual languages

✍ Lucian Ilie 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 726 KB

We consider the following restriction of internal contextual grammars, called local: in any derivation in a grammar, after applying a context, further contexts can be added only inside of or at most adjacent to the previous ones. We further consider a natural restriction of this derivation mode by r

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