Displaying similar documents to “Diversity of logical agents in games”

On independence-friendly fixpoint logics

J. C. Bradfield (2004)

Philosophia Scientiae

Similarity:

We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi.

Three notes on the complexity of model checking fixpoint logic with chop

Martin Lange (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of the modal -calculus with a sequential composition operator. It uses two known game-based characterisations to derive the following results: the combined model checking complexity as well as the data complexity of FLC are EXPTIME-complete. This is already the case for its alternation-free fragment. The expression complexity of FLC is trivially P-hard and limited from above by the complexity...

Logical consequence and the theory of games

Paul Harrenstein (2004)

Philosophia Scientiae

Similarity:

Logical notions of consequence have frequently been related to game-theoretical solution concepts. The correspondence between a formula being classically valid and the existence of a winning strategy for a player in a related two-person game, has been most prominent in this context. We propose a conservative extension of the classical notion of consequence that is based on a generalization of the game-theoretical solution concept of Nash equilibrium.

Design of a Participatory Decision Making Agent Architecture Based on Argumentation and Influence Function – Application to a Serious Game about Biodiversity Conservation

Alessandro Sordoni, Jean-Pierre Briot, Isabelle Alvarez, Eurico Vasconcelos, Marta de Azevedo Irving, Gustavo Melo (2010)

RAIRO - Operations Research

Similarity:

This paper addresses an ongoing experience in the design of an artificial agent taking decisions and combining them with the decisions taken by human agents. The context is a serious game research project, aimed at computer-based support for participatory management of protected areas (and more specifically national parks) in order to promote biodiversity conservation and social inclusion. Its objective is to help various stakeholders (, environmentalist, tourism operator) to collectively...

Evolving small-board Go players using coevolutionary temporal difference learning with archives

Krzysztof Krawiec, Wojciech Jaśkowski, Marcin Szubert (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively...

On knowledge games.

J. M. Lasry, J. M. Morel, S. Solimini (1989)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

We give a formalization of the ?knowledge games? which allows to study their decidability and convergence as a problem of mathematics. Our approach is based on a metalemma analogous to those of Von Neumann and Morgenstern at the beginning of Game Theory. We are led to definitions which characterize the knowledge games as objects is standard set theory. We then study rigorously the most classical knowledge games and, although we also prove that the ?common knowledge? in these games may...