Endogenous price leadership

We consider a linear price setting duopoly game with differentiated products and determine endogenously which of the players will lead and which one will follow. While the follower role is most attractive for each firm, we show that waiting is more risky for the low cost firm so that, consequently, risk dominance considerations, as in Harsanyi and Selten (A General Theory of Equilibrium Selection in Games, MIT Press, Cambridge, MA, 1988), allow the conclusion that only the high cost firm will choose to wait. Hence, the low cost firm will emerge as the endogenous price leader.     

Local coordination and market equilibria

We reformulate the local stability analysis of market equilibria in a competitive market as a local coordination problem in a market game, where the map associating market prices to best-responses of all traders is common knowledge and well-defined both in and out of equilibrium. Initial expectations over market variables differ from their equilibrium values and are not common knowledge. This results in a coordination problem as traders use the structure of the market game to converge back to equilibrium. We analyse a simultaneous move and a sequential move version of the market game and explore the link with local rationalizability.     

Variational convergence: Approximation and existence of equilibria in discontinuous games

We introduce a notion of variational convergence for sequences of games and we show that the Nash equilibrium map is upper semi-continuous with respect to variationally converging sequences. We then show that for a game G with discontinuous payoff, some of the most important existence results of Dasgupta and Maskin, Simon, and Reny are based on constructing approximating sequences of games that variationally converge to G. In fact, this notion of convergence will help simplify these results and make their proofs more transparent. Finally, we use our notion of convergence to establish the existence of a Nash equilibrium for Bertrand-Edgeworth games with very general forms of tie-breaking and residual demand rules.     

Trading with a common agent under complete information: A characterization of Nash equilibria

We analyze an abstract model of trading where N principals submit quantity-payment schedules that describe the contracts they offer to an agent, and the agent then chooses how much to trade with every principal. This represents a special class of common agency games with complete information. We study all the subgame perfect Nash equilibria of these games, not only truthful ones, providing a complete characterization of equilibrium payoffs. In particular, we show that the equilibrium that is Pareto-dominant for the principals is not truthful when there are more than two of them. We also provide a partial characterization of equilibrium strategies.     

Paradoxical price effects on insurance markets

In this paper we analyze a paradox phenomenon in certain insurance markets of some countries: in spite of there being strong competition, increasing prices can be found in some submarkets. As a reason for this, we need to note the special distribution of insurance products, a distribution primarily based on intermediaries — and, as a result, there is an increasing part for ‘intermediation’ costs within insurance products' cost structure due to competition for the intermediaries. We build an oligopolistic model assuming that the market is saturated, which is able to explain the overemployment of intermediaries and the high commissions involved. We analyze possible interventions and laws/regulations and suggest that the problem can be solved only with major regulation. Finally, we have come up with an empirical analysis to test the model.     

Star-shapedness of Richter-Aumann integral on a measure space with atoms: theory and economic applications

This paper provides sufficient (as well as necessary) conditions for the integral of a correspondence defined on a measure space with atoms to exhibit star-shaped values. This result is used to analyze the existence of a Nash equilibrium in games with a measure space of agents with atoms and of a competitive equilibrium in economies with mixed markets. In either case it is shown that an exact equilibrium exists whenever atoms are “small enough”.     

Supply function equilibria: Step functions and continuous representations

In most electricity markets generators must submit step-function offers to a uniform price auction. These markets are often modelled as simpler pure-strategy Supply Function Equilibria (SFE) with continuous supply functions. Critics argue that the discreteness and discontinuity of the required steps drastically change Nash equilibria, invalidating predictions of the SFE model. We prove that there are sufficient conditions, offered quantities can be continuously varied, offered prices are selected from a finite set, and the density of the additive demand shock is not too steep, where the resulting stepped SFE converges to the continuous SFE as the number of steps increases, reconciling the apparently very disparate approaches to modelling electricity markets.     

Coalition-proof supply function equilibria in oligopoly

In an industry where firms compete via supply functions, the set of equilibrium outcomes is large. If decreasing supply functions are ruled out, this set is reduced significantly, but remains large. Specifically, the set of prices that can be sustained by supply function equilibria is the interval between the competitive price and the Cournot price. In sharp contrast, when the number of firms is above a threshold we identify (e.g., three if demand is linear), only the Cournot outcome can be sustained by a coalition-proof supply function equilibrium.     

Multiple equilibria in Tullock contests

We find the sufficient conditions for the existence of multiple equilibria in Tullock-type contests, and show that asymmetric equilibria arise even under symmetric prize and cost structures. We then present existing contests where multiple equilibria exist under reasonably weak conditions.     

All equilibria of the Vickrey auction

This paper characterizes the set of Nash equilibria in the second-price sealed-bid auction with independent private values and three or more bidders. In addition, we show that any effective reserve price implies uniqueness.     

Generalized potentials and robust sets of equilibria

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibrium in the set. This paper provides sufficient conditions for the robustness of sets of equilibria in terms of argmax sets of generalized potential functions. These sufficient conditions unify and generalize existing sufficient conditions. Our generalization of potential games is useful in other game theoretic problems where potential methods have been applied.     

Iterated potential and robustness of equilibria

For any given set-valued solution concept, it is possible to consider iterative elimination of actions outside the solution set. This paper applies such a procedure to define the concept of iterated monotone potential maximizer (iterated MP-maximizer). It is shown that under some monotonicity conditions, an iterated MP-maximizer is robust to incomplete information [A. Kajii, S. Morris, The robustness of equilibria to incomplete information, Econometrica 65 (1997) 1283-1309] and absorbing and globally accessible under perfect foresight dynamics for a small friction [A. Matsui, K. Matsuyama, An approach to equilibrium selection, J. Econ. Theory 65 (1995) 415-434]. Several simple sufficient conditions under which a game has an iterated MP-maximizer are also provided.     

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.     

Robustness of equilibria in anonymous local games

This paper studies the robustness of symmetric equilibria in anonymous local games to perturbations of prior beliefs. Two priors are strategically close on a class of games if players receive similar expected payoffs in equilibrium under the priors, for any game in that class. I show that if the structure of payoff interdependencies is sparse in a well-defined sense, the conditions for strategic proximity in anonymous local games are strictly weaker than the conditions for general Bayesian games of Kajii and Morris (1998) [11] when attention is restricted to symmetric equilibria. Hence, by exploiting the properties of anonymous local games, it is possible to obtain stronger robustness results for this class.     

Learning in games with unstable equilibria

We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning. We show that, when players learn using weighted stochastic fictitious play and so place greater weight on recent experience, the time average of play often converges in these “unstable” games, even while mixed strategies and beliefs continue to cycle. This time average, the TASP, is related to the cycle identified by Shapley [L.S. Shapley, Some topics in two person games, in: M. Dresher, et al. (Eds.), Advances in Game Theory, Princeton University Press, Princeton, 1964]. The TASP can be close to or quite distinct from Nash equilibrium.     

Asymmetric first price auctions

A new approach to asymmetric first price auctions is proposed which circumvents the need to examine bidding strategies directly. Specifically, the ratio of bidders' (endogenous) payoffs is analyzed and compared to the ratio of the (exogenous) distribution functions that describe beliefs. Most of the results are inferred from this comparison. In the existing theoretical literature, assumptions of first order stochastic dominance or stronger imply that the latter ratio has very specific properties, but no such assumptions are imposed here. It is proven that first order stochastic dominance is necessary for bidding strategies not to cross. When this assumption is relaxed in the numerical literature it is done in a manner that leads to exactly one crossing. However, it is straightforward to construct examples with several crossings. Finally, bid distributions will cross in auctions with two bidders whenever second order (but not first order) stochastic dominance applies.     

Quasi-option value under strategic interactions

We consider a simple two-period model of irreversible investment under strategic interactions between two players. In this setup, we show that the quasi-option value may cause some conceptual difficulties. In case of asymmetric information, decentralized investment decisions fail to induce first-best allocations. Therefore a regulator may not be able to exercise the option to delay the decision to develop. We also show that information-induced inefficiency may arise in a game situation and that under certain assumptions inefficiency can be eliminated by sending asymmetric information to the players, even when the regulator faces informational constraints. Our model is potentially applicable to various global environmental problems.     

The dynamic instability of dispersed price equilibria

We adopt an evolutionary framework to explain price dispersion as a time varying phenomenon. By developing a finite strategy analogue of the Burdett and Judd (1983) price dispersion model, we show that all dispersed price equilibria are unstable under the class of perturbed best response dynamics. Instead, numerical simulations using the logit dynamic show that price dispersion manifests itself as a limit cycle. We verify that limit cycles persist even when the finite strategy model approaches the original continuous strategy model. For a particularly simple case of the model, we prove the existence of a limit cycle.     

The Cournot-Bertrand model and the degree of product differentiation

We consider a duopoly model with a Cournot-type firm and a Bertrand-type firm. Both survive and the equilibrium is stable when there is sufficient product differentiation. With no differentiation, only the Cournot-type firm survives, and the outcome is perfectly competitive.     

Afriat's theorem for general budget sets

Afriat proved the equivalence of a variant of the strong axiom of revealed preference and the existence of a solution to a set of linear inequalities. From this solution he constructed a utility function rationalizing the choices of a competitive consumer. We extend Afriat's theorem to a class of nonlinear, nonconvex budget sets. We thereby obtain testable implications of rational behavior for a wide class of economic environments, and a constructive method to derive individual preferences from observed choices. We also show that by increasing in a regular way the number of observed choices from our class of budget sets one can fully identify the underlying preference relation.