AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Choosing social laws for multi-agent systems: minimality and simplicity
Artificial Intelligence
Alternating-time temporal logic
Journal of the ACM (JACM)
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of facets (and some facets of complexity)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On the logic of cooperation and propositional control
Artificial Intelligence
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On the synthesis of useful social laws for artificial agent societies
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Do agents make model checking explode (computationally)?
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
| Hi-index | 0.00 |
We propose coalitional normative system (Cns), which can selectively restrict the joint behavior of a coalition, in this paper. We extend the semantics of Atl and propose Coordinated Atl (Co-Atl) to support the formalizing of Cns. We soundly and completely characterize the limitation of the normative power of a coalition by identifying two fragments of Co-Atl language corresponding to two types of system properties that are unchangeable by restricting the joint behavior of such a coalition. Then, we prove that the effectiveness checking, feasibility and synthesis problems of Cns are Ptime-complete, Np-complete and Fnp-complete, respectively. Moreover, we define two concepts of optimality for Cns, that is, minimality and compactness, and prove that both minimality checking and compactness checking are Conp-complete while the problem of checking whether a coalition is a minimal controllable coalition is Dp-complete. The relation between Ns and Cns is discussed, and it turns out that Nss intrinsically consists of a proper subset of Cnss and some basic problems related to Cns are no more complex than that of Ns.