Daniel Stan

Learn More
We study the almost-sure reachability problem in a distributed system obtained as the asyn-chronous composition of N copies (called processes) of the same automaton (called protocol), that can communicate via a shared register with finite domain. The automaton has two types of transitions: write-transitions update the value of the register, while(More)
We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need not exist when players are given arbitrary terminal-reward objectives, and their existence is undecidable with qualitative reachability objectives (and only three players).(More)
We study mixed-strategy Nash equilibria in multiplayer deterministic concurrent games played on graphs, with terminal-reward payoffs (that is, absorbing states with a value for each player). We show undecidability of the existence of a constrained Nash equilibrium (the constraint requiring that one player should have maximal payoff), with only three players(More)
Le contexte général La théorie des jeux, en particulier sur des graphes, s'avère efficace pour modéliser les interactions entre plusieurs systèmes informatiques complexes. Elle permet la modélisation d'interactions qui ne sont pas toujours antago-nistes (les agents peuvent avoir des intérêts communs). La notion d'´ equilibre de Nash introduite par [3], pour(More)
  • 1