International audienceThe following problem is examined: given a game and the opponents' finite automata, find a best-response automaton for a certain player in the repeated game. It is shown that the problem is relatively "easy" (i.e., of polynomial time complexity) if the number of players is fixed, but "difficult" otherwise
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoff...
In this thesis we develop methods for the solution of infinite games and present implementations of ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
International audienceThe following problem is examined: given a game and the opponents' finite auto...
The paper examines the asymptotic behavior of the set of equilibrium payoffs in a repeated game when...
We study the structure of Nash equilibria in 2-player repeated games played with finite automata, wh...
We study two-person repeated games in which a player with a restricted set of strategies plays again...
International audienceIn this paper we compute the worst-case and average execution time of the Best...
The theory of two-player infinite games provides a framework for studying the controller synthesis p...
International audienceThe best response algorithm is often used in game theory to find Nash equilibr...
This paper studies a two-player machine (finite automaton) game in which an extensive game with perf...
With the growth of the internet it is becoming increasingly important to understand how the behaviou...
We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing st...
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoff...
Parity games are abstract infinite-round games that take an important role in formal verification. I...
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoff...
In this thesis we develop methods for the solution of infinite games and present implementations of ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
International audienceThe following problem is examined: given a game and the opponents' finite auto...
The paper examines the asymptotic behavior of the set of equilibrium payoffs in a repeated game when...
We study the structure of Nash equilibria in 2-player repeated games played with finite automata, wh...
We study two-person repeated games in which a player with a restricted set of strategies plays again...
International audienceIn this paper we compute the worst-case and average execution time of the Best...
The theory of two-player infinite games provides a framework for studying the controller synthesis p...
International audienceThe best response algorithm is often used in game theory to find Nash equilibr...
This paper studies a two-player machine (finite automaton) game in which an extensive game with perf...
With the growth of the internet it is becoming increasingly important to understand how the behaviou...
We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing st...
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoff...
Parity games are abstract infinite-round games that take an important role in formal verification. I...
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoff...
In this thesis we develop methods for the solution of infinite games and present implementations of ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
DOI
Add to ORKG