Related papers: On Probabilistic Alternating Simulations
We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bounds. In model checking such specifications were introduced as…
Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its…
The Naming Game has been studied to explore the role of self-organization in the development and negotiation of linguistic conventions. In this paper, we define an automata networks approach to the Naming Game. Two problems are faced: (1)…
A model checking computation checks whether a given logical sentence is true in a given finite structure. Provenance analysis abstracts from such a computation mathematical information on how the result depends on the atomic data that…
Reinforcement-based learning dynamics may exhibit several limitations when applied in a distributed setup. In (repeatedly-played) multi-player/action strategic-form games, and when each player applies an independent copy of the learning…
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambda-calculus.…
Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he…
This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…
Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which, for model checking problems, can easily contain $10^9$…
The game-theoretic risk management framework put forth in the precursor work "Towards a Theory of Games with Payoffs that are Probability-Distributions" (arXiv:1506.07368 [q-fin.EC]) is herein extended by algorithmic details on how to…
We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. We define a grammar-like formalism to describe…
The overall aim of our research is to develop techniques to reason about the equilibrium properties of multi-agent systems. We model multi-agent systems as concurrent games, in which each player is a process that is assumed to act…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
A new class of stochastic variables, governed by a specifice set of rules, is introduced. These rules force them to loose some properties usually assumed for this kind of variables. We demonstrate that stochastic processes driven by these…
We propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially…
Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…
We focus on a family of one-dimensional probabilistic cellular automata with memory two: the dynamics is such that the value of a given cell at time $t+1$ is drawn according to a distribution which is a function of the states of its two…
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…
We consider qualitative simulation involving a finite set of qualitative relations in presence of complete knowledge about their interrelationship. We show how it can be naturally captured by means of constraints expressed in temporal logic…
Procedures of the short-term predictions for processes in general 2-person differential interactive games are proposed. Their effectiveness is discussed.