Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Bogaard, Marie Van Den"'
This paper studies the rational synthesis problem for multi-player games played on graphs when rational players are following subgame perfect equilibria. In these games, one player, the system, declares his strategy upfront, and the other players, co
Externí odkaz:
http://arxiv.org/abs/2412.08547
Autor:
Brice, Léonard, Raskin, Jean-François, Sassolas, Mathieu, Scerri, Guillaume, Bogaard, Marie van den
Fairness is a desirable and crucial property of many protocols that handle, for instance, exchanges of message. It states that if at least one agent engaging in the protocol is honest, then either the protocol will unfold correctly and fulfill its in
Externí odkaz:
http://arxiv.org/abs/2405.18958
We study two natural problems about rational behaviors in multiplayer non-zero-sum sequential infinite duration games played on graphs: checking problems, that consist in deciding whether a strategy profile, defined by a Mealy machine, is rational; a
Externí odkaz:
http://arxiv.org/abs/2301.12913
Autor:
Doyen, Laurent, Bogaard, Marie van den
We consider Markov decision processes with synchronizing objectives, which require that a probability mass of $1-\epsilon$ accumulates in a designated set of target states, either once, always, infinitely often, or always from some point on, where $\
Externí odkaz:
http://arxiv.org/abs/2204.12814
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (October 25, 2023) lmcs:9222
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the notion of negot
Externí odkaz:
http://arxiv.org/abs/2203.08546
We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff games is NP-complete. While the SPE threshold problem was recently shown to be decidable (in doubly exponential time) and NP-hard, its exact worst case complexi
Externí odkaz:
http://arxiv.org/abs/2202.08499
We study the complexity of problems related to subgame-perfect equilibria (SPEs) in infinite duration non zero-sum multiplayer games played on finite graphs with parity objectives. We present new complexity results that close gaps in the literature.
Externí odkaz:
http://arxiv.org/abs/2107.07458
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the notion of negot
Externí odkaz:
http://arxiv.org/abs/2101.10685
Autor:
Brihaye, Thomas, Bruyère, Véronique, Goeminne, Aline, Raskin, Jean-François, Bogaard, Marie van den
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 4 (November 5, 2020) lmcs:5966
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:
http://arxiv.org/abs/1905.00784
Discounted-sum games provide a formal model for the study of reinforcement learning, where the agent is enticed to get rewards early since later rewards are discounted. When the agent interacts with the environment, she may regret her actions, realiz
Externí odkaz:
http://arxiv.org/abs/1811.07146