A Stochastic Competitive Research and Development Race Where “Winner Takes All” with Lower and Upper Bounds

The paper analyzes an environment in which several firms compete over the development of a project. Each firm decides how much to invest in the project while adhering to firm-specific lower and upper investment bounds. The completion time of the project by a firm has exponential distribution with rate that depends linearly on the investment of the firm. The firm that completes the project first collects all its revenues whereas the remaining firms earn nothing. The paper establishes the existence and uniqueness of both the Nash equilibrium and the globally optimal solution, provides explicit representations parametrically in the interest rate, and constructs computationally efficient methods to solve these two problems. It also examines sensitivity of Nash equilibrium to marginal changes in lower and upper bounds.     

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.     

产出不确定条件下“公司+农户”型订单农业供应链协商模型研究

在农产品产出不确定性及零售价格受农产品产出率影响的条件下,研究了一类由风险规避农户和风险中性公司组成“公司+农户”型订单农业农产品供应链协调问题。在该农产品供应链中,农户和公司通过Nash协商谈判来分别决策最优的生产量和订单价格。研究结果表明,在农产品产出不确定及零售市场价格受农产品产出率影响的条件下,风险规避型农户和公司的Nash协商合作博弈存在均衡解。Nash协商谈判所达成的最优农产品产出量和订单价格均高于分散决策情形下的最优农产品产出量和订单价格。最优农产品产出量是关于农户风险规避度的单调增函数,而最优的订单价格是关于农户风险规避度的单调减函数。最后,通过与分散决策情形相比,证明了Nash协商谈判机制能够促使风险规避型农户和风险中性型公司均达到帕累托改进。     

Strategic Manipulation Approach for Solving Negotiated Transfer Pricing Problem

This paper suggests an approach for solving the transfer pricing problem, where negotiation between divisions is carried out considering the manipulation game theory model for a multidivisional firm. The manipulation equilibrium point is conceptualized under the Machiavellian social theory, represented by three concepts: views, tactics and immorality. In this approach, we are considering a non-cooperative model for the transfer pricing problem: a game model involving manipulating and manipulated players engaged cooperatively in a Nash game, restricted by a Stackelberg game. The cooperation is represented by the Nash bargaining solution. The transfer pricing problem is conceptualized as a strong Stackelberg game involving manipulating and manipulated divisions. This structure established conditions of unequal relative power among divisions, where high-power divisions tend to be abusive and less powerful divisions have a tendency to behave compliantly. For computation purposes, we transform the Stackelberg game model into a Nash game, where every division is able of manipulative behavior to some degree: the Nash game relaxes the interpretation of the manipulation game and the equilibrium selection for the transfer pricing problem. The manipulation dynamics and rationality proposed for the transfer pricing problem correspond to many real-world negotiation situations. We present an example, that illustrates how manipulation can be employed to solve the transfer pricing problem in a multidivisional firm.     

Lower semicontinuity for approximate social Nash equilibria

We introduce a suitable concept of approximate social Nash equilibrium and we determine sufficient conditions of minimal character which guarantee, for a parametric social Nash equilibrium problem, the lower semicontinuity of the set-valued function defined by these approximate solutions. Received: December 2001     

Nash implementation of competitive equilibria in the job-matching market

This paper studies Nash implementation in the job-matching market where each worker works for only one firm and a firm hires as many workers as it wishes. We show that the competitive equilibrium correspondence (CEC) is the smallest Nash implementable correspondence satisfying individual rationality and Pareto indifference. Furthermore, the CEC is the minimal monotonic extension of the worker-optimal and firm-optimal subcorrespondences. We offer two “good” mechanisms that implement this correspondence in Nash equilibrium.     

Nondominated Nash points: application of biobjective mixed integer programming

We study the connection between biobjective mixed integer linear programming and normal form games with two players. We first investigate computing Nash equilibria of normal form games with two players using single-objective mixed integer linear programming. Then, we define the concept of efficient (Pareto optimal) Nash equilibria. This concept is precisely equivalent to the concept of efficient solutions in multi-objective optimization, where the solutions are Nash equilibria. We prove that the set of all points in the payoff (or objective) space of a normal form game with two players corresponding to the utilities of players in an efficient Nash equilibrium, the so-called nondominated Nash points, is finite. We demonstrate that biobjective mixed integer linear programming, where the utility of each player is an objective function, can be used to compute the set of nondominated Nash points. Finally, we illustrate how the nondominated Nash points can be used to determine the disagreement point of a bargaining problem.     

Approximating Nash equilibrium for production control with sticky price

We study a mean field game problem arising from the production control for multiple firms with price stickiness in the commodity market. The price dynamics for each firm is described as a (controlled) jump-diffusion process with mean-field interaction. Each firm aims to maximize her expectation of cumulative net profit coupled with each other through price processes. By solving the limiting control problem and a fixed-point problem, we construct an explicit approximating Nash equilibrium when the number of firms grows large.     

Evolutionary Variational Formulation for Oligopolistic Market Equilibrium Problems with Production Excesses

The paper is devoted to generalize a previous model of the dynamic oligopolistic market equilibrium problem allowing the presence of production excesses and assuming, in a more reasonable way that the total amounts of commodity shipments from a firm to all the demand markets be upper bounded. First, we give equilibrium conditions in terms of the well-known dynamic Cournot–Nash equilibrium principle. Then we show that such conditions can be expressed in terms of Lagrange multipliers; namely, by means of an utility function, prove that both equilibrium conditions can be equivalently expressed by a variational inequality. The variational formulation allows us to provide existence theorems and qualitative properties for equilibrium solutions. At last, a numerical example illustrates the results obtained.     

Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems

Generalized Nash equilibrium problems (GNEPs) allow, in contrast to standard Nash equilibrium problems, a dependence of the strategy space of one player from the decisions of the other players. In this paper, we consider jointly convex GNEPs which form an important subclass of the general GNEPs. Based on a regularized Nikaido-Isoda function, we present two (nonsmooth) reformulations of this class of GNEPs, one reformulation being a constrained optimization problem and the other one being an unconstrained optimization problem. While most approaches in the literature compute only a so-called normalized Nash equilibrium, which is a subset of all solutions, our two approaches have the property that their minima characterize the set of all solutions of a GNEP. We also investigate the smoothness properties of our two optimization problems and show that both problems are continuous under a Slater-type condition and, in fact, piecewise continuously differentiable under the constant rank constraint qualification. Finally, we present some numerical results based on our unconstrained optimization reformulation.     

Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints

The equilibrium problem with equilibrium constraints (EPEC) can be looked on as a generalization of Nash equilibrium problem (NEP) and the mathematical program with equilibrium constraints (MPEC) whose constraints contain a parametric variational inequality or complementarity system. In this paper, we particularly consider a special class of EPECs where a common parametric P-matrix linear complementarity system is contained in all players?? strategy sets. After reformulating the EPEC as an equivalent nonsmooth NEP, we use a smoothing method to construct a sequence of smoothed NEPs that approximate the original problem. We consider two solution concepts, global Nash equilibrium and stationary Nash equilibrium, and establish some results about the convergence of approximate Nash equilibria. Moreover we show some illustrative numerical examples.     

Computing generalized Nash equilibria by polynomial programming

We present a new way to solve generalized Nash equilibrium problems. We assume the feasible set to be compact. Furthermore all functions are assumed to be polynomials. However we do not impose convexity on either the utility functions or the action sets. The key idea is to use Putinar’s Positivstellensatz, a representation result for positive polynomials, to replace each agent’s problem by a convex optimization problem. The Nash equilibria are then feasible solutions to a system of polynomial equations and inequalities. Our application is a model of the New Zealand electricity spot market with transmission losses based on a real dataset.     

Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality

We define the concept of reproducible map and show that, whenever the constraint map defining the quasivariational inequality (QVI) is reproducible then one can characterize the whole solution set of the QVI as a union of solution sets of some variational inequalities (VI). By exploiting this property, we give sufficient conditions to compute any solution of a generalized Nash equilibrium problem (GNEP) by solving a suitable VI. Finally, we define the class of pseudo-Nash equilibrium problems, which are (not necessarily convex) GNEPs whose solutions can be computed by solving suitable Nash equilibrium problems.     

Dynamics of competing with quality- and advertising-based goodwill

Goodwill formation is a complex process and many factors influence the formation of goodwill of a firm. The implications of advertising enabled goodwill formation are reported in several articles in the research literature. In this paper, we extend this stream of research by including quality in the goodwill formation process. We adopt a dynamic model of competition utilizing a differential game approach and derive expressions for open-loop Markovian Nash equilibrium investments in advertising and quality. The insights gained from the analysis of our model and from the equilibrium solutions are presented in the form of research propositions.     

运输问题的合作对策求解方法

产地间或销地间往往存在竞争,在这种情况下,使用运输问题最优化方法是不合理的。因此,从个体理性的视角提出运输问题的合作对策求解方法,方法将运输问题看作是一个博弈问题,各个产地或销地是博弈的局中人,求解其纳什均衡与纳什讨价还价解。在此基础上,说明了运输问题的非合作形式是一个指派问题,并证明指派问题的最优解是一个纳什均衡点。接着,通过实验验证运输问题的最优解是一个纳什讨价还价解,满足产地或销地的自身利益。在此基础上,针对纳什讨价还价解不唯一的问题,从决策者的视角给出最大可能激励成本的计算方法。最后,为弥补纳什讨价还价解不唯一及纳什讨价还价解不允许出现子联盟的缺陷,给出运输收益分配或成本分摊的Shapely值计算方法。     

Single facility location on a network under mill and delivered pricing

^** E-mail: pelegrin{at}um.es Firms normally use either a mill price or a delivered pricepolicy, depending on market conditions (type of good, transportationway, customers location, costs, etc). In this paper, the problemof selecting the best location for an entering firm in competitionwith some pre-existing firms, under each price policy, is studiedon a network for the first time. With mill pricing, an equilibriumin price rarely exists and it is assumed that all competingfirms set a common mill price for all customers. With deliveredpricing, there exists a Nash equilibrium in price and it isassumed that the equilibrium price in each area is offered tothe customers in that area. In both cases, we consider thatcustomers buy from the cheapest facility and the same rulesare used for tie breaking in the lowest cost. While the profitmaximization problem for the entering firm always has optimalsolutions under mill pricing, this problem might not have anoptimal solution under delivered pricing. We show some discretizationresults and give procedures to find the full set of optimal,or -optimal, solutions to the problem under the two price policies.A comparison of results with the two price policies is givenby using an illustrative example.     

Non-cooperative joint replenishment under asymmetric information

We consider jointly replenishing n ex-ante identical firms that operate under an EOQ like setting using a non-cooperative game under asymmetric information. In this game, each firm, upon being privately informed about its demand rate (or inventory cost rate), submits a private contribution to an intermediary that specifies how much it is willing to pay for its replenishment per unit of time and the intermediary determines the maximum feasible frequency for the joint orders that would finance the fixed replenishment cost. We show that a Bayesian Nash equilibrium exists and characterize the equilibrium in this game. We also show that the contributions are monotone increasing in each firm’s type. We finally conduct a numerical study to compare the equilibrium to solutions obtained under independent and cooperative ordering, and under full information. The results show that while information asymmetry eliminates free-riding in the contributions game, the resulting aggregate contributions are not as high as under full information, leading to higher aggregate costs.     

两阶段主从博弈均衡解的存在性

首先给出带参数的纳什均衡问题Γ(x),在此基础上给出了具有带参数的纳什均衡约束的两阶段主从博弈问题G.可以证明带参数的纳什均衡点是存在的,即无论领导者选择何种策略,跟随者的最佳回应集都是非空的.最后推出了关于两阶段主从博弈均衡点的存在性定理.     

求解一类广义Nash均衡问题

Generalized Nash equilibrium problem (GNEP) is an important model that has many applications in practice. However, a GNEP usually has multiple or even infinitely many Nash equilibrium points and it is not easy to choose a favorable solution from those equilibria. This paper considers a class of GNEP with some kind of separability. We first extend the so-called normalized equilibrium concept to the stationarity sense and then, we propose an approach to solve the normalized stationary points by reformulating the GNEP as a single optimization problem. We further demonstrate the proposed approach on a GNEP model in similar product markets.     

Duopoly competition in networks

This paper presents a new approach to modeling competition between firms in network-based industries, i.e. industries where the firms' technology decisions correspond to choices of networks. Industries having this structure include transportation, telecommunications, and some service industries. Competition is studied between two firms who make both network design decisions and price decisions for services. This situation is modeled as a game, an equilibrium solution corresponding to a Nash equilibrium is defined, and properties of the solution are characterized. Necessary and sufficient conditions are shown for equilibrium solutions and existence of equilibrium solutions is demonstrated. Among the results is that each firm will maximize its own profit by minimizing total industry cost of providing services. An example demonstrating results is presented.