English
Related papers

Related papers: Big, but not unruly: Tractable norms for anonymous…

200 papers

Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts, while Strategy Logic has first-order quantification over…

Logic in Computer Science · Computer Science 2013-07-18 François Laroussinie , Nicolas Markey

Alternating-time temporal logic with strategy contexts (ATLsc) is a powerful formalism for expressing properties of multi-agent systems: it extends CTL with strategy quantifiers, offering a convenient way of expressing both collaboration…

Logic in Computer Science · Computer Science 2015-09-25 François Laroussinie , Nicolas Markey , Arnaud Sangnier

In the following paper we present a new semantics for the well-known strategic logic ATL. It is based on adding roles to concurrent game structures, that is at every state, each agent belongs to exactly one role, and the role specifies what…

Logic in Computer Science · Computer Science 2012-04-17 Sjur Dyrkolbotn , Piotr Kaźmierczak , Erik Parmann , Truls Pedersen

In the following paper we present a new semantics for the well-known strategic logic ATL. It is based on adding roles to concurrent game structures, that is at every state, each agent belongs to exactly one role, and the role specifies what…

Logic in Computer Science · Computer Science 2013-03-05 Truls Pedersen , Sjur Dyrkolbotn , Piotr Kaźmierczak , Erik Parmann

In multi-agent system design, a crucial aspect is to ensure robustness, meaning that for a coalition of agents A, small violations of adversarial assumptions only lead to small violations of A's goals. In this paper we introduce a logical…

Logic in Computer Science · Computer Science 2023-07-21 Aniello Murano , Daniel Neider , Martin Zimmermann

The notions of symmetry and anonymity in strategic games have been formalized in different ways in the literature. We propose a combinatorial framework to analyze these notions, using group actions. Then, the same framework is used to…

Combinatorics · Mathematics 2021-03-19 Fernando Tohmé , Ignacio Viglizzo

We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of…

Logic in Computer Science · Computer Science 2010-08-11 Cătălin Dima , Constantin Enea , Dimitar Guelev

This paper studies the synthesis of control policies for an agent that has to satisfy a temporal logic specification in a partially observable environment, in the presence of an adversary. The interaction of the agent (defender) with the…

Systems and Control · Electrical Eng. & Systems 2020-11-09 Bhaskar Ramasubramanian , Luyao Niu , Andrew Clark , Linda Bushnell , Radha Poovendran

We consider quantitative extensions of the alternating-time temporal logics ATL/ATLs called quantitative alternating-time temporal logics (QATL/QATLs) in which the value of a counter can be compared to constants using equality, inequality…

Logic in Computer Science · Computer Science 2014-09-22 Steen Vester

Model-checking the alternating-time temporal logics ATL and ATL* with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In…

Computer Science and Game Theory · Computer Science 2013-07-18 Steen Vester

This paper studies the synthesis of control policies for an agent that has to satisfy a temporal logic specification in a partially observable environment, in the presence of an adversary. The interaction of the agent (defender) with the…

Systems and Control · Computer Science 2019-03-19 Bhaskar Ramasubramanian , Andrew Clark , Linda Bushnell , Radha Poovendran

Alternating-time temporal logics (ATL/ATL*) represent a family of modal logics for reasoning about agents' strategic abilities in multiagent systems (MAS). The interpretations of ATL/ATL* over the semantic model Concurrent Game Structures…

Artificial Intelligence · Computer Science 2018-11-28 Yedi Zhang , Fu Song , Taolue Chen

Model checking strategic abilities was successfully developed and applied since the early 2000s to ensure properties in Multi-Agent System. In this paper, we introduce the notion of capacities giving different abilities to an agent. This…

Multiagent Systems · Computer Science 2023-08-23 Gabriel Ballot , Vadim Malvone , Jean Leneutre , Youssef Laarouchi

We extend concurrent game structures (CGSs) with a simple notion of preference over computations and define a minimal notion of rationality for agents based on the concept of dominance. We use this notion to interpret a CL and an ATL…

Logic in Computer Science · Computer Science 2025-02-19 Yinfeng Li , Emiliano Lorini , Munyque Mittelmann

In this paper, we investigate the probabilistic variants of the strategy logics ATL and ATL* under imperfect information. Specifically, we present novel decidability and complexity results when the model transitions are stochastic and…

Multiagent Systems · Computer Science 2023-10-27 Francesco Belardinelli , Wojciech Jamroga , Munyque Mittelmann , Aniello Murano

In this Letter we present a new perspective for the study of the Public Goods games on complex networks. The idea of our approach is to consider a realistic structure for the groups in which Public goods games are played. Instead of…

Physics and Society · Physics 2015-05-30 Jesús Gómez-Gardeñes , Daniele Vilone , Angel Sánchez

In open systems verification, to formally check for reliability, one needs an appropriate formalism to model the interaction between agents and express the correctness of the system no matter how the environment behaves. An important…

Logic in Computer Science · Computer Science 2014-02-13 Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Moshe Y. Vardi

Alternating-time Temporal Logic (ATL*) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATL*i ) is well known to have an undecidable model-checking problem when agents have perfect recall.…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano

Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they…

Computer Science and Game Theory · Computer Science 2007-05-23 Joseph Y. Halpern , Leandro C. Rêgo

Alternating-time temporal logic (ATL$^*$) is a well-established framework for formal reasoning about multi-agent systems. However, while ATL$^*$ can reason about the strategic ability of agents (e.g., some coalition $A$ can ensure that a…

Artificial Intelligence · Computer Science 2024-03-13 Raven Beutner , Bernd Finkbeiner
‹ Prev 1 2 3 10 Next ›