Expressing Properties of Coalitional Ability under Resource Bounds

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

doi:10.1007/978-3-642-04893-7_1

Cited by 4 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reasoning about agents' abilities under bounded resources has also become a major topic in the community of temporal and strategic logic, cf. the works by Alechina, Logan et al [3,4,8,[5][6][7] and Bulling and Farwer [12,11]. We review the most relevant approaches below.…”

Section: Related Workmentioning

confidence: 99%

Accumulative knowledge under bounded resources

Jamroga

Tabatabaei

2015

Journal of Logic and Computation

View full text Add to dashboard Cite

A possible purpose of performing an action is to gather information. Such information-collecting actions are usually resourceconsuming. The resources needed for performing them can be for example time or memory, but also money, specialized equipment etc. In this work, we propose a formal framework to study how the ability of an agent to improve its knowledge changes as a result of changing the available resources. We introduce a model for resource-consuming informationcollecting actions, and show how the process of accumulating knowledge can be modelled. Based on this model, we propose a modal logic for reasoning about the epistemic abilities of agents. We present some validities of the logic, and show that the model checking problem sits in the first level of polynomial hierarchy. We also discuss the connection between our framework and classic information theory. More specifically, we show that the notion of uncertainty given by Hartley measure can be seen as a special case of an agent's ability to improve its knowledge using information-collecting actions.

show abstract

Section: Related Workmentioning

confidence: 99%

Accumulative knowledge under bounded resources

Jamroga

Tabatabaei

2015

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…Moreover, they can achieve this by spending 3 units of energy and 1 unit of memory by choosing the following actions: (send12,idle) in q 0 , (idle,save) in q 1 and (idle,send2b) in q 4 . This can be expressed in RB-ATL as {1,2} (3,1) Up. It is also the case that the agents cannot achieve this without using some memory, even if they use unlimited energy: ¬ {1,2} (∞,0) Up.…”

Section: Truth Definition For Rb-atlmentioning

confidence: 99%

“…Clearly, neither of the agents can single-handedly enforce q 6 ; however, once the system is in q 6 , either agent can trivially maintain p forever, since the only choice of action available to each agent there is idle. This can be expressed as {1,2} (3,1) U {1} 0,0 p.…”

Section: Truth Definition For Rb-atlmentioning

confidence: 99%

“…The only work in this tradition that considered resources is [17], which introduced Coalitional Resource Games and studied complexity of decision problems for these games. A logic for describing Coalitional Resource Games and a model-checking procedure for the logic were proposed in [3]; however, the only modality that logic has is A b (only one-step games were considered).…”

Section: Theoremmentioning

confidence: 99%

“…RBCL can express properties of the form (1) above, but not of the form (2) and (3). Other work on ATL with resource bounds 3…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Alternating-time temporal logic with resource bounds

Nguyen

Alechina

Logan

et al. 2015

Journal of Logic and Computation

Self Cite

View full text Add to dashboard Cite

Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, and there is no straightforward way of reasoning about resource requirements in logics such as Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). In this article, we describe a logic for reasoning about coalitional ability under resource constraints. We extend ATL with costs of actions and hence of strategies. We give a complete and sound axiomatization of the resulting logic, Resource-Bounded ATL (RB-ATL) and a model-checking algorithm for it.

show abstract