On the counting of strategies
In game theory, a classic qualitative question is to check whether a designated set of players has a winning strategy. In several safety-critical applications, however, it is important to ensure that some redundant strategies also exist, to be possibly used in case of some fault. In this paper, we i...
Autores principales: | Malvone, V, Mogavero, F, Murano, A, Sorrentino, L |
---|---|
Formato: | Conference item |
Publicado: |
Institute of Electrical and Electronics Engineers
2016
|
Ejemplares similares
-
Cycle detection in computation tree logic
por: Fontaine, G, et al.
Publicado: (2016) -
Cycle detection in computation tree logic
por: Fontaine, G, et al.
Publicado: (2018) -
Reasoning about Strategies: on the Satisfiability Problem
por: Mogavero, F, et al.
Publicado: (2017) -
Hierarchical cost-parity games
por: Bozzelli, L, et al.
Publicado: (2017) -
Probabilistic strategy logic
por: Aminof, B, et al.
Publicado: (2019)