Properties and applications of dual reduction

The dual reduction process, introduced by Myerson, allows a finite game to be reduced to a smaller-dimensional game such that any correlated equilibrium of the reduced game is an equilibrium of the original game. We study the properties and applications of this process. It is shown that generic two-player normal form games have a unique full dual reduction (a known refinement of dual reduction) and all strategies that have probability zero in all correlated equilibria are eliminated in all full dual reductions. Among other applications, we give a linear programming proof of the fact that a unique correlated equilibrium is a Nash equilibrium, and improve on a result due to Nau, Gomez-Canovas and Hansen on the geometry of Nash equilibria and correlated equilibria.     

Costly Search, Capacity Constraints, and Bertrand Equilibrium Price Dispersion

This article analyzes the impact of transaction (search) costs and capacity constraints in an almost competitive market with homogeneous firms that compete on price. We characterize conditions under which Nash equilibria with price dispersion exist; in equilibrium, firms play pure strategies in prices and consumers adopt a symmetric mixed search strategy. Price dispersion is possible even though consumers all have the same search cost and valuation for the item and prices charged by all firms are common knowledge.     

Codetermination,Price Competition and the Network Industry

This research develops a tractable two‐stage non‐cooperative game with complete information describing the behaviour of price‐setting firms that must choose to be profit maximisers or bargainers under codetermination in a network industry with horizontal product differentiation. The existing theoretical literature has already shown that codetermination might arise as the endogenous market outcome in a strategic competitive quantity‐setting duopoly. In sharp contrast with this result, the present article shows that codetermination does never emerge as a Nash equilibrium in a price‐setting non‐network duopoly. Then, it aims at highlighting the role of network externalities in determining changes of paradigm of the game and letting codetermination become a sub‐game perfect Nash equilibrium when prices are strategic substitutes or strategic complements. This equilibrium may be Pareto efficient. Results allow distinguishing between mandatory codetermination and voluntary codetermination. The article also proposes a model of endogenous codetermination according to which every firm may choose to bargain with its own corresponding union bargaining unit only whether the firm's bargaining strength is exactly the profit‐maximising one. The equilibrium outcomes emerging in this case range from a uniform Nash equilibrium, in which both firms are codetermined, to mixed Nash equilibria, in which only one of them chooses to be codetermined. These results are ‘network depending’ and do not hold in a non‐network duopoly.     

QUANTITY VERSUS PRICE IN A HOMOGENEOUS PRODUCT DUOPOLY*

In a simple homogeneous product setting, the paper looks at the debate on whether firms should choose quantity or price as their strategic variable. It examines a two-stage game between firms with symmetric costs in which the firms choose the strategic mode of operation in the first period and then, in the second period, price or output are chosen simultaneously according to the mode chosen in the first stage. In this game it is possible to have two Nash equilibria where either both play in quantities or both play in prices. One firm choosing price and the other quantity can never be a Nash equilibrium in the two-stage game. Both choosing quantity is always a Nash equilibrium. Both choosing prices may be a Nash equilibrium only in some situations: the structure of the cost functions decides this issue.     

The supercore for normal-form games

This paper analyzes the supercore of a system derived from a normal-form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore coincides with the set of Nash equilibria of the last game in that sequence. This result is illustrated with the characterization of the supercore for the n-person prisoner's dilemma. With regard to the mixed extension of a normal-form game, we show that the set of Nash equilibrium profiles coincides with the supercore for games with a finite number of Nash equilibria.     

Learning to alternate

The Individual Evolutionary Learning (IEL) model explains human subjects’ behavior in a wide range of repeated games which have unique Nash equilibria. Using a variation of ‘better response’ strategies, IEL agents quickly learn to play Nash equilibrium strategies and their dynamic behavior is like that of humans subjects. In this paper we study whether IEL can also explain behavior in games with gains from coordination. We focus on the simplest such game: the 2 person repeated Battle of Sexes game. In laboratory experiments, two patterns of behavior often emerge: players either converge rapidly to one of the stage game Nash equilibria and stay there or learn to coordinate their actions and alternate between the two Nash equilibria every other round. We show that IEL explains this behavior if the human subjects are truly in the dark and do not know or believe they know their opponent’s payoffs. To explain the behavior when agents are not in the dark, we need to modify the basic IEL model and allow some agents to begin with a good idea about how to play. We show that if the proportion of inspired agents with good ideas is chosen judiciously, the behavior of IEL agents looks remarkably similar to that of human subjects in laboratory experiments.     

Adaptation and complexity in repeated games

The paper presents a learning model for two-player infinitely repeated games. In an inference step players construct minimally complex inferences of strategies based on observed play, and in an adaptation step players choose minimally complex best responses to an inference. When players randomly select an inference from a probability distribution with full support the set of steady states is a subset of the set of Nash equilibria in which only stage game Nash equilibria are played. When players make ‘cautious’ inferences the set of steady states is the subset of self-confirming equilibria with Nash outcome paths. When players use different inference rules, the set of steady states can lie between the previous two cases.     

Tariffs vs Quotas in a Model of Trade with Capital Accumulation*

This paper examines the equivalence among price‐modifying and quantity‐fixing international trade policies in a differential game. We employ two well‐known capital accumulation dynamics for firms, due to Nerlove and Arrow and to Ramsey, respectively. We show that, in both cases, open‐loop and closed‐loop Nash equilibria coincide. Under the former accumulation the tariff‐quota equivalence holds, while, in general, it does not under the latter. Moreover, in the Ramsey model, the country setting the trade policy (weakly) prefers a quantity‐equivalent import quota to the adoption of the tariff. These results are not a consequence of the equilibrium concept we adopt (with and without market power), but directly follow from the interplay between market power and the properties of accumulation dynamics.     

On Nash implementation of Walrasian equilibria in a market for pure indivisibles without money

This paper deals with the Walrasian property of Nash and strong equilibria of a specific strategic market game which refers to a pure exchange economy involving purely indivisible commodities and no money. The game is of sealed-bid auction type and it is shown that any Nash equilibrium at which no agent is in status quo is a strong equilibrium and implements a Walrasian equilibrium. Moreover, it appears that two modifications of the game's rules ensure that any strong equilibrium outcome is Walrasian. These results are identical to those obtained by Svensson for markets involving purely indivisible goods and money.     

Collusive equilibria in oligopolies with finite lives

It is generally accepted that collusive agreements cannot be sustained in oligopolies with finite lives. In this paper it is shown that, provided the number of competitors is neither too small nor too large, the most restrictive output, i.e., the monopoly output, can be sustained as a perfect Nash equilibrium. If the number of firms is too small only sequences of the Nash equilibria of the constituent market game can appear as perfect Nash equilibria. If the number of firms is too large the power of the cartel falls sharply.     

On the existence of pure strategy Nash equilibria in two person discrete games

We construct a generalized two-person discrete strategy static game of complete information where continuity, convexity and compactness cannot be invoked to show the existence of pure strategy Nash equilibrium. We show that, when best responses are unique from both sides, a condition of Minimal Acyclicity is necessary and sufficient for the existence of pure strategy Nash equilibria.     

CHOOSING ROLES IN A DUOPOLY FOR ENDOGENOUSLY DIFFERENTIATED PRODUCTS*

The choice of the roles by firms in a vertically differenitated duopoly is analysed introducing a preplay stage where firms set the timing of moves, under the alternative assumptions of full or non full market coverage. Under the first, it turns out that the unique subgame perfect equilibrium entails simultaneous play in the quality stage, followed by sequential play in the price stage, where both firms would prefer to be price leader, contrarily to the results obtained by previous literature. Under partial market coverage, it is possible to analyse both price and quantity competition. In such a case, simultaneous play in both stages emerges as the optimal behaviour. Overall, contrarily to the conclusions reached by the previous literature, it is not possible to claim that the choice of the strategy space dominates the distribution of roles.     

Bertrand price competition with differentiated commodities

This develops a general equilibrium, differentiated commodity version of Bertrand price competition. We study two, related market games in which buyers as well as sellers announce both quantities and prices. In the first game, buyers' strategies are artificially restricted. The Nash allocations of this game will be nearly competitive, provided that the commodities supplied by sellers are sufficiently similar. In the second game, the restriction on buyers' strategies is relaxed and a stronger solution criterion, called local perfection, is invoked. The locally perfect equilibria of the unrestricted game coincide the Nash equilibria of the restricted game.     

Learning to Learn, Pattern Recognition, and Nash Equilibrium

The paper studies a large class of bounded-rationality, probabilistic learning models on strategic-form games. The main assumption is that players “recognize” cyclic patterns in the observed history of play. The main result is convergence with probability one to a fixed pattern of pure strategy Nash equilibria, in a large class of “simple games” in which the pure equilibria are nicely spread along the lattice of the game. We also prove that a necessary condition for convergence of behavior to a mixed strategy Nash equilibrium is that the players consider arbitrarily long histories when forming their predictions.Journal of Economic LiteratureClassification Numbers: C72, D83.     

Equilibrium play in matches: Binary Markov games

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of the match for the players, at each point, to play a Nash equilibrium of the point game; (b) it is a minimax behavior strategy in the match for a player to play minimax in each point game; and (c) when the point games all have unique Nash equilibria, the only Nash equilibrium of the binary Markov game consists of minimax play at each point. An application to tennis is provided.     

Stochastic uncoupled dynamics and Nash equilibrium

In this paper we consider dynamic processes, in repeated games, that are subject to the natural informational restriction of uncoupledness. We study the almost sure convergence of play (the period-by-period behavior as well as the long-run frequency) to Nash equilibria of the one-shot stage game, and present a number of possibility and impossibility results. Basically, we show that if in addition to random experimentation some recall, or memory, is introduced, then successful search procedures that are uncoupled can be devised. In particular, to get almost sure convergence to pure Nash equilibria when these exist, it suffices to recall the last two periods of play.     

Stochastic uncoupled dynamics and Nash equilibrium

In this paper we consider dynamic processes, in repeated games, that are subject to the natural informational restriction of uncoupledness. We study the almost sure convergence of play (the period-by-period behavior as well as the long-run frequency) to Nash equilibria of the one-shot stage game, and present a number of possibility and impossibility results. Basically, we show that if in addition to random experimentation some recall, or memory, is introduced, then successful search procedures that are uncoupled can be devised. In particular, to get almost sure convergence to pure Nash equilibria when these exist, it suffices to recall the last two periods of play.     

On the Relationship between Risk-Dominance and Stochastic Stability

In a 2 × 2 symmetric game with two symmetric equilibria, one risk-dominates another if and only if the equilibrium strategy is a unique best response to any mixture that gives itself at least a probability of one-half. In a two-person strategic form game, we call a Nash equilibriumglobally risk-dominantif it consists of strategies such that each one of them is a unique best response to any mixture that gives the other at least a probability of one-half. We show that if a weakly acyclic two-person game has a globally risk-dominant equilibrium, then this is the one that is selected by the stochastic equilibrium selection process of Young.Journal of Economic LiteratureClassification Numbers: C72, C73.     

On the Irrelevance of Risk Attitudes in Repeated Two-Outcome Games

We study equilibrium and maximin play in supergames consisting of the sequential play of a finite collection of stage games, where each stage game has two outcomes for each player. We show that for two-player supergames in which each stage game is strictly competitive, in any Nash equilibrium of the supergame, play at each stage is a Nash equilibrium of the stage game provided preferences over certain supergame outcomes satisfy a natural monotonicity condition. In particular, equilibrium play does not depend on risk attitudes. We establish an invariance result for games with more than two players when the solution concept is subgame perfection. Journal of Economic Literature Classification Numbers: C72, C9.     

Competitive behavior in market games: Evidence and theory

We explore whether competitive outcomes arise in an experimental implementation of a market game, introduced by Shubik (1973) [21]. Market games obtain Pareto inferior (strict) Nash equilibria, in which some or possibly all markets are closed. We find that subjects do not coordinate on autarkic Nash equilibria, but favor more efficient Nash equilibria in which all markets are open. As the number of subjects participating in the market game increases, the Nash equilibrium they achieve approximates the associated competitive equilibrium of the underlying economy. Motivated by these findings, we provide a theoretical argument for why evolutionary forces can lead to competitive outcomes in market games.