A logic for coalitions with bounded resources

Authors:
Natasha Alechina;Brian Logan;Nguyen Hoang Nga;Abdur Rakib
Affiliations:
School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 5
Cited 6

Alternating-time temporal logic

Journal of the ACM (JACM)
Coalition games and alternating temporal logics

TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
On the computational complexity of coalitional resource games

Artificial Intelligence
Verifying time, memory and communication bounds in systems of reasoning agents

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Logic for automated mechanism design: a progress report

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1

Expressing properties of coalitional ability under resource bounds

LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Resource-bounded alternating-time temporal logic

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On the (Un-)Decidability of Model Checking Resource-Bounded Agents

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On a Logic for Coalitional Games with Priced-Resource Agents

Electronic Notes in Theoretical Computer Science (ENTCS)
State and path coalition effectivity models for logics of multi-player games

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work on Alternating-Time Temporal Logic and Coalition Logic has allowed the expression of many interesting properties of coalitions and strategies. However there is no natural way of expressing resource requirements in these logics. This paper presents a Resource-Bounded Coalition Logic (RBCL) which has explicit representation of resource bounds in the language, and gives a complete and sound axiomatisation of RBCL.