University of Birmingham > Talks@bham > Theoretical computer science seminar > Refining Strategic Ability

Refining Strategic Ability

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Neel Krishnaswami.

Alternating-time Temporal Logic is a popular formalism for reasoning about strategic ability. Multiplayer coalitional finite and infinite games can be specified by their temporal winning conditions and combinations of such games on the same arena can reasoned about. A new modality on concurrent game models which I propose expresses the ultimate possibility to distribute the strategic ability of a player so that distribution gives its sub-players a desired combination of abilities to achieve some goals while others stay inaccessible, even possibly in co-operation with other principal players. This is important for the internal organization in collective bodies: e.g., if a single key allows full access to a vehicle or building, you cannot grant access as flexibly as you might wish. I have shown the decidability of model checking for a subset of ATL with the new modality, and have shown some properties which are expressible as axioms.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.