10.1109/JSAC.2008.080914IEEE Journal on Selected Areas in Communications2671170-1182ISAC
We consider any network environment in which the “best shot game” is played. This is the case where...
I present a simple and fast algorithm that finds all the pure-strategy Nash equilibria in games with...
We study the computational complexity of deciding the existence of a Pure Nash Equilibrium in multi-...
International audienceAmong other solution concepts, the notion of the pure Nash equilibrium plays a...
We develop an efficient algorithm for computing pure strat-egy Nash equilibria that satisfy various ...
We investigate from the computational viewpoint multi-player games that are guaranteed to have pure ...
We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, e...
International audienceThe best response algorithm is often used in game theory to find Nash equilibr...
In game theory, Nash equilibria, the states where no players can gain by unilaterally changing their...
We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, e...
Game theory is a mathematical framework for representing interactions of rational players trying to ...
We study multiplayer reachability games played on a finite directed graph equipped with target sets,...
International audienceThis paper deals with the complexity of computing Nash and correlated equilibr...
This paper deals with the complexity of computing Nash and correlated equilib-ria for a finite game ...
How long does it take until economic agents converge to an equilibrium? By studying the complexity o...
We consider any network environment in which the “best shot game” is played. This is the case where...
I present a simple and fast algorithm that finds all the pure-strategy Nash equilibria in games with...
We study the computational complexity of deciding the existence of a Pure Nash Equilibrium in multi-...
International audienceAmong other solution concepts, the notion of the pure Nash equilibrium plays a...
We develop an efficient algorithm for computing pure strat-egy Nash equilibria that satisfy various ...
We investigate from the computational viewpoint multi-player games that are guaranteed to have pure ...
We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, e...
International audienceThe best response algorithm is often used in game theory to find Nash equilibr...
In game theory, Nash equilibria, the states where no players can gain by unilaterally changing their...
We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, e...
Game theory is a mathematical framework for representing interactions of rational players trying to ...
We study multiplayer reachability games played on a finite directed graph equipped with target sets,...
International audienceThis paper deals with the complexity of computing Nash and correlated equilibr...
This paper deals with the complexity of computing Nash and correlated equilib-ria for a finite game ...
How long does it take until economic agents converge to an equilibrium? By studying the complexity o...
We consider any network environment in which the “best shot game” is played. This is the case where...
I present a simple and fast algorithm that finds all the pure-strategy Nash equilibria in games with...
We study the computational complexity of deciding the existence of a Pure Nash Equilibrium in multi-...
DOI
Add to ORKG