2015 22nd International Symposium on Temporal Representation and Reasoning (TIME) (2015)
Sept. 23, 2015 to Sept. 25, 2015
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2015.19
In game-theory, a classic qualitative question is to check whether a designed set of the players has a winning strategy. In several safety-critical applications, however, it is important to ensure that some redundant strategies also exist, to be used in case of some fault. By establishing how many different strategies a game admits, one can grade its resilience. In this paper, we introduce and study Graded Strategy Logic (GSL), an extension of Strategy Logic (SL) along with graded quantifiers. SL is a powerful formalism that allows to describe useful game concepts in multi-agent settings by explicitly quantifying over strategies treated as first-order citizens. In GSL, by means of the existential construct(x =g) f, one can state that at least g strategies satisfy f. Dually, via the universal construct [x
Games, History, Cognition, Semantics, Model checking, Open systems, Calculus
V. Malvone, F. Mogavero, A. Murano and L. Sorrentino, "On the Counting of Strategies," 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), Kassel, Germany, 2015, pp. 170-179.