International audienceWe examine the case of a two-person repeated game played by a boundedly rational player versus an unboundedly rational opponent. The former is restricted to strategies which are implementable by connected finite automata. It is shown that the "rational" player has a dominant strategy, and that in some cases the "weaker" (boundedly rational) player may exploit this fact to "blackmail" him. It is also shown that for a repeated zero-sum game, the rational player has a strategy which drives the automaton player's limit payoff down to his security (maxmin) level, even if he may choose any finite automaton
We examine questions of optimality and domination in repeated stage games where one or both players ...
This dissertation combines three contributions to the literature on bounded rationality in games. Th...
In game theory, as well as in the semantics of game logics, a strategy can be represented by any fun...
We study two-person repeated games in which a player with a restricted set of strategies plays again...
A central question in game theory, learning, and other fields is how a rational intelligent agent sh...
Rationality in games and decisions is traditionally understood as requiring that agents act optimall...
International audienceWe define a finite-horizon repeated network formation game with consent and st...
We study a two-person zero-sum game where players simultaneously choose sequences of actions, and th...
We define a finite-horizon repeated network formation game with consent, and study the differences i...
Bounded rationality aims to understand the effects of how limited rationality affects decision-makin...
Finite complexity strategies suffice for approximating all subgame perfect equ ilibrium payoffs of r...
The paper examines the asymptotic behavior of the set of equilibrium payoffs in a repeated game when...
We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing st...
We study a two-person zero-sum game where players simultaneously choose sequences of actions, and th...
This paper examines the implications of a 'strong' version of bounded rationality popular within com...
We examine questions of optimality and domination in repeated stage games where one or both players ...
This dissertation combines three contributions to the literature on bounded rationality in games. Th...
In game theory, as well as in the semantics of game logics, a strategy can be represented by any fun...
We study two-person repeated games in which a player with a restricted set of strategies plays again...
A central question in game theory, learning, and other fields is how a rational intelligent agent sh...
Rationality in games and decisions is traditionally understood as requiring that agents act optimall...
International audienceWe define a finite-horizon repeated network formation game with consent and st...
We study a two-person zero-sum game where players simultaneously choose sequences of actions, and th...
We define a finite-horizon repeated network formation game with consent, and study the differences i...
Bounded rationality aims to understand the effects of how limited rationality affects decision-makin...
Finite complexity strategies suffice for approximating all subgame perfect equ ilibrium payoffs of r...
The paper examines the asymptotic behavior of the set of equilibrium payoffs in a repeated game when...
We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing st...
We study a two-person zero-sum game where players simultaneously choose sequences of actions, and th...
This paper examines the implications of a 'strong' version of bounded rationality popular within com...
We examine questions of optimality and domination in repeated stage games where one or both players ...
This dissertation combines three contributions to the literature on bounded rationality in games. Th...
In game theory, as well as in the semantics of game logics, a strategy can be represented by any fun...