Cart (Loading....) | Create Account
Close category search window

Strategic Ability Updating in Concurrent Games by Coalitional Commitment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chongjun Wang ; Nanjing Univ., Nanjing, China ; Jun Wu ; Zhongcun Wang ; Junyuan Xie

Strategic ability updating relates to establishing some required properties, which can be expressed by strategic abilities, in a multicomponent reactive system. We model such a reactive system as a concurrent game structure (CGS), which is the semantic model of Alternating-time Temporal Logic (ATL). Then, we propose coalitional commitment as a tool for achieving the required strategic ability updating. Intuitively, a coalitional commitment can extend the state space of a CGS by a context function and then delete some transitions by a coalitional normative system (CNS). We propose coordinated ATL (co-ATL) for reasoning about strategic abilities in the structures obtained from a CGS by implementing a CNS. The model-checking problem for co-ATL is proved to be PTIME-complete, just like that of ATL, and is thus tractable. Then, we characterize the limitation of coalitional commitment power by identifying the set of co-ATL formulas whose satisfaction cannot be established and the set of co-ATL formulas whose satisfaction cannot be avoided. Afterward, we show that the effectiveness problem, feasibility problem, and synthesis problem for coalitional commitment are PTIME-complete, NP-complete, and FNP-complete, respectively. Finally, we treat the coalitional commitment synthesis problem as an extended planning problem and present an algorithm based on the planning as model checking paradigm. Our work can be seen as an improvement for both social law research and planning via model checking research.

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:41 ,  Issue: 6 )

Date of Publication:

Dec. 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.