Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Véronique Bruyère"'
Autor:
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 4 (2020)
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium (NE), we fo
Externí odkaz:
https://doaj.org/article/8980ae3d9701411eb6b12d3588189a67
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 16-29 (2018)
We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notions of Nash equilibrium (NE) and subgame perfect equilibrium (SPE), we
Externí odkaz:
https://doaj.org/article/99ada5f995e74501bd74049f599830ef
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 226, Iss Proc. GandALF 2016, Pp 135-148 (2016)
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to encode omega-re
Externí odkaz:
https://doaj.org/article/8900d6f698884de2b00757e4ef07ce79
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 157, Iss Proc. SYNT 2014, Pp 51-67 (2014)
When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in
Externí odkaz:
https://doaj.org/article/7532704daa904753bd09a4b80fc8c6ab
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 1-8 (2014)
When reasoning about the strategic capabilities of an agent, it is important to consider the nature of its adversaries. In the particular context of controller synthesis for quantitative specifications, the usual problem is to devise a strategy for a
Externí odkaz:
https://doaj.org/article/532a33e24a904a4e91e8c5dfdc081016
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 1 (2013)
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed tha
Externí odkaz:
https://doaj.org/article/9c126e73fa45467494468930fc21b751
Autor:
Michel Rigo, Véronique Bruyère
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 9, Iss 2 (2007)
Externí odkaz:
https://doaj.org/article/560a5b30500a42208af5f525206ea750
Autor:
Véronique Bruyère, Michel Rigo
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 9 no. 2 (2007)
Held at the Institute of Mathematics of the University of Liège, Liège, September 8―11, 2004
Externí odkaz:
https://doaj.org/article/8117b71024a34b41a1b87135c2802954
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308222
Tools and Algorithms for the Construction and Analysis of Systems : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023
Tools and Algorithms for the Construction and Analysis of Systems : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023
We present a new streaming algorithm to validate JSON documents against a set of constraints given as a JSON schema. Among the possible values a JSON document can hold, objects are unordered collections of key-value pairs while arrays are ordered col
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb3279da7f22d6c994233ef9f7a097e5
http://arxiv.org/abs/2211.08891
http://arxiv.org/abs/2211.08891
Publikováno v:
Journal of Computer and System Sciences. 119:211-230
We study multiplayer reachability games played on a finite directed graph equipped with target sets, one for each player. In those reachability games, it is known that there always exists a Nash equilibrium (NE) and a subgame perfect equilibrium (SPE
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc0e13233afaf91adb74d01a78901137
https://doi.org/10.1016/j.jcss.2021.02.009
https://doi.org/10.1016/j.jcss.2021.02.009