The behavior of the exchange rate in the genetic algorithm with agents having long memory

This paper studies the behavior of the exchange rate in Kareken and Wallace (1981)'s model under the genetic algorithm adaptation with agents having long memory. The simulation results show that, if agents have full memory, the average portfolio fraction will converge, and the initial equilibrium that it converges to is history dependent. Under the lasting evolutionary pressure of the noise trader, the market will eventually drift from one equilibrium to another, and asymptotically will converge to the neighborhood of an equilibrium with agents putting their savings equally into two currencies. If the agents do not have full memory, the foreign exchange market will show periodic crisis. Before and after a market crises, the average portfolio fraction will converge to different stationary equilibria. A mean difference equation of the average portfolio fraction is also given to describe the dynamics of the model.

Evolutionary Stability in the Investment-Opportunism-Retaliation Game

Can economically efficient outcomes be obtained and sustained in the absence of externally enforced property rights? We study the evolutionary properties of a game that exhibits two well-defined Nash equilibria: one generates an inefficient outcome while the other set generates an efficient outcome supported by the potential for retaliation. Although standard forward-looking refinements eliminate the efficient equilibrium, neither equilibrium type satisfies strict evolutionary stability criteria. However, both types of equilibrium define strategies that are neutrally stable, which makes them vulnerable to drift in dynamic environments. We conduct computer simulation experiments in which players learn adaptively via a tournament selection mechanism called sophisticated experimentation. Our simulations demonstrate that while the system spends a disproportionately high proportion of time in the inefficient equilibrium set, the efficient equilibrium is pervasive as the system drifts back and forth between the equilibrium sets, never settling on one or the other.     

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 ‘matches’ the probability of playing a pure strategy to the probability that this pure strategy is a best reply to the pure-strategy profile played by his opponents. We derive stability results for the steady states of the continuous time limit in 2×2 bimatrix games and coordination games. Analyzing the asymptotic behavior of the stochastic adjustment process in discrete time shows convergence to minimal curb sets of the game. Moreover, absorbing states of the process correspond to best-reply matching equilibria of the game.     

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.     

Higher order game dynamics

Continuous-time game dynamics are typically first order systems where payoffs determine the growth rate of the players? strategy shares. In this paper, we investigate what happens beyond first order by viewing payoffs as higher order forces of change, specifying e.g. the acceleration of the players? evolution instead of its velocity (a viewpoint which emerges naturally when it comes to aggregating empirical data of past instances of play). To that end, we derive a wide class of higher order game dynamics, generalizing first order imitative dynamics, and, in particular, the replicator dynamics. We show that strictly dominated strategies become extinct in n-th order payoff-monotonic dynamics n   orders as fast as in the corresponding first order dynamics; furthermore, in stark contrast to first order, weakly dominated strategies also become extinct for n?2$n?2$. All in all, higher order payoff-monotonic dynamics lead to the elimination of weakly dominated strategies, followed by the iterated deletion of strictly dominated strategies, thus providing a dynamic justification of the well-known epistemic rationalizability process of Dekel and Fudenberg [7]. Finally, we also establish a higher order analogue of the folk theorem of evolutionary game theory, and we show that convergence to strict equilibria in n-th order dynamics is n orders as fast as in first order.     

Equilibrium existence and approximation of regular discontinuous games

Many conditions have been introduced to ensure equilibrium existence in games with discontinuous payoff functions. This paper introduces a new condition, called regularity, that is simple and easy to verify. Regularity requires that if there is a sequence of strategies converging to s* such that the players’ payoffs along the sequence converge to the best-reply payoffs at s*, then s* is an equilibrium. We show that regularity is implied both by Reny’s better-reply security and Simon and Zame’s endogenous sharing rule approach. This allows us to explore a link between these two distinct methods. Although regularity implies that the limits of e{\epsilon}-equilibria are equilibria, it is in general too weak for implying equilibrium existence. However, we are able to identify extra conditions that, together with regularity, are sufficient for equilibrium existence. In particular, we show how regularity allows the technique of approximating games both by payoff functions and space of strategies.     

Economic natural selection in Bertrand and Cournot settings

We study economic natural selection in classical oligopoly settings. When underlying pure strategies consist of a finite number of prices, convex monotonic dynamics always converge under a weak condition to the smallest price in the support of the initial state that exceeds marginal cost. When underlying pure strategies consist of a finite number of quantities, monotonic dynamics always converge under a specific condition to a quantity equal or similar to classical Cournot equilibrium.     

Evolutionary Learning in Signalling Games

We study equilibrium selection by evolutionary learning in monotone two-type signalling games. The learning process we study extends that introduced by Young (1993, Econometrica61, 57–84) to deal with incomplete information and sequential moves; it thus involves stochastic trembles. For vanishing trembles the process gives rise to strong selection among sequential equilibria: if the game has separating equilibria, then in the long run only play according to the so-called Riley equilibrium will be observed frequently. Journal of Economic Literature Classification Number: C72.     

The power of ESS: An experimental study

Abstract. Our experimental design mimics a traditional evolutionary game framework where players are matched pairwise to play a symmetric 33 bimatrix game that has two Nash equilibria. One equilibrium is an evolutionary stable state, or ESS; the other is an equilibrium in dominated strategies. Our primary experimental result is the observation that the ESS becomes extremely attractive when subjects have minimal information about the payoff functions, although the dominated equilibrium assures the highest equilibrium payoff. The attractiveness of the ESS is only moderate when players are completely informed about the 33 payoff matrix. Correspondence to: S.K. Berninghaus     

Symmetric Separating Equilibria in English Auctions

We characterize the set of perfect Bayesian equilibria in symmetric separating strategies in the model of English auctions given by P. R. Milgrom and R. J. Weber (1982, Econometrica50, 1089–1122). There is a continuum of such equilibria. The equilibrium derived by Milgrom and Weber is that in which bids are maximal. Only in the case of pure private values does a restriction to weakly undominated strategies select a unique equilibrium. This has important implications for empirical studies of English auctions, particularly outside the pure private values paradigm. Journal of Economic Literature Classification Numbers: D44, D82.     

Aggregative games and best-reply potentials

This paper introduces quasi-aggregative games and establishes conditions under which such games admit a best-reply potential. This implies existence of a pure strategy Nash equilibrium without any convexity or quasi-concavity assumptions. It also implies convergence of best-reply dynamics under some additional assumptions. Most of the existing literature’s aggregation concepts are special cases of quasi-aggregative games, and many new situations are allowed for. An example is payoff functions that depend on own strategies as well as a linear combination of the mean and the variance of players’ strategies.     

Evolutionary Stability of Pure-Strategy Equilibria in Finite Games

Sufficient conditions for pure-strategy Nash equilibria of finite games to be (Lyapunov) stable under a large class of evolutionary dynamics, the regular monotonic selection dynamics, are discussed. In particular, it is shown that in almost all finite extensive-form games, all the pure-strategy equilibria are stable. In such games, all mixed-strategy equilibria close to pure-strategy equilibria are also stable.Journal of Economic LiteratureClassification Numbers: C70, C72.     

Evolution with Delay

This paper analyses evolutionary models with delays in players’ observations. I apply best response dynamics to symmetric 2 × 2 games, in particular the coordination game and the game with no symmetric pure strategy equilibrium. When the dynamics have no delay, their solutions converge to symmetric Nash equilibria monotonically. However when I introduce delays to the dynamics, although these dynamics represented by differential difference equations are seemingly simple, it shows that they have periodic solutions. JEL Classification Number: C79.     

Splitting the baby in two: solving Solomon's dilemma with boundedly rational agents

We study the dynamic implementation of the first-best forKing Solomon's Dilemma, on the assumption that boundedly rational players find their way to equilibrium using monotonic evolutionary dynamics. We find that all the mechanisms proposed by the literature fail to implement the first best dynamically and provide an alternative solution.     

Debt Neutrality and the Infinite–Lived Representative Consumer

In this paper, we study the intertemporal equilibria of an infinite–lived representative agent model with public debt. We show that for a given path of government expenditures, there generally exists a continuum of equilibria depending on various debt policies. These equilibria are characterized by different paths of consumption and leisure. Two examples illustrate the results: in the first one consumption and leisure may converge to zero, in the second one consumption goes to infinity while leisure goes to its maximum value. In a third example with externalities à la Romer, the standard intertemporal equilibrium with zero public debt may be dominated by other intertemporal equilibria.     

Capital as a commitment: Strategic investment to deter mobility

This paper analyzes how an early entrant in a market can exploit its head start by strategic investment. The analysis is based on Spence's paper, Investment strategy and growth in a new market, (Bell J. Econ., 10 (1979), 1–19). We frist study the investment game in the no-discounting case, which embodies the key features of mobility deterrence. We establish the existence of a set of perfect equilibria and suggest that one particular equilibrium is most reasonable. This equilibrium, also valid with discounting, involves the follower firm being forever deterred from investing to its steady-state reaction curve, in contrast to Spence's proposed solution.     

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.     

Coordination in Oligopoly

The private and social efficiency of two "behavioral" coordination mechanisms is examined in this paper. In Cournot oligopoly, firms prefer immediate coordination on the Nash equilibrium (interpreted as a preplay communication) over the best-reply dynamics (and fictitous play) which converge to the equilibrium, but with delay (interpreted as a decentralized learning process). In Bertrand oligopoly, firms prefer the learning process. These results indicate that firms have incentives to create institutions, such as trade associations or informal meetings, to facilitate coordination of production capacities, but not prices. Moreover, quantity agreements may even increase social welfare.     

On the existence of equilibria in economies with infinitely many commodities and without ordered preferences

The present paper deals with the existence of equilibria in economies whose commodity space is L_∞(M, M, μ) and where the agents' preferences need not be complete or transitive. Applying a fixed point theorem of Browder, an equilibrium existence theorem for abstract economies (generalized qualitative games) is proven where each agent's choice set is contained in an arbitrary topological vector space. With the help of this theorem the existence of Walrasian general equilibrium for a suitably specified economic model is obtained. The final result is a generalization of T. F. Bewley's (J. Econ. Theory4 (1972), 514–540) equilibrium existence theorem to the case of non-ordered preferences.     

Existence of equilibria in countable games: An algebraic approach

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Waldʼs pick-the-larger-integer game. Several authors have provided conditions for the existence of equilibria in infinite games. These conditions are typically of topological nature and are rarely applicable to countable games. Here we establish an existence result for the equilibrium of countable games when the strategy sets are a countable group, the payoffs are functions of the group operation, and mixed strategies are not requested to be σ-additive. As a byproduct we show that if finitely additive mixed strategies are allowed, then Waldʼs game admits an equilibrium. Finally we extend the main results to uncountable games.