The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Methods for task allocation via agent coalition formation
Artificial Intelligence
Distributed rational decision making
Multiagent systems
Coalition structure generation with worst case guarantees
Artificial Intelligence
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic Coalition Formation among Rational Agents
IEEE Intelligent Systems
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On the computational complexity of qualitative coalitional games
Artificial Intelligence
On the computational complexity of coalitional resource games
Artificial Intelligence
MASL: A Logic for the Specification of Multiagent Real-Time Systems
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On the computational complexity of coalitional resource games
Artificial Intelligence
Solving coalitional resource games
Artificial Intelligence
Expressing properties of coalitional ability under resource bounds
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Non-transferable utility coalitional games via mixed-integer linear constraints
Journal of Artificial Intelligence Research
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and each choice available to a coalition is a set of goals, which would be jointly satisfied if the coalition made that choice. A coalition in a QCG will typically form in order to bring about a set of goals that will satisfy all members of the coalition. In this paper, we introduce and study Temporal QCGs (TQCGs), i.e., games in which a sequence of QCGs is played. In order to represent and reason about such games, we introduce a linear time temporal logic of QCGs, known as £ (TQCG). We give a complete axiomatization of £ (TQCG), use it to investigate the properties of TQCGs in a small example, identify its expressive power, establish its complexity, characterise classes of TQGCs with formulas from our logical language, and formulate several (temporal) solution concepts for TQCGs.