Finding location equilibria for competing firms under delivered pricing

We address the problem of finding location equilibria of a location-price game where firms first select their locations and then set delivered prices in order to maximize their profits. Assuming that firms set the equilibrium prices in the second stage, the game is reduced to a location game for which a global minimizer of the social cost is a location equilibrium if demand is completely inelastic and marginal production cost is constant. The problem of social cost minimization is studied for both a network and a discrete location space. A node optimality property when the location space is a network is shown and an Integer Linear Programming (ILP) formulation is obtained to minimize the social cost. It is also shown that multiple location equilibria can be found if marginal delivered costs are equal for all competitors. Two ILP formulations are given to select one of such equilibria that take into account the aggregated profit and an equity criterion, respectively. An illustrative example with real data is solved and some conclusions are presented.     

Advertising in a Differential Oligopoly Game

We illustrate a differential oligopoly game where firms compete à la Cournot in homogeneous goods in the market phase and invest in advertising activities aimed at increasing the consumers reservation price. Such investments produce external effects, characterizing the advertising activity as a public good. We derive the open-loop and closed-loop Nash equilibria, and show that the properties of the equilibria depend on the curvature of the market demand function. The comparative assessment of these equilibria shows that the firms advertising efforts are larger in the open-loop equilibrium than in the closed-loop equilibrium. We also show that a cartel involving all the firms, setting both output levels and advertising efforts, may produce a steady state where the social welfare level is higher than the social welfare levels associated with both open-loop and closed-loop noncooperative settings.     

A note on correlated equilibrium

The set of correlated equilibria for a bimatrix game is a closed, bounded, convex set containing the set of Nash equilibria. We show that every extreme point of a maximal Nash set is an extreme point of the above convex set. We also give an example to show that this result is not true in the payoff space, i.e. there are games where no Nash equilibrium payoff is an extreme point of the set of correlated equilibrium payoffs.     

Dynamic Bertrand Oligopoly

We study continuous time Bertrand oligopolies in which a small number of firms producing similar goods compete with one another by setting prices. We first analyze a static version of this game in order to better understand the strategies played in the dynamic setting. Within the static game, we characterize the Nash equilibrium when there are N players with heterogeneous costs. In the dynamic game with uncertain market demand, firms of different sizes have different lifetime capacities which deplete over time according to the market demand for their good. We setup the nonzero-sum stochastic differential game and its associated system of HJB partial differential equations in the case of linear demand functions. We characterize certain qualitative features of the game using an asymptotic approximation in the limit of small competition. The equilibrium of the game is further studied using numerical solutions. We find that consumers benefit the most when a market is structured with many firms of the same relative size producing highly substitutable goods. However, a large degree of substitutability does not always lead to large drops in price, for example when two firms have a large difference in their size.     

A Strong Anti-Folk Theorem

We study the properties of finitely complex, symmetric, globally stable, and semi-perfect equilibria. We show that: (1) If a strategy satisfies these properties then players play a Nash equilibrium of the stage game in every period; (2) The set of finitely complex, symmetric, globally stable, semi-perfect equilibrium payoffs in the repeated game equals the set of Nash equilibria payoffs in the stage game; and (3) A strategy vector satisfies these properties in a Pareto optimal way if and only if players play some Pareto optimal Nash equilibrium of the stage game in every stage. Our second main result is a strong anti-Folk Theorem, since, in contrast to what is described by the Folk Theorem, the set of equilibrium payoffs does not expand when the game is repeated.This paper is a revised version of Chapter 3 of my Ph.D. thesis, which has circulated under the title “An Interpretation of Nash Equilibrium Based on the Notion of Social Institutions”.     

Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions

We consider the generalized Nash equilibrium problem which, in contrast to the standard Nash equilibrium problem, allows joint constraints of all players involved in the game. Using a regularized Nikaido-Isoda-function, we then present three optimization problems related to the generalized Nash equilibrium problem. The first optimization problem is a complete reformulation of the generalized Nash game in the sense that the global minima are precisely the solutions of the game. However, this reformulation is nonsmooth. We then modify this approach and obtain a smooth constrained optimization problem whose global minima correspond to so-called normalized Nash equilibria. The third approach uses the difference of two regularized Nikaido-Isoda-functions in order to get a smooth unconstrained optimization problem whose global minima are, once again, precisely the normalized Nash equilibria. Conditions for stationary points to be global minima of the two smooth optimization problems are also given. Some numerical results illustrate the behaviour of our approaches.     

Resource pricing games on graphs: existence of Nash equilibria

In this letter, we consider a non-cooperative resource pricing game on a graph where sellers (i.e., players) set the prices for their own resources to maximize the payoffs and buyers migrate to seek the least expensive resources. We present a model for the resource pricing game and prove the existence of Nash equilibria on regular and hierarchical graphs. The results obtained are applicable to the study of market economies, social networks and computer networks where individuals trade resources in a spatially extended environment.     

A differential oligopoly game with differentiated goods and sticky prices

We investigate a dynamic oligopoly game where goods are differentiated and prices are sticky. We study the open-loop and the closed-loop memoryless Nash equilibrium, and show that the latter equilibrium entails a larger level of steady state production as compared to the former; both equilibria entail a larger level of production in steady state than the static game. We also study the effects of price stickiness and product differentiation upon the steady state equilibrium allocation and profits. The per-firm equilibrium output is increasing in both product differentiation and price stickiness, while profits are increasing in both product differentiation and the speed of price adjustment. The steady state social welfare monotonically increases in the speed of price adjustment, and the overproduction entailed by dynamic competition has beneficial effect from a social standpoint.     

Best response dynamics for role games

In a role game, players can condition their strategies on their player position in the base game. If the base game is strategically equivalent to a zero-sum game, the set of Nash equilibria of the role game is globally asymptotically stable under the best response dynamics. If the base game is 2 ×2, then in the cyclic case the set of role game equilibria is a continuum. We identify a single equilibrium in this continuum that attracts all best response paths outside the continuum. Received: June 2001     

“Costless” regulation of monopolies with large entry cost: A game theoretic approach

A major issue within the realm of Antitrust policy is the regulation of existing monopolies. We describe a new potential indirect scheme for regulating a natural monopoly that arises from high entry cost. The approach involves minimal government intervention, and it is based on encouraging entry by offering to subsidize entry cost for potential competitors. We pose this issue as a four-stage non-cooperative game. Analysis of sub-game perfect Nash equilibria of the game reveals that the first best outcome is achieved as the unique equilibrium in which the monopolist prices at marginal cost and there is no entry. The regulation is “costless,” since no entry will occur and hence no subsidy will be paid. Received June 1995     

Dynamic pricing with uncertain production cost: An alternating-move approach

This article studies a two-firm dynamic pricing model with random production costs. The firms produce the same perishable products over an infinite time horizon when production (or operation) costs are random. In each period, each firm determines its price and production levels based on its current production cost and its opponent’s previous price level. We use an alternating-move game to model this problem and show that there exists a unique subgame perfect Nash equilibrium in production and pricing decisions. We provide a closed-form solution for the firm’s pricing policy. Finally, we study the game in the case of incomplete information, when both or one of the firms do not have access to the current prices charged by their opponents.     

Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets

Consider the N-person non-cooperative game in which each player’s cost function and the opponents’ strategies are uncertain. For such an incomplete information game, the new solution concept called a robust Nash equilibrium has attracted much attention over the past several years. The robust Nash equilibrium results from each player’s decision-making based on the robust optimization policy. In this paper, we focus on the robust Nash equilibrium problem in which each player’s cost function is quadratic, and the uncertainty sets for the opponents’ strategies and the cost matrices are represented by means of Euclidean and Frobenius norms, respectively. Then, we show that the robust Nash equilibrium problem can be reformulated as a semidefinite complementarity problem (SDCP), by utilizing the semidefinite programming (SDP) reformulation technique in robust optimization. We also give some numerical example to illustrate the behavior of robust Nash equilibria.     

Collaboration and sharing mechanisms in improving corporate social responsibility

This paper investigates the effects of the collaboration between an upstream and a downstream firm regarding their decisions of prices and levels of corporate social responsibility (CSR) efforts. The firms collaborate with each other by sharing their costs or benefits to improve their profitabilities and CSR performances. Three collaborative models are developed for considering that collaboration may be undertaken by either or both firms, and each model has both profit- and cost-sharing mechanisms. We derive and characterize the consumer valuation and the firms’ decisions at equilibrium with respect to the changes in the sharing scheme, and further identify the impacts of each sharing mechanism. Moreover, a Nash bargaining game is developed for examining the choices of sharing scheme under the negotiation between the firms. Finally, we provide economic and managerial insights for socially concerned companies.     

Structure of extreme correlated equilibria: a zero-sum example and its implications

We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the correlated equilibrium set is convex and compact, the structure of its extreme points can be quite complicated. In finite games the ratio of extreme correlated to extreme Nash equilibria can be greater than exponential in the size of the strategy spaces. In polynomial games there can exist extreme correlated equilibria which are not finitely supported; we construct a large family of examples using techniques from ergodic theory. We show that in general the set of correlated equilibrium distributions of a polynomial game cannot be described by conditions on finitely many moments (means, covariances, etc.), in marked contrast to the set of Nash equilibria which is always expressible in terms of finitely many moments.     

Monitoring cooperative equilibria in a stochastic differential game

This paper deals with a class of equilibria which are based on the use of memory strategies in the context of continuous-time stochastic differential games. In order to get interpretable results, we will focus the study on a stochastic differential game model of the exploitation of one species of fish by two competing fisheries. We explore the possibility of defining a so-called cooperative equilibrium, which will implement a fishing agreement. In order to obtain that equilibrium, one defines a monitoring variable and an associated retaliation scheme. Depending on the value of the monitoring variable, which provides some evidence of a deviation from the agreement, the probability increases that the mode of a game will change from a cooperative to a punitive one. Both the monitoring variable and the parameters of this jump process are design elements of the cooperative equilibrium. A cooperative equilibrium designed in this way is a solution concept for a switching diffusion game. We solve that game using the sufficient conditions for a feedback equilibrium which are given by a set of coupled HJB equations. A numerical analysis, approximating the solution of the HJB equations through an associated Markov game, enables us to show that there exist cooperative equilibria which dominate the classical feedback Nash equilibrium of the original diffusion game model.This research was supported by FNRS-Switzerland, NSERC-Canada, FCAR-Quebec.     

Hotelling’s location model with negative network externalities

We study a variation of Hotelling’s location model in which consumers choose between firms based on travel distances as well as the number of consumers visiting each firm. The model in which the network externality is the same for all firms was proposed by Kohlberg (Econ Lett 11:211–216, 1983), who claims that no equilibrium exists for more than two firms. We assume the network effects to be linear and, in contrast to the claim in Kohlberg (Econ Lett 11:211–216, 1983), derive a condition under which a subgame perfect Nash equilibrium exists for four and six firms. Moreover, we show that for more than two firms the equilibrium locations of the firms are different from the equilibrium locations in Hotelling’s location model. Our results suggest that a subgame perfect Nash equilibrium exists if and only if the number of firms is even. We also provide examples of subgame perfect equilibria in which the network externality is different for some of the firms.     

A Shared-Constraint Approach to Multi-Leader Multi-Follower Games

Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even local equilibria has proved challenging. Consequently, much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We consider a modified formulation in which every leader is cognizant of the equilibrium constraints of all leaders. Equilibria of this modified game contain the equilibria, if any, of the original game. The new formulation has a constraint structure called shared constraints, and our main result shows that if the leader objectives admit a potential function, the global minimizers of the potential function over this shared constraint are equilibria of the modified formulation. We provide another existence result using fixed point theory that does not require potentiality. Additionally, local minima, B-stationary, and strong-stationary points of this minimization problem are shown to be local Nash equilibria, Nash B-stationary, and Nash strong-stationary points of the corresponding multi-leader multi-follower game. We demonstrate the relationship between variational equilibria associated with this modified shared-constraint game and equilibria of the original game from the standpoint of the multiplier sets and show how equilibria of the original formulation may be recovered. We note through several examples that such potential multi-leader multi-follower games capture a breadth of application problems of interest and demonstrate our findings on a multi-leader multi-follower Cournot game.