Strongly Consistent Self‐Confirming Equilibrium

Fudenberg and Levine (1993a) introduced the notion of self‐confirming equilibrium, which is generally less restrictive than Nash equilibrium. Fudenberg and Levine also defined a concept of consistency, and claimed in their Theorem 4 that with consistency and other conditions on beliefs, a self‐confirming equilibrium has a Nash equilibrium outcome. We provide a counterexample that disproves Theorem 4 and prove an alternative by replacing consistency with a more restrictive concept, which we call strong consistency. In games with observed deviators, self‐confirming equilibria are strongly consistent self‐confirming equilibria. Hence, our alternative theorem ensures that despite the counterexample, the corollary of Theorem 4 is still valid.     

On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms

Consider nonempty finite pure strategy sets S₁,…,S_n, let S=S₁×⋅⋅⋅×S_n, let Ω be a finite space of “outcomes,” let Δ(Ω) be the set of probability distributions on Ω, and let θ: S→Δ(Ω) be a function. We study the conjecture that for any utility in a generic set of n‐tuples of utilities on Ω there are finitely many distributions on Ω induced by the Nash equilibria of the game given by the induced utilities on S. We give a counterexample refuting the conjecture for n≥3. Several special cases of the conjecture follow from well known theorems, and we provide some generalizations of these results.     

Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information

This paper analyzes a class of games of incomplete information where each agent has private information about her own type, and the types are drawn from an atomless joint probability distribution. The main result establishes existence of pure strategy Nash equilibria (PSNE) under a condition we call the single crossing condition (SCC), roughly described as follows: whenever each opponent uses a nondecreasing strategy (in the sense that higher types choose higher actions), a player's best response strategy is also nondecreasing. When the SCC holds, a PSNE exists in every finite‐action game. Further, for games with continuous payoffs and a continuum of actions, there exists a sequence of PSNE to finite‐action games that converges to a PSNE of the continuum‐action game. These convergence and existence results also extend to some classes of games with discontinuous payoffs, such as first‐price auctions, where bidders may be heterogeneous and reserve prices are permitted. Finally, the paper characterizes the SCC based on properties of utility functions and probability distributions over types. Applications include first‐price, multi‐unit, and all‐pay auctions; pricing games with incomplete information about costs; and noisy signaling games.     

Computing Supergame Equilibria

We present a general method for computing the set of supergame equilibria in infinitely repeated games with perfect monitoring and public randomization. We present a three‐stage algorithm that constructs a convex set containing the set of equilibrium values, constructs another convex set contained in the set of equilibrium values, and produces strategies that support them. We explore the properties of this algorithm by applying it to familiar games.     

Does Experience Teach? Professionals and Minimax Play in the Lab

Does expertise in strategic behavior obtained in the field transfer to the abstract setting of the laboratory? Palacios‐Huerta and Volij (2008) argued that the behavior of professional soccer players in mixed‐strategy games conforms closely to minimax play, while the behavior of students (who are presumably novices in strategic situations requiring unpredictability) does not. We reexamine their data, showing that the play of professionals is inconsistent with the minimax hypothesis in several respects: (i) professionals follow nonstationary mixtures, with action frequencies that are negatively correlated between the first and the second half of the experiment, (ii) professionals tend to switch between under‐ and overplaying an action relative to its equilibrium frequency, and (iii) the distribution of action frequencies across professionals is far from the distribution implied by minimax. In each respect, the behavior of students conforms more closely to the minimax hypothesis.     

The Expected Number of Nash Equilibria of a Normal Form Game

Fix finite pure strategy sets _S1,…,_Sn , and let S=_S1×⋯×_Sn . In our model of a random game the agents' payoffs are statistically independent, with each agent's payoff uniformly distributed on the unit sphere in ℝ^S. For given nonempty _T1⊂_S1,…,_Tn⊂_Sn we give a computationally implementable formula for the mean number of Nash equilibria in which each agent i's mixed strategy has support T_i. The formula is the product of two expressions. The first is the expected number of totally mixed equilibria for the truncated game obtained by eliminating pure strategies outside the sets T_i. The second may be construed as the “probability” that such an equilibrium remains an equilibrium when the strategies in the sets _Si∖_Ti become available.     

Split‐Award Procurement Auctions—Can Bayesian Equilibrium Strategies Predict Human Bidding Behavior in Multi‐Object Auctions?

We analyze if and when symmetric Bayes Nash equilibrium predictions can explain human bidding behavior in multi‐object auctions. We focus on two sealed‐bid split‐award auctions with ex ante split decisions as they can be regularly found in procurement practice. These auction formats are straightforward multi‐object extensions of the first‐price sealed‐bid auction. We derive the risk‐neutral symmetric Bayes Nash equilibrium strategies and find that, although the two auction mechanisms yield the same expected costs to the buyer, other aspects of the two models, including the equilibrium bidding strategies, differ significantly. The strategic considerations in these auction formats are more involved than in single‐lot first‐price sealed‐bid auctions, and it is questionable whether expected utility maximization can explain human bidding behavior in such multi‐object auctions. Therefore, we analyzed the predictive accuracy of our equilibrium strategies in the laboratory. In human subject experiments we found underbidding, which is in line with earlier experiments on single‐lot first‐price sealed‐bid auctions. To control for regret, we organize experiments against computerized bidders, who play the equilibrium strategy. In computerized experiments where bid functions are only used in a single auction, we found significant underbidding on low‐cost draws. In experiments where the bid function is reused in 100 auctions, we could also control effectively for risk aversion, and there is no significant difference of the average bidding behavior and the risk‐neutral Bayes Nash equilibrium bid function. The results suggest that strategic complexity does not serve as an explanation for underbidding in split‐award procurement auctions, but risk aversion does have a significant impact.     

On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games

A game is better-reply secure if for every nonequilibrium strategy x^* and every payoff vector limit u^* resulting from strategies approaching x^*, some player i has a strategy yielding a payoff strictly above u_i^* even if the others deviate slightly from x^*. If strategy spaces are compact and convex, payoffs are quasiconcave in the owner's strategy, and the game is better-reply secure, then a pure strategy Nash equilibrium exists. Better-reply security holds in many economic games. It also permits new results on the existence of symmetric and mixed strategy Nash equilibria.     

Approximate versus Exact Equilibria in Dynamic Economies

This paper develops theoretical foundations for an error analysis of approximate equilibria in dynamic stochastic general equilibrium models with heterogeneous agents and incomplete financial markets. While there are several algorithms that compute prices and allocations for which agents' first‐order conditions are approximately satisfied (“approximate equilibria”), there are few results on how to interpret the errors in these candidate solutions and how to relate the computed allocations and prices to exact equilibrium allocations and prices. We give a simple example to illustrate that approximate equilibria might be very far from exact equilibria. We then interpret approximate equilibria as equilibria for close‐by economies; that is, for economies with close‐by individual endowments and preferences. We present an error analysis for two models that are commonly used in applications, an overlapping generations (OLG) model with stochastic production and an asset pricing model with infinitely lived agents. We provide sufficient conditions that ensure that approximate equilibria are close to exact equilibria of close‐by economies. Numerical examples illustrate the analysis.     

Markov Perfect Industry Dynamics With Many Firms

We propose an approximation method for analyzing Ericson and Pakes (1995)‐style dynamic models of imperfect competition. We define a new equilibrium concept that we call oblivious equilibrium, in which each firm is assumed to make decisions based only on its own state and knowledge of the long‐run average industry state, but where firms ignore current information about competitors' states. The great advantage of oblivious equilibria is that they are much easier to compute than are Markov perfect equilibria. Moreover, we show that, as the market becomes large, if the equilibrium distribution of firm states obeys a certain “light‐tail” condition, then oblivious equilibria closely approximate Markov perfect equilibria. This theorem justifies using oblivious equilibria to analyze Markov perfect industry dynamics in Ericson and Pakes (1995)‐style models with many firms.     

A Simple Adaptive Procedure Leading to Correlated Equilibrium

We propose a new and simple adaptive procedure for playing a game: ‘regret‐matching.’ In this procedure, players may depart from their current play with probabilities that are proportional to measures of regret for not having used other strategies in the past. It is shown that our adaptive procedure guarantees that, with probability one, the empirical distributions of play converge to the set of correlated equilibria of the game.     

Multiperson Bargaining and Strategic Complexity

We investigate the effect of introducing costs of complexity in the n‐person unanimity bargaining game. As is well‐known, in this game every individually rational allocation is sustainable as a Nash equilibrium (also as a subgame perfect equilibrium if players are sufficiently patient and if n & 2). Moreover, delays in agreement are also possible in such equilibria. By limiting ourselves to a plausible notion of complexity that captures length of memory, we find that the introduction of complexity costs (lexicographically with the standard payoffs) does not reduce the range of possible allocations but does limit the amount of delay that can occur in any agreement. In particular, we show that in any n‐player game, for any allocation z, an agreement on z at any period t can be sustained as a Nash equilibrium of the game with complexity costs if and only if t≤n. We use the limit on delay result to establish that, in equilibrium, the strategies implement stationary behavior. Finally, we also show that ‘noisy Nash equilibrium’ with complexity costs sustains only the unique stationary subgame perfect equilibrium allocation.     

A Theory of Disagreement in Repeated Games With Bargaining

This paper proposes a new approach to equilibrium selection in repeated games with transfers, supposing that in each period the players bargain over how to play. Although the bargaining phase is cheap talk (following a generalized alternating‐offer protocol), sharp predictions arise from three axioms. Two axioms allow the players to meaningfully discuss whether to deviate from their plan; the third embodies a “theory of disagreement”—that play under disagreement should not vary with the manner in which bargaining broke down. Equilibria that satisfy these axioms exist for all discount factors and are simple to construct; all equilibria generate the same welfare. Optimal play under agreement generally requires suboptimal play under disagreement. Whether patient players attain efficiency depends on both the stage game and the bargaining protocol. The theory extends naturally to games with imperfect public monitoring and heterogeneous discount factors, and yields new insights into classic relational contracting questions.     

Implementation with Near‐Complete Information

Many refinements of Nash equilibrium yield solution correspondences that do not have closed graph in the space of payoffs or information. This has significance for implementation theory, especially under complete information. If a planner is concerned that all equilibria of his mechanism yield a desired outcome, and entertains the possibility that players may have even the slightest uncertainty about payoffs, then the planner should insist on a solution concept with closed graph. We show that this requirement entails substantial restrictions on the set of implementable social choice rules. In particular, when preferences are strict (or more generally, hedonic), while almost any social choice function can be implemented in undominated Nash equilibrium, only monotonic social choice functions can be implemented in the closure of the undominated Nash correspondence.     

Competitive and Collaborative Quality and Warranty Management in Supply Chains

Product quality and product warranty coverage are two important and closely related operational decisions. A longer warranty protection period can boost sales, but it may also result in dramatically increased warranty cost, if product quality is poor. To investigate how these two decisions interact with each other and influence supply chain performance, we develop a single‐period model with a supplier that provides a product to an original equipment manufacturer, which in turn sells it to customers. Customer demand is random and affected by the length of the product warranty period. Warranty costs are incurred by both the supplier and the manufacturer. We analyze two different scenarios based on which party sets the warranty period: manufacturer warranty and supplier warranty. Product quality is controlled by the supplier, and the manufacturer determines the ordering quantity. We analyze these decentralized systems and provide the structural properties of the equilibrium strategies. We also compare the results of centralized and decentralized systems and identify the conditions under which one system provides a longer warranty and better product quality than the other. Our numerical study further shows that, in decentralized settings, when the warranty period is determined by the firm sharing the larger proportion of total warranty costs, the supply chain can achieve greater system‐wide profit. Both parties can therefore benefit from properly delegating the warranty decision and sharing the resulting additional profit. We further design a supplier‐development and buy‐back contract for coordinating decentralized supply chains. Several extensions are also discussed.     

Weakly Belief‐Free Equilibria in Repeated Games With Private Monitoring

Repeated games with imperfect private monitoring have a wide range of applications, but a complete characterization of all equilibria in this class of games has yet to be obtained. The existing literature has identified a relatively tractable subset of equilibria. The present paper introduces the notion of weakly belief‐free equilibria for repeated games with imperfect private monitoring. This is a tractable class which subsumes, as a special case, a major part of the existing literature (the belief‐free equilibria). It is shown that this class can outperform the equilibria identified by the previous work.     

Stationary Equilibria in Asset‐Pricing Models with Incomplete Markets and Collateral

We consider an infinite‐horizon exchange economy with incomplete markets and collateral constraints. As in the two‐period model of Geanakoplos and Zame (2002), households can default on their liabilities at any time, and financial securities are only traded if the promises associated with these securities are backed by collateral. We examine an economy with a single perishable consumption good, where the only collateral available consists of productive assets. In this model, competitive equilibria always exist and we show that, under the assumption that all exogenous variables follow a Markov chain, there also exist stationary equilibria. These equilibria can be characterized by a mapping from the exogenous shock and the current distribution of financial wealth to prices and portfolio choices. We develop an algorithm to approximate this mapping numerically and discuss ways to implement the algorithm in practice. A computational example demonstrates the performance of the algorithm and shows some quantitative features of equilibria in a model with collateral and default.     

Competition and Coordination in Two‐Tier Public Service Systems under Government Fiscal Policy

As a result of government budgetary limits and rapid market growth, many public service systems—such as health care—are characterized by extensive customer wait times that have become a serious problem. This problem might be solved by allowing private firms to enter these markets, which would provide customers with a choice between a free (governmental) public service provider (SP) and a fee‐charging (or “toll”) private SP. In such a two‐tier service system, the two SPs are differentiated by service quality and cost efficiency. This study focuses on the competition and coordination issues for two‐tier service systems with customers who are sensitive to both service quality and delay. The free system attempts to maximize its expected total customer utility with limited capacity, whereas the toll system attempts to maximize its profit. Neither goal is aligned with the social welfare goal of the public service. To achieve the social welfare goal, the government plays a crucial role in coordinating the two‐tier service system via the budget, the tradeoff of social members' goals, and tax‐subsidy policies. Using a mixed duopoly game, we establish Nash equilibrium strategies and identify the conditions for the existence of the two‐tier service system. We employ several interesting and counter‐intuitive managerial insights generated by the model to show that the public service can be delivered more efficiently via customer choice and SP competition. In addition, we show that a relatively low tax‐subsidy rate can almost perfectly coordinate the two SPs to achieve most of the maximum possible benefit of the two‐tier service system.     

Repeated Games Where the Payoffs and Monitoring Structure Are Unknown

This paper studies repeated games with imperfect public monitoring where the players are uncertain both about the payoff functions and about the relationship between the distribution of signals and the actions played. We introduce the concept of perfect public ex post equilibrium (PPXE), and show that it can be characterized with an extension of the techniques used to study perfect public equilibria. We develop identifiability conditions that are sufficient for a folk theorem; these conditions imply that there are PPXE in which the payoffs are approximately the same as if the monitoring structure and payoff functions were known. Finally, we define perfect type‐contingently public ex post equilibria (PTXE), which allows players to condition their actions on their initial private information, and we provide its linear programming characterization.     

基于共识程度的双体博弈纳什均衡拓展研究

首先对一般双体博弈的策略进行拓展,提出共识纳什均衡的概念,并证明其存在性;根据共识程度的降低提出其他3种拓展形式——近似共识纳什均衡、局部共识纳什均衡和局部近似共识纳什均衡,并举例进行说明;然后,对各种均衡形式下的合作效率进行分析和比较。研究表明,共识纳什均衡的利益分配是基于信息本身——竞争环境的特殊形式,它是具有效率的。其他3种形式均衡的效率低于共识纳什均衡,但仍高于双体博弈纳什均衡。共识纳什均衡和其他3种形式的均衡为参与人组织更具效率的合作提供了渠道和理论解释。