What to maximize if you must

The assumption that decision makers choose actions to maximize their preferences is a central tenet in economics, often justified formally or informally by appealing to evolutionary arguments. In contrast, we show that in almost every game and for almost every family of distortions of a player's actual payoffs, some degree of this distortion is beneficial to the player, and will not be driven out by any evolutionary process involving payoff-monotonic selection dynamics. Consequently, under any such selection dynamics the population will not converge to payoff-maximizing behavior. We also show that payoff-maximizing behavior need not prevail when preferences are imperfectly observed.     

Implementation,Elimination of Weakly Dominated Strategies and Evolutionary Dynamics

This paper studies convergence and stability properties of T. Sjöström's (1994, Games Econom. Behav.6, 502–511) mechanism, under the assumption that boundedly rational players find their way to equilibrium using monotonic evolutionary dynamics and best-reply dynamics. This mechanism implements most social choice functions in economic environments using as a solution concept one round of deletion of weakly dominated strategies and one round of deletion of strictly dominated strategies. However, there are other sets of Nash equilibria, whose payoffs may be very different from those desired by the social choice function. With monotonic dynamics, all these sets of equilibria contain limit points of the evolutionary dynamics. Furthermore, even if the dynamics converge to the “right” set of equilibria (i.e., the one which contains the solution of the mechanism), it may converge to an equilibrium which is worse in welfare terms. In contrast with this result, any interior solution of the best-reply dynamics converges to the equilibrium whose outcome the planner desires. Journal of Economic Literature Classification Numbers: C72, D70, D78.     

Substituting one risk increase for another: A method for measuring risk aversion

This paper defines the rate of substitution of one stochastic change to a random variable for another. It then focuses on the case where one of these changes is an nth degree risk increase, and the other is an m  th degree risk increase, where n>m?1$n>m?1$. The paper shows that the rate of substitution for these two risk increases can be used to provide a broader definition and two additional characterizations of the nth degree Ross more risk averse partial order. The implications for local intensity measures of nth degree risk aversion are also examined. The analysis organizes the existing results as well as generates new ones.     

On the folk theorem with one-dimensional payoffs and different discount factors

Proving the folk theorem in a game with three or more players usually requires imposing restrictions on the dimensionality of the stage-game payoffs. Fudenberg and Maskin (1986) assume full dimensionality of payoffs, while Abreu et al. (1994) assume the weaker NEU condition (“nonequivalent utilities”). In this note, we consider a class of n-player games where each player receives the same stage-game payoff, either zero or one. The stage-game payoffs therefore constitute a one-dimensional set, violating NEU. We show that if all players have different discount factors, then for discount factors sufficiently close to one, any strictly individually rational payoff profile can be obtained as the outcome of a subgame-perfect equilibrium with public correlation.     

Stable games and their dynamics

We study a class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising agents are switching are always exceeded by the improvements in the payoffs of strategies which revising agents are abandoning. We prove that the set of Nash equilibria of a stable game is globally asymptotically stable under a wide range of evolutionary dynamics. Convergence results for stable games are not as general as those for potential games: in addition to monotonicity of the dynamics, integrability of the agents' revision protocols plays a key role.     

Iterated Weak Dominance in Strictly Competitive Games of Perfect Information

We prove that any strictly competitive perfect-information two-person game with n outcomes is solvable in n−1 steps of elimination of weakly dominated strategies— regardless of the length of the game tree. The given bound is shown to be tight using a variant of Rosenthal's centipede game. Journal of Economic Literature Classification Numbers: C70, C72.     

On the convergence of reinforcement learning

This paper examines the convergence of payoffs and strategies in Erev and Roth's model of reinforcement learning. When all players use this rule it eliminates iteratively dominated strategies and in two-person constant-sum games average payoffs converge to the value of the game. Strategies converge in constant-sum games with unique equilibria if they are pure or if they are mixed and the game is 2×2. The long-run behaviour of the learning rule is governed by equations related to Maynard Smith's version of the replicator dynamic. Properties of the learning rule against general opponents are also studied.     

Repeated games with one-memory

We study the extent to which equilibrium payoffs of discounted repeated games can be obtained by 1-memory strategies. We establish the following in games with perfect (rich) action spaces: First, when the players are sufficiently patient, the subgame perfect Folk Theorem holds with 1-memory. Second, for arbitrary level of discounting, all strictly enforceable subgame perfect equilibrium payoffs can be approximately supported with 1-memory if the number of players exceeds two. Furthermore, in this case all subgame perfect equilibrium payoffs can be approximately supported by an ε-equilibrium with 1-memory. In two-player games, the same set of results hold if an additional restriction is assumed: Players must have common punishments. Finally, to illustrate the role of our assumptions, we present robust examples of games in which there is a subgame perfect equilibrium payoff profile that cannot be obtained with 1-memory. Thus, our results are the best that can be hoped for.     

Unmediated communication in games with complete and incomplete information

We study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^U(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an extensive-form game in which players communicate before playing G. A reliable mediator is not available and players exchange private or public messages that do not affect directly their payoffs. We first show that if G is a game of complete information with five or more players and rational parameters, then S^U(G) coincides with the set of correlated equilibria of G. Next, we demonstrate that if G is a game of incomplete information with at least five players, rational parameters and full support (i.e., all profiles of types have positive probability), then S^U(G) is equal to the set of communication equilibria of G.     

Infinite Histories and Steady Orbits in Repeated Games

We study a model of repeated games with the following features: (a) Infinite histories. The game has been played since days of yore, or is so perceived by the players: (b) Turing machines with memory. Since regular Turing machines coincide with bounded recall strategies (in the presence of infinite histories), we endow them with "external" memory; (c) Nonstrategic players. The players ignore complicated strategic considerations and speculations about them. Instead, each player uses his/her machine to update some statistics regarding the others′ behaviour, and chooses a best response to observed behaviour. Relying on these assumptions, we define a solution concept for the one shot game, called steady orbit. The (closure of the) set of steady orbit payoffs strictly includes the convex hull of the Nash equilibria payoffs and is strictly included in the correlated equilibria payoffs. Assumptions (a)–(c) above are independent to a large extent. In particular, one may define steady orbits without explicitly dealing with histories or machines.     

Partial identification in binary response models with nonignorable nonresponses

This study investigates the identification of parameters in semiparametric binary response models of the form y=1(x^′β+v+ε>0)$y=1(x^{\prime }\beta +v+\epsilon >0)$ when there are nonignorable nonresponses. We propose an estimation procedure for the identified set, the set of parameters that are observationally indistinguishable from the true value β$\beta$, based on the special regressor approach of Lewbel (2000). We show that the estimator for the identified set is consistent in the Hausdorff metric.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

The Debreu private ownership economy with complementary commodities and prices

Let E_p be a Debreu private ownership economy in which there are some complementary commodities. It means that all commodity bundles are contained in the proper subspace V   of commodity–space [R]l(l∈{1,2,…})${\mathfrak{[R]}}^l\left(l\in \left\{1,2,\dots \right\}\right)$. The production plans maximizing the producers' profits do not have to satisfy the dependency in the qualities of commodities seen in the consumers' plans. It may cause no-existence an equilibrium in economy E_p. The competitive leads, however, to adjustment the production plans to improve the consumers' satisfaction. The procedure of change the production system covering the consumers' requirements is presented. As a result, the model of the private ownership economy with complementary commodities and prices, being the simplification of the initial model, is elaborated. Consequently, the necessary condition for the existence of an equilibrium in the economy E_p is proved.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

Excess payoff dynamics and other well-behaved evolutionary dynamics

We consider a model of evolution in games in which agents occasionally receive opportunities to switch strategies, choosing between them using a probabilistic rule. Both the rate at which revision opportunities arrive and the probabilities with which each strategy is chosen are functions of current normalized payoffs. We call the aggregate dynamics induced by this model excess payoff dynamics. We show that every excess payoff dynamic is well-behaved: regardless of the underlying game, each excess payoff dynamic admits unique solution trajectories that vary continuously with the initial state, identifies rest points with Nash equilibria, and respects a basic payoff monotonicity property. We show how excess payoff dynamics can be used to construct well-behaved modifications of imitative dynamics, and relate them to two other well-behaved dynamics based on projections.     

Evolutionary selection of ‘chivalrous’ conventions in coordination games without common expectations

We study an evolutionary game-theoretic model where players have to choose within a predetermined set of mixed strategies in a coordination game. Players are of two different kinds, male and female. No common expectations assumption is made; players tend therefore to adopt the strategy that yields larger than average expected payoffs for their kind. In this framework, every stable stationary point of the population dynamics can be interpreted as the emergence of a particular convention. A classification of the possible conventions is provided; conditions for their emergence are determined.     

Better-reply dynamics and global convergence to Nash equilibrium in aggregative games

We consider n-person games with quasi-concave payoffs that depend on a player's own action and the sum of all players' actions. We show that a discrete-time, stochastic process in which players move towards better replies—the better-reply dynamics—converges globally to a Nash equilibrium if actions are either strategic substitutes or strategic complements for all players around each Nash equilibrium that is asymptotically stable under a deterministic, adjusted best-reply dynamics. We present an example of a 2-person game with a unique equilibrium where the derivatives of the best-reply functions have different signs and the better-reply dynamics does not converge.