Cournot tâtonnement and dominance solvability in finite games
نویسنده
چکیده
If a finite strategic game is strictly dominance solvable, then every simultaneous best response adjustment path, as well as every non-discriminatory individual best response improvement path, ends at a Nash equilibrium after a finite number of steps. If a game is weakly dominance solvable, then every strategy profile can be connected to a Nash equilibrium with a simultaneous best response path and with an individual best response path (if there are more than two players, switches from one best response to another may be needed). Both statements remain valid if dominance solvability in the usual sense is replaced with “BR-dominance solvability,” where a strategy can be eliminated if it is not among the best responses to anything, or if it is not indispensable for providing the best responses to all contingencies. For a two person game, some implications in the opposite direction are obtained.
منابع مشابه
A fixed point characterization of the dominance-solvability of lattice games with strategic substitutes
This note demonstrates that a lattice game with strategic substitutes is dominancesolvable if and only if there exists a unique fixed point of the function that results from an iteration of the best response function. This finding complements a result of Milgrom and Roberts’ (1990) by which a lattice game with strategic complements is dominance-solvable if and only if there exists a unique Nash...
متن کاملScoring rule voting games and dominance solvability
This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) of general scoring rule voting games. The scoring rules we study include Plurality rule, Approval voting, Negative Plurality Rule, Borda rule and Relative Utilitarianism. We provide a classification of scoring rule voting games according to whether the sufficient conditions for dominance solvabili...
متن کاملFluid Intelligence and Cognitive Reflection in a Strategic Environment: Evidence from Dominance-Solvable Games
Dominance solvability is one of the most straightforward solution concepts in game theory. It is based on two principles: dominance (according to which players always use their dominant strategy) and iterated dominance (according to which players always act as if others apply the principle of dominance). However, existing experimental evidence questions the empirical accuracy of dominance solva...
متن کاملDominance Solvability of Dynamic Bargaining Games
We formulate and study a general finite-horizon bargaining game with simultaneous moves and a disagreement outcome that need not be the worst possible result for the agents. Conditions are identified under which the game is dominance solvable in the sense that iterative deletion of weakly dominated strategies selects a unique outcome. Our analysis uses a backward induction procedure to pinpoint...
متن کاملAn experiment on learning with limited information: nonconvergence, experimentation cascades, and the advantage of being slow
We present the results of an experiment on learning in a continuous-time low-information setting. For a dominance solvable version of a Cournot oligopoly with differentiated products, we find little evidence of convergence to the Nash equilibrium. In an asynchronous setting, characterized by players updating their strategies at different frequencies, play tends toward the Stackelberg outcome wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 160 شماره
صفحات -
تاریخ انتشار 2012