Representation and complexity in Boolean games

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 347-359

  Dunne, Paul E ^a   Van Der Hoek, Wiebe ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; MULTI AGENT SYSTEMS; PROBLEM SOLVING; SEMANTICS; ARTIFICIAL INTELLIGENCE;

BOOLEAN GAMES; DECISION PROBLEMS; TWO-PLAYER GAMES; WINNING STRATEGY;

GAME THEORY;

ATOMIC ACTIONS; BOOLEAN GAMES; DECISION PROBLEMS; NORMAL FORM; TWO-PLAYER GAMES; WINNING STRATEGY;

EID: 22944482212     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_30     Document Type: Conference Paper

References (11)

1. P. E. Dunne. The Complexity of Boolean Networks. Academic Press, London, 1988
2. V. Goranko. The Basic Algebra of Game Equivalences. In ESSLLI Workshop on Logic and Games (ed: M. Pauly and G. Sandhu), 2001
3. P. Harrenstein. Logic in Conflict - Logical Exploration in Strategic Equilibrium. Ph. D. dissertation, Dept. of Computer Science, Univ. of Utrecht, 2004 (submitted)
4. B. P. Harrenstein, W. van der Hoek, J.-J. Meyer, and C. Witteveen. Boolean Games. In Proc. 8th Conf. on Theoretical Aspects of Rationality and Knowledge (TARK 2001), (ed: J. van Benthem), Morgan-Kaufmann, San Francisco, pages 287-298, 2001
5. L. Henkin. Some remarks on infinitely long formulas. In Infinistic Methods, pages 167-183. Pergamon Press, Oxford, 1961.
6. L. Hyafil and R. Rivest. Constructing Optimal Binary Decision Trees is NP-complete. Inf. Proc. Letters, 5, pp. 15-17, 1976
7. Logic and games. Special issue of Journal of Logic, Language and Information, 2002.
8. M. Pauly. Logic for Social Software. Ph. D. dissertation, Institute for Logic, Language and Information, Amsterdam, 2001
9. C. S. Peirce. Reasoning and the Logic of Things: The Cambridge Conferences Lectures of 1898. Harvard University Press, 1992.
10. M. Wooldridge and P. E. Dunne. On the Computational Complexity of Qualitative Coalitional Games. Technical Report, ULCS-04-007, Dept. of Computer Science, Univ. of Liverpool, 2004, (to appear: Artificial Intelligence)
11. I. I. Zhegalkin. The technique of calculation of statements in symbolic logic. Matem. Sbornik, 34, pp. 9-28, 1927 (in Russian)