No. Title Author Year
1 On the Complexity of SPEs in Parity Games Brice, Léonard et al. 2022
2 Pareto-Rational Verification Bruyère, Véronique et al. 2022
3 Strategy Synthesis for Global Window PCTL Bordais, Benjamin et al. 2022
4 The Complexity of SPEs in Mean-Payoff Games Brice, Léonard et al. 2022
5 Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games Balachander, Mrudula et al. 2021
6 Stackelberg-Pareto Synthesis Bruyère, Véronique et al. 2021
7 Subgame-Perfect Equilibria in Mean-Payoff Games Brice, Léonard et al. 2021
8 Monte Carlo Tree Search Guided by Symbolic Advice for MDPs Busatto-Gaston, Damien et al. 2020
9 The Adversarial Stackelberg Value in Quantitative Games Filiot, Emmanuel et al. 2020
10 Weighted Transducers for Robustness Verification Filiot, Emmanuel et al. 2020
11 Energy Mean-Payoff Games Bruyère, Véronique et al. 2019
12 Expected Window Mean-Payoff Bordais, Benjamin et al. 2019
13 The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games Brihaye, Thomas et al. 2019
14 Beyond Admissibility: Dominance Between Chains of Strategies Basset, Nicolas et al. 2018
15 Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints Kretínský, Jan et al. 2018
16 Parameterized complexity of games with monotonically ordered omega-regular objectives Bruyère, Véronique et al. 2018
17 Safe and Optimal Scheduling for Hard and Soft Tasks Geeraerts, Gilles et al. 2018
18 Admissibility in Games with Imperfect Information (Invited Talk) Brenguier, Romain et al. 2017
19 Admissiblity in Concurrent Games Basset, Nicolas et al. 2017
20 Front Matter, Table of Contents, Preface, Conference Organization Larsen, Kim G. et al. 2017
21 LIPIcs, Volume 83, MFCS'17, Complete Volume Larsen, Kim G. et al. 2017
22 Minkowski Games Le Roux, Stéphane et al. 2017
23 Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes Berthon, Raphaël et al. 2017
24 Admissibility in Quantitative Graph Games Brenguier, Romain et al. 2016
25 Minimizing Regret in Discounted-Sum Games Hunter, Paul et al. 2016
26 On the Complexity of Heterogeneous Multidimensional Games Bruyere, Veronique et al. 2016
27 The Complexity of Rational Synthesis Condurache, Rodica et al. 2016
28 Assume-Admissible Synthesis Brenguier, Romain et al. 2015
29 Reactive Synthesis Without Regret Hunter, Paul et al. 2015
30 Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability Brihaye, Thomas et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 35

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI