Displaying similar documents to “Model theory for infinite quantifier languages”

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...

The Give and Take game: Analysis of a resource sharing game

Pedro Mariano, Luís Correia (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

We analyse Give and Take, a multi-stage resource sharing game to be played between two players. The payoff is dependent on the possession of an indivisible and durable resource, and in each stage players may either do nothing or, depending on their roles, give the resource or take it. Despite these simple rules, we show that this game has interesting complex dynamics. Unique to Give and Take is the existence of multiple Pareto optimal profiles that can also be Nash equilibria, and a...

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...

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.

An axiomatization of the aspiration core

Hans Keiding (2006)

Banach Center Publications

Similarity:

The aspiration core of a TU game was introduced by Bennett [1] as a payoff vector which is undominated and achievable in the sense that each player belongs to a coalition which can obtain the specified payoff for its members, and which minimizes the distance to the set of aggregate feasible payoffs among all such payoff vectors. In the paper a set of axioms is proposed which characterize the aspiration core, which may be considered as an extension of the core to a much larger set of...