Logic for coalitions with bounded resources

Alechina, Natasha; Logan, Brian; Nguyen, Hoang Nga; Rakib, Abdur

doi:10.1093/logcom/exq032

Cited by 41 publications

(46 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is easy to see that 5 is valid in ATL i s R , and that the single strategy is just a concatenation of the two strategies that we get on the left hand side of the implication. On the other hand, for the "poor duck model" M 1 and p ≡ shot, we get that …”

Section: Proposition 14 Val(atl I S R ) ⊆ Val(atl I S R )mentioning

confidence: 89%

“…ATL was combined with epistemic logic [1,2,39,[60][61][62], and several semantic variants were defined that match various possible interpretations of ability [35,39,43,45,57]. Moreover, many conceptual extensions have been considered, e.g., with explicit reasoning about strategies, rationality assumptions and solution concepts [19,20,58,63,65], agents with bounded resources [5,6,14,15], coalition formation and negotiation [12], opponent modeling and action in stochastic environments [16,37,55,56] and reasoning about irrevocable plans and interplay between strategies of different agents [3,11].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Bulling

Jamroga

2013

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

Alternating-time temporal logic (ATL) is a modal logic that allows to reason about agents' abilities in game-like scenarios. Semantic variants of ATL are usually built upon different assumptions about the kind of game that is played, including capabilities of agents (perfect vs. imperfect information, perfect vs. imperfect memory, etc.). ATL has been studied extensively in previous years; however, most of the research focused on model checking. Studies of other decision problems (e.g., satisfiability) and formal meta-properties of the logic (like axiomatization or expressivity) have been relatively scarce, and mostly limited to the basic variant of ATL where agents possess perfect information and perfect memory. In particular, a comparison between different semantic variants of the logic is largely left untouched. In this paper, we show that different semantics of ability in ATL give rise to different validity sets. The issue is important for several reasons. First, many logicians identify a logic with its set of true sentences. As a consequence, we prove that different notions of ability induce different strategic logics. Secondly, we show that different concepts of ability induce different general properties of games. Thirdly, the study can be seen as the first systematic step towards satisfiability-checking algorithms for ATL with imperfect information. We introduce sophisticated unfoldings of models and prove invariance results that are an important technical contribution to formal analysis of strategic logics.

show abstract

Section: Proposition 14 Val(atl I S R ) ⊆ Val(atl I S R )mentioning

confidence: 89%

Section: Related Workmentioning

confidence: 99%

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Bulling

Jamroga

2013

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

show abstract

“…Note that the size (the number of formulas) of ccl(φ) is at most 2|φ|, hence it is polynomial in |φ| (unlike the closure for CL formulas defined in [25]; the latter was first observed to be exponential by Hoang Nga Nguyen and corrected in [24], a published version is in [3]). …”

Section: Theoremmentioning

confidence: 99%

Coalition logic with individual, distributed and common knowledge1

Ågotnes

Alechina

2018

Journal of Logic and Computation

View full text Add to dashboard Cite

Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have so far been missing. In this paper we provide several such results and proofs. We prove completeness for epistemic coalition logic with common knowledge, with distributed knowledge, and with both common and distributed knowledge, respectively. Furthermore, we completely characterise the complexity of the satisfiability problem for each of the three logics. We also study logics with interaction axioms connecting coalitional ability and knowledge.

show abstract

“…One of the first logics capable of expressing resource requirements of agents was a version of Coalition Logic (CL) 5 , called Resource-Bounded Coalition Logic (RBCL), where actions only consume (and don't produce) resources. It was introduced in [1] with the primary motivation of modelling systems of resource-bounded reasoners, however the framework is sufficiently general to model any kind of action.…”

Section: Consumption Of Resourcesmentioning

confidence: 99%

Verifying Systems of Resource-Bounded Agents

Alechina

Logan

2016

Pursuit of the Universal

View full text Add to dashboard Cite

Abstract. Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions. However such approaches often ignore a key aspect of multi-agent systems, namely that the agents' actions require (and sometimes produce) resources. We briefly survey previous work on the verification of multi-agent systems that takes resources into account, and outline some key challenges for future work.

show abstract

Logic for coalitions with bounded resources

Cited by 41 publications

References 6 publications

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Coalition logic with individual, distributed and common knowledge1

Verifying Systems of Resource-Bounded Agents

Contact Info

Product

Resources

About