Correlated equilibrium and concave games

This paper shows that if a game satisfies the sufficient condition for the existence and uniqueness of a pure-strategy Nash equilibrium provided by Rosen (Econometrica 33:520, 1965), then the game has a unique correlated equilibrium, which places probability one on the unique pure-strategy Nash equilibrium. In addition, it shows that a weaker condition suffices for the uniqueness of a correlated equilibrium. The condition generalizes the sufficient condition for the uniqueness of a correlated equilibrium provided by Neyman (Int J Game Theory 26:223, 1997) for a potential game with a strictly concave potential function. I thank the editor, an associate editor, and an anonymous referee for detailed comments and suggestions, which have substantially improved this paper. Special thanks are due to the referee for pointing out Lemmas 4 and 5. I acknowledge financial support by The Japan Economic Research Foundation and by MEXT, Grant-in-Aid for Scientific Research. All remaining errors are mine.     

Establishing Nash equilibrium of the manufacturer–supplier game in supply chain management

We study a game model of multi-leader and one-follower in supply chain optimization where n suppliers compete to provide a single product for a manufacturer. We regard the selling price of each supplier as a pre-determined parameter and consider the case that suppliers compete on the basis of delivery frequency to the manufacturer. Each supplier's profit depends not only on its own delivery frequency, but also on other suppliers' frequencies through their impact on manufacturer's purchase allocation to the suppliers. We first solve the follower's (manufacturer's) purchase allocation problem by deducing an explicit formula of its solution. We then formulate the n leaders' (suppliers') game as a generalized Nash game with shared constraints, which is theoretically difficult, but in our case could be solved numerically by converting to a regular variational inequality problem. For the special case that the selling prices of all suppliers are identical, we provide a sufficient and necessary condition for the existence and uniqueness of the Nash equilibrium. An explicit formula of the Nash equilibrium is obtained and its local uniqueness property is proved.     

Network capacity management under competition

We consider capacity management games between airlines who transport passengers over a joint airline network. Passengers are likely to purchase alternative tickets of the same class from competing airlines if they do not get tickets from their preferred airlines. We propose a Nash and a generalized Nash game model to address the competitive network revenue management problem. These two models are based on well-known deterministic linear programming and probabilistic nonlinear programming approximations for the non-competitive network capacity management problem. We prove the existence of a Nash equilibrium for both games and investigate the uniqueness of a Nash equilibrium for the Nash game. We provide some further uniqueness and comparative statics analysis when the network is reduced to a single-leg flight structure with two products. The comparative statics analysis reveals some useful insights on how Nash equilibrium booking limits change monotonically in the prices of products. Our numerical results indicate that airlines can generate higher and more stable revenues from a booking scheme that is based on the combination of the partitioned booking-limit policy and the generalized Nash game model. The results also show that this booking scheme is robust irrespective of which booking scheme the competitor takes.     

Variational Inequality Formulation of a Class of Multi-Leader-Follower Games

The multi-leader-follower game can be looked on as a generalization of the Nash equilibrium problem and the Stackelberg game, which contains several leaders and a number of followers. Recently, the multi-leader-follower game has been drawing more and more attention, for example, in electricity power markets. However, when we formulate a general multi-leader-follower game as a single-level game, it will give rise to a lot of problems, such as the lack of convexity and the failure of constraint qualifications. In this paper, to get rid of these difficulties, we focus on a class of multi-leader-follower games that satisfy some particular, but still reasonable assumptions, and show that these games can be formulated as ordinary Nash equilibrium problems, and then as variational inequalities. We establish some results on the existence and uniqueness of a leader-follower Nash equilibrium. We also present illustrative numerical examples from an electricity power market model.     

Equilibrium existence and uniqueness in network games with additive preferences

A directed network game of imperfect strategic substitutes with heterogeneous players is analyzed. We consider concave additive separable utility functions that encompass the quasi-linear ones. It is found that pure strategy Nash equilibria verify a non-linear complementarity problem. By requiring appropriate concavity in the utility functions, the existence of an equilibrium point is shown and equilibrium uniqueness is established with a P-matrix. For this reason, it appears that previous findings on network structure and sparsity hold for many more games.     

Nash bargaining solution under externalities

We define a Nash bargaining solution (NBS) of partition function games. Based on a partition function game, we define an extensive game, which is a propose–respond sequential bargaining game where the rejecter of a proposal exits from the game with some positive probability. We show that the NBS is supported as the expected payoff profile of any stationary subgame perfect equilibrium (SSPE) of the extensive game such that in any subgame, a coalition of all active players forms immediately. We provide a necessary and sufficient condition for such an SSPE to exist. Moreover, we consider extensions to the cases of nontransferable utilities, time discounting and multiple-coalition formation.     

Mean-field type forward-backward doubly stochastic differential equations and related stochastic differential games

We study a kind of partial information non-zero sum differential games of mean-field backward doubly stochastic differential equations, in which the coefficient contains not only the state process but also its marginal distribution, and the cost functional is also of mean-field type. It is required that the control is adapted to a sub-filtration of the filtration generated by the underlying Brownian motions. We establish a necessary condition in the form of maximum principle and a verification theorem, which is a sufficient condition for Nash equilibrium point. We use the theoretical results to deal with a partial information linear-quadratic (LQ) game, and obtain the unique Nash equilibrium point for our LQ game problem by virtue of the unique solvability of mean-field forward-backward doubly stochastic differential equation.     

On variational inequality approach to nash dynamic game of oil stockpiling ∗

Oil market disruption and strategic stockpiling are consideredin this work. A variational inequality approach is developed.The model treated here is more general than previous work.It is established that the Nash equilibrium is characterized by a system of inequalities. A sufficient condition for the existence and uniqueness of the Nash equilibrium is derived and an efficient iterative algorithm is proposed and analyzed     

Forward-backward stochastic differential equation games with delay and noisy memory

Abstract

The goal of this paper is to study a stochastic game connected to a system of forward-backward stochastic differential equations (FBSDEs) involving delay and noisy memory. We derive sufficient and necessary maximum principles for a set of controls for the players to be a Nash equilibrium in the game. Furthermore, we study a corresponding FBSDE involving Malliavin derivatives. This kind of equation has not been studied before. The maximum principles give conditions for determining the Nash equilibrium of the game. We use this to derive a closed form Nash equilibrium for an economic model where the players maximize their consumption with respect to recursive utility.     

分布参数最优控制的边界元共轭梯度算法

研究了一类线性椭圆型分布参数最优控制问题的数值解算法.得到最优控制对应的最优性方程组,在凸性条件下,证明了最优控制的唯一存在性问题.将最优控制问题化为以控制函数和状态函数为局中人的递阶式(Stackelberg)非合作对策问题,其平衡点是最优控制的解.进一步得到求平衡点的边界元共轭梯度算法.最后,研究算法中边界元离散的误差估计,以算例验证该算法.     

Dynamic consistency in incomplete information games under ambiguity

We develop a general framework of incomplete information games under ambiguity which extends the traditional framework of Bayesian games to the context of Ellsberg-type ambiguity. We then propose new solution concepts called ex ante and interim Γ-maximin equilibrium for solving such games. We show that, unlike the standard notion of Bayesian Nash equilibrium, these concepts may lead to rather different recommendations for the same game under ambiguity. This phenomenon is often referred to as dynamic inconsistency. Moreover, we characterize the sufficient condition under which dynamic consistency is assured in this generalized framework.     

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.     

Switching defence for switched systems under malicious attacks: A Stackelberg game approach

The security issue of switched systems is researched from a noncooperative dynamic game-theoretic perspective in this paper. A Stackelberg game is developed for the switched autonomous system suffering malicious attacks, and the Stackelberg equilibrium switching and attack strategies are constructed respectively. Afterwards, the proposed game-theoretic approach is extended to switched control systems. A Stackelberg Nash game is consequently established to characterize the hierarchical decision making processes, where the controller and the attacker are the followers who simultaneously make their own decisions, and a sufficient condition is provided for the construction of the Stackelberg Nash equilibrium. Finally, a continuous stirred tank reactor is exploited to validate the effectiveness and applicability of the proposed results.     

Necessary and Sufficient Conditions for Feedback Nash Equilibria for the Affine-Quadratic Differential Game

In this note, we consider the non-cooperative linear feedback Nash quadratic differential game with an infinite planning horizon. The performance function is assumed to be indefinite and the underlying system affine. We derive both necessary and sufficient conditions under which this game has a Nash equilibrium. As a special case, we derive existence conditions for the multi-player zero-sum game.     

Finding all pure strategy Nash equilibria in a planar location game

In this paper, we deal with a planar location-price game where firms first select their locations and then set delivered prices in order to maximize their profits. If firms set the equilibrium prices in the second stage, the game is reduced to a location game for which pure strategy Nash equilibria are studied assuming that the marginal delivered cost is proportional to the distance between the customer and the facility from which it is served. We present characterizations of local and global Nash equilibria. Then an algorithm is shown in order to find all possible Nash equilibrium pairs of locations. The minimization of the social cost leads to a Nash equilibrium. An example shows that there may exist multiple Nash equilibria which are not minimizers of the social cost.     

On the Tikhonov Well-Posedness of Concave Games and Cournot Oligopoly Games

The purpose of this paper is to investigate whether theorems known to guarantee the existence and uniqueness of Nash equilibria, provide also sufficient conditions for the Tikhonov well-posedness (T-wp). We consider several hypotheses that ensure the existence and uniqueness of a Nash equilibrium (NE), such as strong positivity of the Jacobian of the utility function derivatives (Ref. 1), pseudoconcavity, and strict diagonal dominance of the Jacobian of the best reply functions in implicit form (Ref. 2). The aforesaid assumptions imply the existence and uniqueness of NE. We show that the hypotheses in Ref. 2 guarantee also the T-wp property of the Nash equilibrium.As far as the hypotheses in Ref. 1 are concerned, the result is true for quadratic games and zero-sum games. A standard way to prove the T-wp property is to show that the sets of -equilibria are compact. This last approach is used to demonstrate directly the T-wp property for the Cournot oligopoly model given in Ref. 3. The compactness of -equilibria is related also to the condition that the best reply surfaces do not approach each other near infinity.     

On time-inconsistent stopping problems and mixed strategy stopping times

A game-theoretic framework for time-inconsistent stopping problems where the time-inconsistency is due to the consideration of a non-linear function of an expected reward is developed. A class of mixed strategy stopping times that allows the agents in the game to jointly choose the intensity function of a Cox process is introduced and motivated. A subgame perfect Nash equilibrium is defined. The equilibrium is characterized and other necessary and sufficient equilibrium conditions including a smooth fit result are proved. Existence and uniqueness are investigated. A mean–variance and a variance problem are studied. The state process is a general one-dimensional Itô diffusion.     

一种n人静态博弈纯策略纳什均衡存在性判别法

本首先给出了n人静态博弈纯策略纳什均衡存在的充要条件。然后给出n人静态博弈纯策略纳什均衡存在性的一种判别方法。最后在判别纯策略纳什均衡存在的条件下，给出判定该静态博弈存在多少纯策略纳什均衡以及哪些纯策略组合是纯策略纳什均衡(解)的方法。     

On the uniqueness of Cournot equilibrium in case of concave integrated price flexibility

We consider a class of homogeneous Cournot oligopolies with concave integrated price flexibility and convex cost functions. We provide new results about the semi-uniqueness and uniqueness of (Cournot) equilibria for the oligopolies that satisfy these conditions. The condition of concave integrated price flexibility is implied by (but does not imply) the log-concavity of a continuous decreasing price function. So, our results generalize previous results for decreasing log-concave price functions and convex cost functions. We also discuss the particular type of quasi-concavity that characterizes the conditional revenue and profit functions of the firms in these oligopolies and we point out an error of the literature on the equilibrium uniqueness in oligopolies with log-concave price functions. Finally, we explain how the condition of concave integrated price flexibility relates to other conditions on the price and aggregate revenue functions usually considered in the literature, e.g., their concavity.