Large but finite games with asymmetric information

Carmona considered an increasing sequence of finite games in each of which players are characterized by payoff functions that are restricted to vary within a uniformly equicontinuous set and choose their strategies from a common compact metric strategy set. Then Carmona proved that each finite game in an upper tail of such a sequence admits an approximate Nash equilibrium in pure strategies.     

Generalized weak transfer continuity and the Nash equilibrium

This paper introduces the notion of generalized weak transfer continuity and establishes that a bounded, compact locally convex metric quasiconcave and generalized weak transfer continuous game has a Nash equilibrium. Our equilibrium existence result neither implies nor is implied by the existing results in the literature such as those in [Carmona, G., 2011. Understanding some recent existence results for discontinuous games. Economic Theory 48, 31–45], [Prokopovych, P., 2011. On equilibrium existence in payoff secure games. Economic Theory 48, 5–16], [Carmona, G., 2009. An existence result for discontinuous games. Journal of Economic Theory 144, 1333–1340], and [Reny, P.J., 1999. On the existence of pure and mixed strategy Nash equilibria in discontinuous games, Econometrica 67, 1029–1056].     

Repeated two-person zero-sum games with unequal discounting and private monitoring

We consider discounted repeated two-person zero-sum games with private monitoring. We show that even when players have different and time-varying discount factors, each player’s payoff is equal to his stage-game minmax payoff in every sequential equilibrium. Furthermore, we show that: (a) in every history on the equilibrium path, the pair formed by each player’s conjecture about his opponent’s action must be a Nash equilibrium of the stage game, and (b) the distribution of action profiles in every period is a correlated equilibrium of the stage game. In the particular case of public strategies in public monitoring games, players must play a Nash equilibrium after any public history.     

Some results on general assumptions about the existence of economic equilibrium

In the present paper we maximally use the possibilities provided by the Nash approach and the Kakutani fixed point theorem for proving the existence of an economic equilibrium. We obtain a general existence theorem which does not require a special form for income distribution functions and producer's objectives, independence of consumers' tastes, ordered preference and zero degree homogeneous price dependence. The role of the non-satiation assumption becomes more clear.     

Bayesian Nash equilibrium and variational inequalities

This paper provides a sufficient condition for the existence and uniqueness of a Bayesian Nash equilibrium by regarding it as a solution of a variational inequality. The payoff gradient of a game is defined as a vector whose component is a partial derivative of each player’s payoff function with respect to the player’s own action. If the Jacobian matrix of the payoff gradient is negative definite for each state, then a Bayesian Nash equilibrium is unique. This result unifies and generalizes the uniqueness of an equilibrium in a complete information game by Rosen (1965) and that in a team by Radner (1962). In a Bayesian game played on a network, the Jacobian matrix of the payoff gradient coincides with the weighted adjacency matrix of the underlying graph.     

Good neighbors are hard to find: computational complexity of network formation

We investigate the computational complexity of several decision problems in a simple strategic game of network formation. We find that deciding if a player has a strategy that guarantees him a certain payoff against a given strategy profile of the other players is an NP-complete problem. Deciding if there exists a strategy profile that guarantees a certain aggregate payoff is also NP-complete. Deciding if there is a Nash equilibrium in pure strategies which guarantees a certain payoff to each player is NP-hard. The problem of deciding if a given strategy profile is a Nash equilibrium is investigated as well. We would like to thank both referees for valuable corrections and suggestions and one referee in particular for a very detailed and beneficial critique. We thank Colin de la Higuera for fruitful discussions. Support by the French Ministry for Youth, Education and Research, through project SCSHS-2004-04 is gratefully acknowledged.     

Strategic behavior in non-atomic games

In order to remedy the possible loss of strategic interaction in non-atomic games with a societal choice, this study proposes a refinement of Nash equilibrium, strategic equilibrium. Given a non-atomic game, its perturbed game is one in which every player believes that he alone has a small, but positive, impact on the societal choice; and a distribution is a strategic equilibrium if it is a limit point of a sequence of Nash equilibrium distributions of games in which each player’s belief about his impact on the societal choice goes to zero. After proving the existence of strategic equilibria, we show that all of them must be Nash. We also show that all regular equilibria of smooth non-atomic games are strategic. Moreover, it is displayed that in many economic applications, the set of strategic equilibria coincides with that of Nash equilibria of large finite games.     

Tacit Collusion in a One‐Shot Game of Price Competition with Soft Capacity Constraints

This paper analyzes price competition in the case of two firms operating under constant returns to scale with more than one production factor. Factors are chosen sequentially in a two‐stage game generating a soft capacity constraint and implying a convex short‐term cost function in the second stage of the game. We show that tacit collusion is the only predictable result of the whole game, that is, the unique payoff‐dominant pure strategy Nash equilibrium. Technically, this paper bridges the capacity constraint literature on price competition and that of the convex cost function.     

Endogenous mechanisms and Nash equilibrium in competitive contracting games

We model strategic competition in a market with asymmetric information as a noncooperative game in which each firm competes for the business of a buyer of unknown type by offering the buyer a catalog of products and prices. The timing in our model is Stackelberg: in the first stage, given the distribution of buyer types known to all firms and the deducible, type-dependent best responses of the agent, firms simultaneously and noncooperatively choose their catalog offers. In the second stage the buyer, knowing his type, chooses a single firm and product-price pair from that firm’s catalog. By backward induction, this Stackelberg game with asymmetric information reduces to a game over catalogs with payoff indeterminacies. In particular, due to ties within catalogs and/or across catalogs, corresponding to any catalog profile offered by firms there may be multiple possible expected firm payoffs, all consistent with the rational optimizing behavior of the agent for each of his types. The resolution of these indeterminacies depends on the tie-breaking mechanism which emerges in the market. Because each tie-breaking mechanism induces a particular game over catalogs, a reasonable candidate would be a tie-breaking mechanism which supports a Nash equilibrium in the corresponding catalog game. We call such a mechanism an endogenous Nash mechanism. The fundamental question we address in this paper is, does there exist an endogenous Nash mechanism—and therefore, does there exist a Nash equilibrium for the catalog game? We show under fairly mild conditions on primitives that catalog games naturally possess tie-breaking mechanisms which support Nash equilibria.     

Pareto-undominated and socially-maximal equilibria in non-atomic games

This paper makes the observation that a finite Bayesian game with diffused and disparate private information can be conceived of as a large game with a non-atomic continuum of players. By using this observation as its methodological point of departure, it shows that (i) a Bayes–Nash equilibrium (BNE) exists in a finite Bayesian game with private information if and only if a Nash equilibrium exists in the induced large game, and (ii) both Pareto-undominated and socially-maximal BNE exist in finite Bayesian games with private information. In particular, it shows these results to be a direct consequence of results for a version of a large game re-modeled for situations where different players may have different action sets.     

Double implementation of the Lindahl equilibrium by a continuous mechanism

We consider a class of economies with public goods that have the following properties: (i) The preferences of the agents are convex, interior, and strictly increasing. (ii) The technology for production of public goods is a closed convex cone that satisfies free disposal and an additional mild assumption. No assumptions are made on continuity, completeness or transitivity of preferences. We provide a continuous and feasible mechanism that implements the Lindahl equilibrium by Nash equilibria, and has the following property: For every economy in our class every Nash equilibrium of the game induced by the mechanism is a strong Nash equilibrium.     

On games without side payments arising from a general class of markets

The class of games without side payments obtainable from finite trader markets having possibly infinite dimensional commodity spaces, individual compact, convex consumption and production sets, and concave upper-semicontinuous utility functions is considered. It is shown that these market games are precisely the totally balanced games. In fact, each totally balanced game is shown to have both a finite commodity representation and an infinite commodity ‘simple’ representation.     

Interim correlated rationalizability in infinite games

In a Bayesian game, assume that the type space is a complete, separable metric space, the action space is a compact metric space, and the payoff functions are continuous. We show that the iterative and fixed-point definitions of interim correlated rationalizability (ICR) coincide, and ICR is non-empty-valued and upper hemicontinuous. This extends the finite-game results of Dekel et al. (2007), who introduced ICR. Our result applies, for instance, to discounted infinite-horizon dynamic games.     

Equilibria in a class of aggregative location games

Consider a multimarket oligopoly, where firms have a single license that allows them to supply exactly one market out of a given set of markets. How does the restriction to supply only one market influence the existence of equilibria in the game? To answer this question, we study a general class of aggregative location games where a strategy of a player is to choose simultaneously both a location out of a finite set and a non-negative quantity out of a compact interval. The utility of each player is assumed to depend solely on the chosen location, the chosen quantity, and the aggregated quantity of all other players on the chosen location. We show that each game in this class possesses a pure Nash equilibrium whenever the players’ utility functions satisfy the assumptions negative externality, decreasing marginal utility, continuity, and Location–Symmetry. We also provide examples exhibiting that, if one of the assumptions is violated, a pure Nash equilibrium may fail to exist.     

Convergence to competitive equilibria and elimination of no-trade (in a strategic market game with limit prices)

The strategic market games literature contains many results that predict Walrasian equilibria in the competitive limit. However, they usually come at the expense of ad hoc assumptions that rule out “pathological” no trade equilibria. This paper studies a strategic market game with limit prices. The set of Nash equilibrium allocations of this game converges to the set containing all competitive equilibria and no-trade, when players are replicated. Moreover, two rounds of iterated deletion of weakly dominated strategies eliminate the no-trade equilibria. Hence, replication paired with two rounds of iterated dominance gives a clean prediction of competitive equilibrium.     

Multiproduct price competition with heterogeneous consumers and nonconvex costs

This paper extends the oligopolistic model of price competition to environments with multiple goods, heterogeneous consumers, and arbitrary continuous cost functions. A Nash equilibrium in mixed strategies with an endogenous sharing rule is proven to exist. It is also shown that, in environments with fixed costs and constant marginal costs, all (symmetric and asymmetric) equilibria exhibit price dispersion across stores. Furthermore, the paper identifies scenarios in which prices will necessarily be random. In these markets, stores keep each other guessing because, given the fixed costs, they would incur a loss if their price strategies were anticipated and beaten by competitors. This is interpreted as an important economic feature that is possibly behind random price promotions such as weekly specials.     

Equilibrium selection in games: the mollifier method

This paper introduces an embedding of a Nash equilibrium into a sequence of perturbed games, which achieves continuous differentiability of best responses by mollifying them over a continuously differentiable density with compact support (window size). Along any sequence with shrinking window size, the equilibria are single-valued whenever the function has a regular Jacobian and the set of equilibria where it is singular has measure zero. We achieve a further reduction of the equilibrium set by inserting within the embedding a procedure that eliminates the strict interior of equilibrium sets. The mollifier can be approximated consistently using kernel density regression, and we sketch a non-stationary stochastic optimization algorithm that uses this approximation and converges with probability one to an equilibrium of the original game.     

First price package auction with many traders

This paper studies a first price package auction in which multiple sellers participate in addition to multiple buyers. We generalize the notion of the profit-target strategy which is first introduced as a truthful strategy in a first price package auction with a single seller by Bernheim and Whinston (1986b). We then show that the set of equilibrium payoffs in profit-target strategies is equal to the bidder-optimal core, and is also equal to the set of coalition-proof Nash equilibria. Using this result, we find that any equilibrium payoff vector is weakly Pareto-dominated by the VCG payoff vector for buyers, and that the Walrasian competitive equilibrium payoff vector is weakly Pareto-dominated by some equilibrium payoff vector for buyers, even if goods are substitutes. This contrasts with the first price package auction with a single seller, in which it is shown that if goods are substitutes, then those three outcomes are payoff-equivalent.     

Uniqueness conditions for strongly point-rationalizable solutions to games with metrizable strategy sets

This paper introduces the iterative solution concept of strong point-rationalizability as a strengthening of standard point-rationalizability by stipulating that any two players have identical beliefs about the strategy choices of their common opponents. By adopting and generalizing the contraction-property approach of Moulin [Moulin, H., 1984. Dominance solvability and cournot stability. Mathematical Social Sciences 7, 83–102] and Bernheim [Bernheim, B.D., 1984. Rationalizable strategic behavior. Econometrica 52, 1007–1028] we derive sufficient conditions for the existence of unique strongly point-rationalizable strategies in strategic games with best response functions. These uniqueness results are derived under fairly general assumptions and are especially useful for complete and bounded, as well as finite strategy sets. For games with monotonic individual best response functions, equivalence between a unique strongly point-rationalizable and a unique point-rationalizable solution in the standard sense is established. Furthermore, the existence of unique fixed points is proven under conditions that generalize for bounded metric spaces an established fixed point theorem by Bonsall [Bonsall, F.F., 1962. Lectures on Some Fixed Point Theorems of Functional Analysis. Tata Institute of Fundamental Research, Bombay] and Smart [Smart, D.R., 1974. Fixed Point Theorems. Cambridge University Press, Cambridge, London]. Possible extensions of our findings to games with multi-valued best response correspondences are discussed.     

Pure strategy equilibria in games with countable actions

In this paper, we extend the Radner–Rosenthal theorem with finite action spaces on the existence of a pure strategy equilibrium for a finite game to the case that the action space is countable and complete. We also prove the existence of a pure strategy equilibrium for a game with a continuum of players of finite types and with a countable and complete action space. To work with the countably infinite action spaces, we prove some regularity properties on the set of distributions induced by the measurable selections of a correspondence with a countable range by using the Bollobás–Varopoulos extension of the marriage lemma.