We study games played on graphs by an arbitrary number of players withnon-zero sum objectives. The players representagents (programs, processes or devices) that can interact to achieve their ownobjectives as much as possible. Solution concepts, as Nash Equilibrium, forsuch optimal plays,need not exist when restricting topure deterministic strategies, even with simple reachability or safetyobjectives. The symmetry induced by deterministic behavioursmotivates the studies where eitherthe players or the environment can use randomization. In the first case, weshow that classical concepts are undecidable with a fixednumber of agents and propose computable approximations.In the second case, we studyrandomization as a reasonable policy for scheduli...
Given a zero-sum infinite game we examine the question if players have optimal memoryless determinis...
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning c...
Software systems are ubiquitous, and their reliability is often crucial, especially for theones oper...
Ce travail se concentre sur l'étude de jeux joués sur des graphes finis, parun nombre arbitraire de ...
In this paper we study distributed algorithms for computing a Nash Equilibrium in potential games.Ou...
Ces travaux portent sur l'étude des jeux concurrents et temporisés. Ces deux types de jeux sont des ...
Ces travaux portent sur l'étude des jeux concurrents et temporisés. Ces deux types de jeux sont des ...
International audienceIn this talk, I will show how one can characterize and compute Nash equilibria...
International audienceWe consider two-player zero-sum games on graphs. These games can be classified...
In game theory, Nash equilibria, the states where no players can gain by unilaterally changing their...
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the i...
I studied three optimization problems on graphs and combinatorial games.First, identifying codes wer...
In sequential learning (or repeated games), data is acquired and treated on the fly and an algorithm...
Stochastic games provide a versatile model for reactive systems that are affected by random events. ...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...
Given a zero-sum infinite game we examine the question if players have optimal memoryless determinis...
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning c...
Software systems are ubiquitous, and their reliability is often crucial, especially for theones oper...
Ce travail se concentre sur l'étude de jeux joués sur des graphes finis, parun nombre arbitraire de ...
In this paper we study distributed algorithms for computing a Nash Equilibrium in potential games.Ou...
Ces travaux portent sur l'étude des jeux concurrents et temporisés. Ces deux types de jeux sont des ...
Ces travaux portent sur l'étude des jeux concurrents et temporisés. Ces deux types de jeux sont des ...
International audienceIn this talk, I will show how one can characterize and compute Nash equilibria...
International audienceWe consider two-player zero-sum games on graphs. These games can be classified...
In game theory, Nash equilibria, the states where no players can gain by unilaterally changing their...
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the i...
I studied three optimization problems on graphs and combinatorial games.First, identifying codes wer...
In sequential learning (or repeated games), data is acquired and treated on the fly and an algorithm...
Stochastic games provide a versatile model for reactive systems that are affected by random events. ...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...
Given a zero-sum infinite game we examine the question if players have optimal memoryless determinis...
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning c...
Software systems are ubiquitous, and their reliability is often crucial, especially for theones oper...