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.     

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.     

Capacity reservation contracts for high-tech industry

Capacity reservation provides a risk-sharing mechanism that encourages a manufacturer to expand its capacity more. We propose a deductible reservation (DR) contract where customers reserve future capacity with a fee that is deductible from the purchasing price. The manufacturer’s ex ante announcement of the “excess” capacity that she will have in addition to the reservation amount is a unique feature of the DR contract. An individually rational DR contract that provides channel coordination always exists. Since there is a unique Nash equilibrium for the reservation game among multiple customers, the main results of the one-customer case can be extended to the n-customer case. The DR contract is compared with another capacity reservation contract called take-or-pay. While the manufacturer may gain more profit under a take-or-pay contract, there may not be a channel-coordinated contract that is also individually rational for the customer. Finally, the similarities and differences between the capacity reservation contracts and other well-known supply contracts are discussed.     

在消费者偏好不确定下双寡头定位定价博弈

本文通过建立在企业对消费者偏好信息不确定情形下,双寡头企业动态定位、定价博弈模型,研究企业的定位策略、定价策略以及产品差异化问题。证明了该动态博弈存在唯一的子博弈精炼均衡。均衡结果表明,偏好不确定性是一种差异化力量,与消费者偏好信息确定情形相比,企业的不确定性能够提高均衡价格、增加均衡利润。最后,分析了偏好不确定性对社会最优定位和社会最优差异化的影响。     

Intertemporal service pricing with strategic customers

We study a two-period intertemporal pricing game in a single-server service system with forward-looking strategic customers who make their purchase decision based on current information and anticipated future gains. Subgame perfect Nash equilibrium (SPNE) prices are derived. A comparison between revenue-maximizing equilibrium prices and welfare-maximizing equilibrium prices is conducted and the impact on the system’s performance of misunderstanding customers’ type is evaluated.     

竞争情形下服务商质量保证策略研究

质量保证策略是服务商获取竞争力的重要手段之一。本文在考虑服务商及其竞争对手的质量承诺水平和质量承诺补偿对其服务需求影响的基础上,构建了质量承诺水平、质量承诺补偿、质量承诺水平和质量承诺补偿三种竞争情形下的博弈模型,并系统分析了不同模型下的质量保证策略。研究发现:一旦有服务商提高质量承诺水平或质量承诺补偿,在质量承诺水平竞争模型下,其他服务商可适当地降低质量承诺水平,而在质量承诺补偿竞争模型下,其他服务商会同时提高质量承诺补偿。此外,在质量承诺水平和质量承诺补偿竞争模型下,若质量承诺水平的成本系数满足一定条件,各个服务商之间会存在纳什均衡。本文对服务市场竞争情形下服务商质量保证策略的制定具有一定的实践意义。     

Game Theoretic Analysis of a Distribution System with Customer Market Search

Consider a distribution system with one supplier and two retailers. When a stockout occurs at one retailer customers may go to the other retailer. We study a single period model in which the supplier may have infinite or finite capacity. In the latter case, if the total quantity ordered (claimed) by the retailers exceeds the supplier’s capacity, an allocation policy is involved to assign the limited capacity to the retailers. We analyze the inventory control decisions for the retailers using a game theoretical approach. The necessary and sufficient conditions are derived for the existence of a unique Nash equilibrium. A computational procedure is also proposed to calculate the Nash equilibrium. In case the Nash equilibrium does not exist, we use the concept of Stackelberg game to develop optimal strategies for both the leader and the follower. The work was partially supported by the National Textile Center of the US Department of Commerce under Grant No. I01-S01. The second author is supported in part by NSF under DMI-0196084 and DMI-0200306.     

On the equivalence of quantity competition and supply function competition with sunk costs

This paper considers competition in supply functions in a homogeneous goods market in the absence of cost or demand uncertainty. In order to commit to a supply schedule, firms are required to build sufficient capacity to produce any quantity that may be prescribed by that schedule. When the cost of extra capacity (given the level of sales) is strictly positive, any Nash equilibrium outcome of supply function competition is also a Nash equilibrium outcome of the corresponding Cournot game, and vice-versa. Conversely, when the cost-savings from reducing output (given the capacity level) are sufficiently small, any outcome of iterated elimination of weakly dominated strategies in the supply function game is also an outcome of the same process in Cournot, and vice-versa.     

A Cournot–Nash–Bertrand game theory model of a service-oriented Internet with price and quality competition among network transport providers

This paper develops a game theory model of a service-oriented Internet in which profit-maximizing service providers provide substitutable (but not identical) services and compete with the quantities of services in a Cournot–Nash manner, whereas the network transport providers, which transport the services to the users at the demand markets, and are also profit-maximizers, compete with prices in Bertrand fashion and on quality. The consumers respond to the composition of service and network provision through the demand price functions, which are both quantity and quality dependent. We derive the governing equilibrium conditions of the integrated game and show that it satisfies a variational inequality problem. We then describe the underlying dynamics, and provide some qualitative properties, including stability analysis. The proposed algorithmic scheme tracks, in discrete-time, the dynamic evolution of the service volumes, quality levels, and the prices until an approximation of a stationary point (within the desired convergence tolerance) is achieved. Numerical examples demonstrate the modeling and computational framework.     

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.     

Nash game model for optimizing market strategies,configuration of platform products in a Vendor Managed Inventory (VMI) supply chain for a product family

This paper discusses how a manufacturer and its retailers interact with each other to optimize their product marketing strategies, platform product configuration and inventory policies in a VMI (Vendor Managed Inventory) supply chain. The manufacturer procures raw materials from multiple suppliers to produce a family of products sold to multiple retailers. Multiple types of products are substitutable each other to end customers. The manufacturer makes its decision on raw materials’ procurement, platform product configuration, product replenishment policies to retailers with VMI, price discount rate, and advertising investment to maximize its profit. Retailers in turn consider the optimal local advertising investments and retail prices to maximize their profits. This problem is modeled as a dual simultaneous non-cooperative game (as a dual Nash game) model with two sub-games. One is between the retailers serving in competing retail markets and the other is between the manufacturer and the retailers. This paper combines analytical, iterative and GA (genetic algorithm) methods to develop a game solution algorithm to find the Nash equilibrium. A numerical example is conducted to test the proposed model and algorithm, and gain managerial implications.     

Optimal revenue management in two class pre-emptive delay dependent Markovian queues

In this paper, we present a comparative study on the total revenue generated with pre-emptive and non pre-emptive priority scheduler for a fairly generic problem of pricing the server’s surplus capacity in a single server Markovian queue. The specific problem is to optimally price the server’s surplus capacity by introducing a new class of customers (secondary class) without affecting the pre-specified service level of its current customers (primary class) when pre-emption is allowed. Pre-emptive scheduling is used in various applications. First, a finite step algorithm is proposed to obtain global optimal operating and pricing parameters for this problem. These optimal operating and pricing parameters constitute a unique Nash equilibrium in a certain two player non cooperative game. We then describe the range of service level where pre-emptive scheduling gives feasible solution and generates some revenue while non pre-emptive scheduling has infeasible solution. Further, some complementary conditions are identified to compare revenue analytically for certain range of service level where strict priority to secondary class is optimal. Our computational examples show that the complementary conditions adjust in such a way that pre-emptive scheduling always generates more revenue. Theoretical analysis is found to be intractable for the range of service level when pure dynamic policy is optimal. Hence, extensive numerical examples are presented to describe different instances. It is noted in numerical examples that pre-emptive scheduling generates at least as much revenue as non pre-emptive scheduling. A certain range of service level is identified where improvement in revenue is quite significant.     

Pricing and advertisement in a manufacturer–retailer supply chain

We use a game theoretical approach to study pricing and advertisement decisions in a manufacturer–retailer supply chain when price discounts are offered by both the manufacturer and retailer. When the manufacturer is the leader of the game, we obtained Stackelberg equilibrium with manufacturer’s local allowance, national brand name investment, manufacturer’s preferred price discount, retailer’s price discount, and local advertising expense. For the special case of two-stage equilibrium when the manufacturer’s price discount is exogenous, we found that the retailer is willing to increase local advertising expense if the manufacturer increases local advertising allowance and provides deeper price discount, or if the manufacturer decreases its brand name investment. When both the manufacturer and retailer have power, Nash equilibrium in a competition game is obtained. The comparison between the Nash equilibrium and Stackelberg equilibrium shows that the manufacturer always prefers Stackelberg equilibrium, but there is no definitive conclusion for the retailer. The bargaining power can be used to determine the profit sharing between the manufacturer and the retailer. Once the profit sharing is determined, we suggest a simple contract to help the manufacturer and retailer obtain their desired profit sharing.     

闭环供应链竞争的博弈分析与链内协调合同设计

假定生产商委托零售商回收废旧产品以进行再制造活动,研究两条分别由单生产商和单零售商组成的闭环供应链的竞争和链内协调。对应两条闭环供应链均为分散式供应链、均为集中式供应链、一条为分散式供应链另一条为集中式供应链,运用博弈论和均衡分析方法分别建立了三种情况下刻画闭环供应链竞争的带均衡约束的均衡模型、纳什均衡模型和带均衡约束的优化模型,进行了模型求解。基于合同理论,提出供应链竞争下协调链内零售商的零售价和回收价格决策的批发价加回收补贴合同。最后的算例验证了模型的合理性和协调合同的有效性。研究表明:产品零售价、需求量与产品替代效应正相关,废旧产品供给量、供应链利润与回收价格敏感性正相关;供应链协调是供应链竞争下的占优策略,有利于提高供应链的运作效率,但两条协调供应链之间的竞争将更激烈,存在囚徒困境现象。     

Competitive capacity expansion under demand uncertainty

We analyze the capacity expansion behavior of firms in a duopoly faced with an uncertain new market. The market demand may be high or low with a given probability mass function. Firms obtain private information about the market size and build their capacity before the market demand is known. Once the demand is revealed, firms enter a capacity constrained price competition phase which determines their revenues. Two scenarios are considered: first, when firms choose their capacities simultaneously in the investment phase, and second, when they do so sequentially. For each case, we determine the unique symmetric Nash equilibrium. Excess capacity can occur in equilibrium in the industry. It is seen that preempting the competitor in the capacity expansion phase offers first mover benefits. We argue that the sequential moves game is more prone to equilibrium excess capacity compared to the simultaneous case. We show that preemption is a good strategy if the investing environment is either highly optimistic or highly pessimistic. If the industry outlook is only moderately optimistic, a capacity planner is still better off preempting his competitor, however, the industry may encounter overcapacity as a consequence.     

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.     

Option pricing for large agents

This paper considers arbitrage-free option pricing in the presence of large agents. These large agents have a significant market power, and their trading strategies influence the dynamics of the financial asset prices. First, a simple asset pricing model in the presence of large agents is presented. Then a nonlinear partial differential equation is found for the prices of European options in the model. The unit option price depends on the large agent's asset holdings. Finally, a game model is introduced for the interaction between different market players. In this game, the outstanding number of options, as well as the option price, is found as a Nash equilibrium.     

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.     

Capacity competition of make-to-order firms

Two make-to-order firms, each modelled as a single-server queue, compete for a common stream of (potential) customers by setting their service capacities (rates) and service prices. Each customer maximizes her expected return by getting service from a firm or by balking. We completely characterize the Nash equilibrium of the competition.