In this paper, we prove that the SPE constrained existence problem, i.e. the problem of deciding, in a given game, the existence of a subgame-perfect equilibrium that generates a payoff profile between two given thresholds, is \(\mathsf {NP} \) -complete for both parity games and mean-payoff games. For that purpose, we...
Léonard Brice, J. Raskin, Marie van den Bogaard· Journal of the ACM· 0 citations
In this paper, we consider Robbins'problem, which is a full information variant of the well-known secretary selection problem. In this version of the problem, the goal is to minimize the expected rank of the selected candidate among $n$ that are interviewed sequentially, and a decision to select or not the $m^{th}$ can...
Léonard Brice, F. Bruss, Anirban Majumdar et al.· Principles of Verification· 0 citations
The main results obtained for both semantics since the introduction of the model in 2014 are surveyed, which cover reachability, parity and Rabin objectives, under the qualitative criteria (almost-sure, limit-sure and the quantitative value-threshold problem, and the key algorithmic ideas are outlined.
J. Raskin· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
