Machine learning (ML) is now widespread. Traditional software engineering can be applied
to the development ML applications. However, we have to consider specific problems with …

In this paper, we study the problem of learning to satisfy temporal logic specifications with a
group of agents in an unknown environment, which may exhibit probabilistic behaviour …

Causal reasoning and game-theoretic reasoning are fundamental topics in artificial
intelligence, among many other disciplines: this paper is concerned with their intersection …

We provide a survey of the state of the art of rational verification: the problem of checking
whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria …

We study a class of synchronous, perfect-recall multi-agent systems with imperfect
information and broadcasting, ie, fully observable actions. We define an epistemic extension …

In the context of multi-agent systems, the rational verification problem is concerned with
checking which temporal logic properties will hold in a system when its constituent agents …

Abstract Model checking is the best-known and most successful approach to formally
verifying that systems satisfy specifications, expressed as temporal logic formulae. In this …

In game theory, as well as in the semantics of game logics, a strategy can be represented by
any function from states of the game to the agent's actions. That makes sense from the …

In rational synthesis, we automatically construct a reactive system that satisfies its
specification in all rational environments, namely environments that have objectives and act …

Abstract We present EVE (Equilibrium Verification Environment), a formal verification tool for
the automated analysis of temporal equilibrium properties of concurrent and multi-agent …