The logic of games and its applications
Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
On the logic of cooperation and propositional control
Artificial Intelligence
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Deterrence and Defeasibility in Argumentation Process for ALIS Project
Computable Models of the Law
Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Dependencies Between Players in Boolean Games
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Compact preference representation and Boolean games
Autonomous Agents and Multi-Agent Systems
Dependencies between players in Boolean games
International Journal of Approximate Reasoning
Boolean combinations of weighted voting games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
On the logic of cooperation and propositional control
Artificial Intelligence
Compact preference representation for boolean games
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Weighted Boolean formula games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Dependence theory via game theory
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Group announcements: logic and games
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Designing incentives for Boolean games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Dependence in games and dependence games
Autonomous Agents and Multi-Agent Systems
Manipulating boolean games through communication
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Incentive engineering for Boolean games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Towards tractable Boolean games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Incentive engineering for Boolean games
Artificial Intelligence
Proof systems and transformation games
Annals of Mathematics and Artificial Intelligence
Taxation search in boolean games
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Strategic considerations in the design of committees
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Computing cooperative solution concepts in coalitional skill games
Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Verifiable equilibria in boolean games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In this paper Boolean games are introduced as a class of two-player zero-sum games along with a number of operations on them. We argue that Boolean games can be interpreted as modelling the information structures of two-person zero-sum games. As such they comprise games of imperfect information. The algebra of Boolean games modulo strategic equivalence is then proven to be isomorphic to the Lindenbaum algebra of Classical Propositional Logic. A neat match between the game-theoretical notion of a winning strategy and a logical counterpart, however, calls for a refinement of the notion of validity. Pursuing this issue we finally obtain a logical characterization of determinacy for Boolean games.