46 citations · 75 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.GT2013★ 2 cited
The Complexity of Admissibility in Omega-Regular Games
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwa…
cs.CR2013★ 46 cited
Quantifying Opacity
B. Bérard, J. Mullins, M. Sassolas
Opacity is a general language-theoretic framework in which several security properties of a system can be expressed. Its parameters are a predicate, given as a subset of runs of th…