Identification of classes of differential games for which the open loop is a degenerate feedback Nash equilibrium

In general, it is clear that open-loop Nash equilibrium and feedback Nash equilibrium do not coincide. In this paper, we study the structure of differential games and develop a technique using which we can identify classes of games for which the open-loop Nash equilibrium is a degenerate feedback equilibrium. This technique clarifies the relationship between the assumptions made on the structure of the game and the resultant equilibrium.The author would like to thank E. Dockner, A. Mehlmann, and an anonymous referee for helpful comments.     

Optimal allocation of drug control efforts: A differential game analysis

The present paper considers a dynamic nonzero-sum game between drug dealers and the authorities. Although the game is neither linear-quadratic nor degenerate, in the sense that the closed-loop equilibria coincide with the open-loop equilibria, we are able to calculate explicitly a stationary feedback Nash equilibrium of that game. In a numerical example, we determine the optimal allocation of governmental efforts between treatment and law enforcement minimizing the total discounted cost stream in the equilibrium. Moreover, we provide sensitivity analyses with respect to the efficiency parameters of both competitors. Our results show that a farsighted authority should attack the drug problem from the demand side and put much effort in treatment measures and the improvement of the efficiency of the treatment.This research was supported by the Austrian Science Foundation under Contract P9112-SOZ. We would like to thank A. Luhmer and E. J. Dockner for helpful comments.     

Coordinate Transformations and Derivation of Open-Loop Nash Equilibria

Leitmann (Ref. 1) introduced coordinate transformations to derive global optima of a class of dynamic optimization problems. We present applications of this method to derive open-loop Nash equilibria for finite-time horizon differential games. The method of coordinate transformations is especially useful in cases where the original game does not satisfy the global curvature conditions normally imposed in sufficient optimality conditions.     

Tractable classes of nonzero-sum open-loop Nash differential games: Theory and examples

This paper identifies some classes ofN-person nonzero-sum differential games that are tractable, in the sense that open-loop Nash strategies can be determined, either explicitly or qualitatively in terms of a phase-diagram portrait. The classes are characterized by conditions imposed on the Hamiltonians. Also, the underlying game structures needed to satisfy these conditions are characterized.The authors wish to thank V. Kaitala, Helsinki University of Technology, and the referees.     

Absolutely expedient algorithms for learning Nash equilibria

This paper considers a multi-person discrete game with random payoffs. The distribution of the random payoff is unknown to the players and further none of the players know the strategies or the actual moves of other players. A class of absolutely expedient learning algorithms for the game based on a decentralised team of Learning Automata is presented. These algorithms correspond, in some sense, to rational behaviour on the part of the players. All stable stationary points of the algorithm are shown to be Nash equilibria for the game. It is also shown that under some additional constraints on the game, the team will always converge to a Nash equilibrium. Dedicated to the memory of Professor K G Ramanathan     

Static and dynamic best-response potential functions for the non-linear Cournot game

We show that the Cournot oligopoly game with non-linear market demand can be reformulated as a best-response potential game where the best-response potential function is linear-quadratic in the special case where marginal cost is normalized to zero. We also propose a new approach to show that the open-loop differential game with Ramsey dynamics admits a best-response Hamiltonian potential corresponding to the sum of the best-response potential function of the static game plus the scalar product of transition functions multiplied by the fictitious costate variables. Unlike the original differential game, its best-response representation yields the map of the instantaneous best reply functions.     

On the probability of existence of pure equilibria in matrix games

We examine the probability that a randomly chosen matrix game admits pure equilibria and its behavior as the number of actions of the players or the number of players increases. We show that, for zero-sum games, the probability of having pure equilibria goes to zero as the number of actions goes to infinity, but it goes to a nonzero constant for a two-player game. For many-player games, if the number of players goes to infinity, the probability of existence of pure equilibria goes to zero even if the number of actions does not go to infinity.This research was supported in part by NSF Grant CCR-92-22734.     

On a class of nonzero-sum,linear-quadratic differential games

A class of two-player, nonzero-sum, linear-quadratic differential games is investigated for Nash equilibrium solutions when both players use closed-loop control and when one or both of the players are required to use open-loop control. For three formulations of the game, necessary and sufficient conditions are obtained for a particular strategy set to be a Nash equilibrium strategy set. For a fourth formulation of the game, where both players use open-loop control, necessary and sufficient conditions for the existence of a Nash equilibrium strategy set are developed. Several examples are presented in order to illustrate the differences between this class of differential games and its zero-sum analog.This research was supported by the National Science Foundation under Grant No. GK-3341.     

Discounted and finitely repeated minority games with public signals

We consider a repeated game where at each stage players simultaneously choose one of the two rooms. The players who choose the less crowded room are rewarded with one euro. The players in the same room do not recognize each other, and between the stages only the current majority room is publicly announced, hence the game has imperfect public monitoring. An undiscounted version of this game was considered by Renault et al. [Renault, J., Scarlatti, S., Scarsini, M., 2005. A folk theorem for minority games. Games Econom. Behav. 53 (2), 208–230], who proved a folk theorem. Here we consider a discounted version and a finitely repeated version of the game, and we strengthen our previous result by showing that the set of equilibrium payoffs Hausdorff-converges to the feasible set as either the discount factor goes to one or the number of repetition goes to infinity. We show that the set of public equilibria for this game is strictly smaller than the set of private equilibria.     

The Concept of Proper Solution in Linear Programming

In this paper, we study the optimal solutions of a dual pair of linear programming problems that correspond to the proper equilibria of their associated matrix game. We give conditions ensuring the existence of such solutions, show that they are especially robust under perturbation of right-hand-side terms, and describe a procedure to obtain them.     

Research and Development with Stock-Dependent Spillovers and Price Competition in a Duopoly

This paper investigates the research and development accumulation and pricing strategies of two firms competing for consumer demand in a dynamic framework. A firm’s research and development is production-cost-reducing and can benefit from part of the competitor’s research and development stock without payment. We consider decisions in a game characterized by Nash equilibrium. In this dynamic game, a player’s action depends on whether the competitor’s current research and development stock are observable. If the competitor’s current research and development stock are not observable or observable only after a certain time lag, a player’s action can be solely based on the information on the current period t (open-loop strategy). In the converse case, it can also include the information on the competitor’s reaction to a change in the current value of the state vector (closed-loop strategy), which allows for strategic interaction to take place throughout the game. Given the cumulative nature of research and development activities, a primary goal of this paper is to determine whether, regardless of the observability of the competitor’s current research and development stock, free research and development spillovers generate a lower level of scientific knowledge than research and development appropriability. A second objective of the paper is to determine how the observability of the rival’s current research and development stock affects a firm’s research and development and pricing decisions and payoffs under imperfect research and development appropriability.     

Algorithms for computing Nash equilibria in deterministic LQ games

In this paper we review a number of algorithms to compute Nash equilibria in deterministic linear quadratic differential games. We will review the open-loop and feedback information case. In both cases we address both the finite and the infinite-planning horizon.     

Carbon capture and storage and transboundary pollution: A differential game approach

We study the strategic behavior of two countries facing transboundary CO₂ pollution under a differential game setting. In our model, the reduction of CO₂ concentration occurs through the carbon capture and storage process, rather than through the adoption of cleaner technologies. Furthermore, we first provide the explicit short-run dynamics for this dynamic game with symmetric open-loop and a special Markovian Nash strategy. Then, we compare these strategies at the games’ steady states and along some balanced growth paths. Our results show that if the initial level of CO₂ is relatively high, state dependent emissions reductions can lead to higher overall environmental quality, hence, feedback strategy leads to less social waste.     

Separable and low-rank continuous games

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in separable games. We show that these games admit finitely supported Nash equilibria. Motivated by the bounds on the supports of mixed equilibria in two-player finite games in terms of the ranks of the payoff matrices, we define the notion of the rank of an n-player continuous game and use this to provide bounds on the cardinality of the support of equilibrium strategies. We present a general characterization theorem that states that a continuous game has finite rank if and only if it is separable. Using our rank results, we present an efficient algorithm for computing approximate equilibria of two-player separable games with fixed strategy spaces in time polynomial in the rank of the game. This research was funded in part by National Science Foundation grants DMI-0545910 and ECCS-0621922 and AFOSR MURI subaward 2003-07688-1.     

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.     

Maximal stable sets of two-player games

If a connected component of perfect equilibria of a two-player game contains a stable set as defined by Mertens, then the component is itself stable. Thus the stable sets maximal under inclusion are connected components of perfect equilibria. Received: October 1999/Revised: February 2001     

The Leitmann-Schmitendorf advertising game with n players and time discounting

The extension of the Leitmann-Schmitendorf advertising game to n players and positive time discounting is investigated. We show that the strong time consistency of the open-loop Nash equilibrium is preserved. As to optimal controls, while the boundary solution is unaffected by the number of firms as well as discounting, the inner solution depends on industry structure. The fully symmetric version of the game allows us to identify the parameter regions wherein both solutions are sustainable.     

A class of differential games for which the closed-loop and open-loop Nash equilibria coincide

It is well known that, in general, Nash equilibria in open-loop strategies do not coincide with those in closed-loop strategies. This note identifies a class of differential games in which the Nash equilibrium in closed-loop strategies is degenerate, in the sense that it depends on time only. Consequently, the closed-loop equilibrium is also an equilibrium in open-loop strategies.The helpful comments of Professors Y. C. Ho, G. Leitmann, H. Y. Wan, Jr., and an anonymous referee are gratefully acknowledged.     

“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