Catalog competition and Nash equilibrium in nonlinear pricing games

We model strategic competition in a market with asymmetric information as a noncooperative game in which each seller competes for a buyer of unknown type by offering the buyer a catalog of products and prices. We call this game a catalog game. Our main objective is to show that catalog games have Nash equilibria. The Nash existence problem for catalog games is particularly contentious due to payoff discontinuities caused by tie-breaking. We make three contributions. First, we establish under very mild conditions on primitives that no matter what the tie-breaking rule, catalog games are uniformly payoff secure, and therefore have mixed extensions which are payoff secure. Second, we show that if the tie-breaking rule awards the sale to firms which value it most (i.e., breaks ties in favor of firms which stand to make the highest profit), then firm profits are reciprocally upper semicontinuous (i.e., the mixed catalog game is reciprocally upper semincontinuous). This in turn implies that the mixed catalog game satisfies Reny’s condition of better-reply security—a condition sufficient for existence (Reny in Econometrica 67:1029–1056, 1999). Third, we show by example that if the tie-breaking rule does not award the sale to firms which value it most (for example, if ties are broken randomly with equal probability), then the catalog game has no Nash equilibrium. This paper was written while the second author was Visiting Professor, Centre d’Economie de la Sorbonne, Universite Paris 1, Pantheon-Sorbonne. The second author thanks CES and Paris 1, and in particular, Bernard Cornet and Cuong Le Van for their support and hospitality. The second author also thanks the C&BA and EFLS at the University of Alabama for financial support. Both authors are grateful to Monique Florenzano and to participants in the April 2006 Paris 1 NSF/NBER Decentralization Conference for many helpful comments on an earlier version of the paper. Finally, both authors are especially grateful to an anonymous referee whose thoughtful comments led to substantial improvements in the paper. Monteiro acknowleges the financial support of Capes-Cofecub 468/04.     

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.     

Conditional Universal Consistency

Players choose an action before learning an outcome chosen according to an unknown and history-dependent stochastic rule. Procedures that categorize outcomes, and use a randomized variation on fictitious play within each category are studied. These procedures are “conditionally consistent:” they yield almost as high a time-average payoff as if the player knew the conditional distributions of actions given categories. Moreover, given any alternative procedure, there is a conditionally consistent procedure whose performance is no more than epsilon worse regardless of the discount factor. We also discuss cycles, and argue that the time-average of play should resemble a correlated equilibrium. Journal of Economic Literature Classification Numbers: C72, C73, C63, D83.     

CORRELATED EQUILIBRIA,GOOD AND BAD: AN EXPERIMENTAL STUDY*

We report results from an experiment that explores the empirical validity of correlated equilibrium, an important generalization of Nash equilibrium. Specifically, we examine the conditions under which subjects playing the game of Chicken will condition their behavior on private third‐party recommendations drawn from publicly announced distributions. We find that when recommendations are given, behavior differs from both a mixed‐strategy Nash equilibrium and behavior without recommendations. In particular, subjects typically follow recommendations if and only if (1) those recommendations derive from a correlated equilibrium and (2) that correlated equilibrium is payoff‐enhancing relative to the available Nash equilibria.     

On the complexity of repeated principal agent games?

Summary. We examine an infinitely repeated principal agent game without discounting (Radner [1985] ), in which the agent may engage in multiple projects. We focus on “linear” strategies that summarize each history into a linear function of public outcomes, and select an action according to a single threshold rule. We claim that linear strategies significantly simplify the computation needed to make strategic decisions following each history. Despite the simplicity of linear strategies, we can virtually recover the folk theorem. For any individually rational payoff vector in the interior of the set of feasible expected payoff vectors, there exists a pair of linear strategies that form a Nash equilibrium supporting the target payoff. The equilibrium strategies and the equilibrium payoff vectors form a globally stable solution (Smale [1980] ).     

In search of an evolutionary edge: trading with a few, more, or many

Consider a population of farmers who live around a lake. Each farmer engages in trade with his m adjacent neighbors, where m is termed the “span of interaction.” Trade is governed by a prisoner’s dilemma “rule of engagement.” A farmer’s payoff is the sum of the payoffs from the m prisoner’s dilemma games played with his ^m/₂^m/_2 neighbors to the left, and with his ^m/₂^m/_2 neighbors to the right. When a farmer dies, his son takes over. The son who adheres to his father’s span of interaction decides whether to cooperate or defect by considering the actions taken and the payoffs received by the most prosperous member of the group comprising his father and his father’s m trading partners. Under a conventional structure of payoffs, it is shown that a large span of interaction is detrimental to the long-run coexistence of cooperation and defection, and conditions are provided under which the social outcome associated with the expansion of trade when individuals trade with a few is better than that when they trade with many. Under the stipulated conditions it is shown, by means of a static comparative analysis of the steady state configurations of the farmer population, that an expansion of the market can be beneficial in one context, detrimental in another.     

Payoff dominance and risk dominance in the observable delay game: a note

We examine whether the payoff dominant sequential-move (Stackelberg) outcome is realized when timing is endogenized. We adopt the observable delay game formulated by Hamilton and Slutsky [Games Econ Behav 2(1):29–46, 1990]. We find that if one sequential-move outcome is payoff dominant, either (i) the outcome both players prefer is the unique equilibrium; or (ii) two sequential-move outcomes are equilibria and the one both players prefer is risk dominant. In other words, no conflict between payoff dominance and risk dominance in the observable delay game exists, in contrast to other games such as (non pure) coordination games. We also find that even if one of two sequential-move outcomes is the unique equilibrium outcome in the observable delay game, it does not imply that the equilibrium outcome is payoff dominant to the other sequential-move outcome.      

Routines and incentives in group tasks*

The artificial context “Target the Two” has been used in experiments to explore some of the features of routinization and learning. Two agents must learn to coordinate their actions to achieve a common goal, without being allowed to use verbal communication. This article reports an experiment, in which we compare the degree of routinization and the performance of players in two treatments. Each treatment submits players to the same sequence of starting configurations, but differs in terms of the payoff function. In the first treatment (A), the payoff is based on the number of moves required to achieve the goal, whereas in the second treatment (B) the payoff depends on the time required for completion. We observe that (1) in treatment B subjects tend to play in a more “routinized” way and (2) treatment B reduces the time spent on play, but does not decrease the resources (the number of moves) used, relative to treatment A.     

Learning aspiration in repeated games

We study infinitely repeated symmetric 2×2 games played by bounded rational agents who follow a simple rule of thumb: each agent continues to play the same action if the current payoff exceeds the average of the past payoffs, and switches to the other action with a positive probability otherwise. By applying the stochastic approximation technique, we characterize the asymptotic outcomes for all 2×2 games. In the prisoners’ dilemma game, for example, the players cooperate in the limit if and only if the gain from defecting against cooperation is “modest.”     

The equivalence of the Dekel–Fudenberg iterative procedure and weakly perfect rationalizability

Summary. Two approaches have been proposed in the literature to refine the rationalizability solution concept: either assuming that a player believes that with small probability her opponents choose strategies that are irrational, or assuming that their is a small amount of payoff uncertainty. We show that both approaches lead to the same refinement if strategy perturbations are made according to the concept of weakly perfect rationalizability, and if there is payoff uncertainty as in Dekel and Fudenberg [J. of Econ. Theory 52 (1990), 243–267]. For both cases, the strategies that survive are obtained by starting with one round of elimination of weakly dominated strategies followed by many rounds of elimination of strictly dominated strategies. Received: 10 December 1998; revised version: 26 April 1999     

Utility from anticipation and personal equilibrium

I develop a dynamic model of individual decisionmaking in which the agent derives utility from physical outcomes as well as from rational beliefs about physical outcomes (“anticipation”), and these two payoff components can interact. Beliefs and behavior are jointly determined in a personal equilibrium by the requirement that behavior given past beliefs must be consistent with those beliefs. I explore three phenomena made possible by utility from anticipation, and prove that if the decisionmaker’s behavior is distinguishable from a person’s who cares only about physical outcomes, she must exhibit at least one of these phenomena. First, the decisionmaker can be prone to self-fulfilling expectations. Second, she might be time-inconsistent even if her preferences in all periods are identical. Third, she might exhibit informational preferences, where these preferences are intimately connected to her attitudes toward disappointments. Applications of the framework to reference-dependent preferences, impulsive behaviors, and emotionally difficult choices are discussed.     

Are we nice(r) to nice(r) people?—An experimental analysis

We experimentally investigate whether individuals can reliably detect cooperators (the nice(r) people) in an anonymous decision environment involving “connected games.” Participants can condition their choices in an asymmetric prisoners’ dilemma and a trust game on past individual (their partner’s donation share to a self-selected charity) and social (whether their partner belongs to a group with high or low average donations) information. Thus, the two measures of niceness are the individual donation share in the donation task, and the cooperativeness of one’s choice in the two games. We find that high donors achieve a higher-than-average expected payoff by cooperating predominantly with other high donors. Group affiliation proved to be irrelevant. Electronic Supplementary Material Supplementary material is available in the online version of this article at . JEL Classification C91, C72, D3     

On the Non-Existence of Redundant Options

In a seminal paper, Ross (Q J Econ 90:75–89, 1976) shows that if security markets are resolving, then there exist (non-redundant) options that generate complete security markets. Complementing his work, Aliprantis and Tourky (2002) show that if security markets are strongly resolving and the number of primitive securities is less than half the number of states, then every option is non-redundant. Our paper extends Aliprantis and Tourky’s result to the case when their condition on the number of primitive securities is not imposed. Specifically, we show that if there exists no binary payoff vector in the asset span, then for each portfolio there exists a set of exercise prices of full measure such that any option on the portfolio with an exercise price in this set is non-redundant. Since the condition that there exists no binary payoff vector in the asset span holds generically, redundant options are thus rare. I am grateful to an anonymous referee for very helpful comments. Research support from the School of Business at The George Washington University is gratefully acknowledged     

Pricing rules and Arrow–Debreu ambiguous valuation

This paper considers pricing rules of single-period securities markets with finitely many states. Our main result characterizes those pricing rules C that are super-replication prices of a frictionless and arbitrage-free incomplete asset structure with a bond. This characterization relies on the equivalence between the sets of frictionless securities and securities priced by C. The former captures securities without bid-ask spreads, while the second captures the class of securities where, if some of its delivers is replaced by a higher payoff, then the resulting security is characterized by a higher value priced by C. We also analyze the special case of pricing rules associated with securities markets admitting a structure of basic assets paying one in some event and nothing otherwise. In this case, we show that the pricing rule can be characterized in terms of capacities. This Arrow–Debreu ambiguous state price can be viewed as a generalization for incomplete markets of Arrow–Debreu state price valuation. Also, some interesting cases are given by pricing rules determined by an integral w.r.t. a risk-neutral capacity. For instance, incomplete markets of Arrow securities and a bond are revealed by a Choquet integral w.r.t. a special risk-neutral capacity.     

An equilibrium closure result for discontinuous games

For games with discontinuous payoffs Simon and Zame (Econometrica 58:861–872, 1990) introduced payoff indeterminacy, in the form of endogenous sharing rules, which are measurable selections of a certain payoff correspondence. Their main result concerns the existence of a mixed Nash equilibrium and an associated sharing rule. Its proof is based on a discrete approximation scheme “from within” the payoff correspondence. Here, we present a new, related closure result for games with possibly noncompact action spaces, involving a sequence of Nash equilibria. In contrast to Simon and Zame (Econometrica 58:861–872, 1990), this result can be used for more involved forms of approximation, because it contains more information about the endogenous sharing rule. With such added precision, the closure result can be used for the actual computation of endogenous sharing rules in games with discontinuous payoffs by means of successive continuous interpolations in an approximation scheme. This is demonstrated for a Bertrand type duopoly game and for a location game already considered by Simon and Zame. Moreover, the main existence result of Simon and Zame (Econometrica 58:861–872, 1990) follows in two different ways from the closure result.     

Fiscal rules of income transformation

Summary. The purpose of this paper is to characterize the class of fiscal rules of income transformation which are equity improving and, at the same time, preserve the ranking of existing distributions. Contrary to the related literature individual well-being depends not just on income but also on prices. We show that, when the environment is restricted such that a general transformation class still can be defined, the only “desirable” fiscal rule is the simple redistributive linear taxation schedule, of the same type that is the rule in practice in most economies. Received: May 8, 1997; revised version: September 15, 1997     

Monotone equilibria in Bayesian games of strategic complementarities

For Bayesian games of strategic complementarities, we provide a constructive proof of the existence of a greatest and a least Bayesian Nash equilibrium, each one in strategies that are monotone in type. Our main assumptions, besides strategic complementarities, are that each player's payoff displays increasing differences in own action and the profile of types and that each player's interim beliefs are increasing in type with respect to first-order stochastic dominance (e.g., types are affiliated). The result holds for general action and type spaces (single-, multi-, or infinite-dimensional; continuous or discrete) and no prior is assumed. We also provide the following comparative statics result: the greatest and least equilibria are higher if there is a first-order stochastic dominant shift in the interim beliefs. We apply this result to strategic information revelation in games of voluntary disclosure.     

The Colonel Blotto game

In the Colonel Blotto game, two players simultaneously distribute forces across n battlefields. Within each battlefield, the player that allocates the higher level of force wins. The payoff of the game is the proportion of wins on the individual battlefields. An equilibrium of the Colonel Blotto game is a pair of n-variate distributions. This paper characterizes the unique equilibrium payoffs for all (symmetric and asymmetric) configurations of the players’ aggregate levels of force, characterizes the complete set of equilibrium univariate marginal distributions for most of these configurations, and constructs entirely new and novel equilibrium n-variate distributions.I am grateful to Jason Abrevaya, Dan Kovenock, James C. Moore, Roger B. Nelsen, and three anonymous referees for very helpful comments. A version of this paper was presented at the 2005 Midwest Economic Theory Meetings. This paper is based on the first chapter of my Ph.D. dissertation     

The Costs of Implementing the Majority Principle: The Golden Voting Rule

In a context of constitutional choice of a voting rule, this paper presents an economic analysis of scoring rules that identifies the golden voting rule under the impartial culture assumption. This golden rule depends on the weights β and (1−β) assigned to two types of costs: the cost of majority decisiveness (‘tyranny’) and the cost of the ‘erosion’ in the majority principle. Our first main result establishes that in voting contexts where the number of voters n is typically considerably larger than the number of candidates k, the golden voting rule is the inverse plurality rule for almost any positive β. Irrespective of n and k, the golden voting rule is the inverse plurality rule if β ≥ 1/2 .. This hitherto almost unnoticed rule outperforms any other scoring rule in eliminating majority decisiveness. The golden voting rule is, however, the plurality rule, the most widely used voting rule that does not allow even the slightest ‘erosion’ in the majority principle, when β=0. Our second main result establishes that for sufficiently “small size” voting bodies, the set of potential golden rules consists at most of just three rules: the plurality rule, the Borda rule and the inverse plurality rule. On the one hand, this finding provides a new rationalization to the central role the former two rules play in practice and in the voting theory literature. On the other hand, it provides further support to the inverse plurality rule; not only that it is the golden rule in voting contexts, it also belongs, together with the plurality rule and the Borda method of counts, to the “exclusive” set of potential golden voting rules in small committees. We are indebted to Jim Buchanan, Amichai Glazer, Noa Nitzan, Ken Shepsle, and an anonymous referee for their useful comments.