Modal logic
Axiomatising Nash-Consistent Coalition Logic
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
A normal simulation of coalition logic and an epistemic extension
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Description logic for coalitions
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Strategic games and truly playable effectivity functions
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Reasoning about coalitional agency and ability in the logics of "bringing-it-about"
Autonomous Agents and Multi-Agent Systems
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
A well-known result in the logical analysis of cooperative games states that the so-called playable effectivity functions exactly correspond to strategic games. More precisely, this result states that for every playable effectivity function E there exists a strategic game that assigns to coalitions of players exactly the same power as E, and every strategic game generates a playable effectivity function. While the latter direction of the correspondence is correct, we show that the former does not hold for a number of infinite state games. We point out where the original proof of correspondence goes wrong, and we present examples of playable effectivity functions for which no equivalent strategic game exists. Then, we characterize the class of truly playable effectivity functions, that do correspond to strategic games. Moreover, we discuss a construction that transforms any playable effectivity function into a truly playable one while preserving the power of most (but not all) coalitions. We also show that Coalition Logic (CL), a formalism used to reason about effectivity functions, is not expressive enough to distinguish between playable and truly playable effectivity functions, and we extend it to a logic that can make that distinction while still enjoying the good meta-logical properties of CL, such as finite axiomatization and decidability via finite model property.