A myopic adjustment process leading to best-reply matching
نویسندگان
چکیده
منابع مشابه
A myopic adjustment process leading to best-reply matching
We analyze a myopic strategy adjustment process in strategic-form games. It is shown that the steady states of the continuous time limit, which is constructed assuming frequent play and slow adjustment of strategies, are exactly the best-reply matching equilibria, as discussed by Droste, Kosfeld, and Voorneveld (2000. Mimeo, Tilburg University). In a best-reply matching equilibrium every player...
متن کاملBest-reply matching in games
We study a new equilibrium concept in non-cooperative games, where players follow a behavioral rule called best-reply matching. Under this rule a player matches the probability of playing a pure strategy to the probability that this strategy is a best reply. Kosfeld, Droste, and Voorneveld (2001) show that best-reply matching equilibria are stationary states in a simple model of social learning...
متن کاملStrategic Control of Myopic Best Reply in Repeated Games∗
How can a rational player strategically control a myopic best reply player in a repeated two-player game? We show that in games with strategic substitutes or strategic complements the optimal control strategy is monotone in the initial action of the opponent, in time periods, and in the discount rate. As an interesting example outside this class of games we present a repeated “textbook-like” Co...
متن کاملAsynchronous Best-Reply Dynamics
In many real-world settings (e.g., interdomain routing in the Internet) strategic agents are instructed to follow best-reply dynamics in asynchronous environments. In such settings players learn of each other’s actions via update messages that can be delayed or even lost. In particular, several players might update their actions simultaneously, or make choices based on outdated information. In ...
متن کاملImproving Best-Reply Search
Best-Reply Search (BRS) is a new search technique for gametree search in multi-player games. In BRS, the exponentially many possibilities that can be considered by opponent players is flattened so that only a single move, the best one among all opponents, is chosen. BRS has been shown to outperform the classic search techniques in several domains. However, BRS may consider invalid game states. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2002
ISSN: 0899-8256
DOI: 10.1016/s0899-8256(02)00007-6