随机需求下三度价格歧视重复博弈的研究

基于随机需求函数,讨论了相互竞争的两厂商实施三度价格歧视无限次重复博弈和不定次重复博弈的均衡分析,在三度价格歧视无限次重复博弈分析中,得出了两厂商在贴现因子影响下的子博弈完美纳什均衡.在三度价格歧视不定次重复博弈分析中,设计了不同的方案并进行了Matlab仿真,比较了不同贴现因子下不同仿真方案的厂商得益,并对仿真结果进行了系统分析,得到了统计意义下的均衡分析.     

A Stackelberg game and its improvement in a VMI system with a manufacturing vendor

Vendor managed inventory (VMI) is an inventory management strategy to let a vendor manage his retailers’ inventories, which makes the vendor have the opportunity to obtain some inventory and market-related information of his retailers. This paper discusses how the vendor can take advantage of this information for increasing his own profit by using a Stackelberg game in a VMI system. The vendor here is a manufacturer who procures raw materials to produce a finished product and supplies it at the same wholesale price to multiple retailers. The retailers then sell the product in independent markets at retail prices. Solution procedures are developed to find the Stackelberg game equilibrium that each enterprise is not willing to deviate from for maximizing his own profit. The equilibrium makes the manufacturer benefited, and the retailers’ profits maximized. The equilibrium can then be improved for further benefiting the manufacturer and his retailers if the retailers are willing to cooperate with the manufacturer by using a cooperative contract. Finally, a numerical example and the corresponding sensitivity analysis are given to illustrate that: (1) the manufacturer can benefit from his leadership, and monopolize the added profit of the VMI system in some cases; (2) The manufacturer can further improve his own profit, and then the retailers’ profits by the cooperative contract, as compared to the Stackelberg equilibrium; (3) market and raw material related parameters have significant influence on every enterprise’s net profit.     

A collaborative decentralized distribution system with demand forecast updates

In this paper, we study inventory pooling coalitions within a decentralized distribution system consisting of a manufacturer, a warehouse (or an integration center), and n retailers. At the time their orders are placed, the retailers know their demand distribution but do not know the exact value of the demand. After certain production and transportation lead time elapses, the orders arrive at the warehouse. During this time, the retailers can update their demand forecasts.We first focus on cooperation among the retailers - the retailers coordinate their initial orders and can reallocate their orders in the warehouse after they receive more information about their demand and update their demand forecasts. We study two types of cooperation: forecast sharing and joint forecasting. By using an example, we illustrate how forecast sharing collaboration might worsen performance, and asymmetric forecasting capabilities of the retailers might harm the cooperation. However, this does not happen if the retailers possess symmetric forecasting capabilities or they cooperate by joint forecasting, and the associated cooperative games have non-empty cores.Finally, we analyze the impact that cooperation and non-cooperation of the retailers has on the manufacturer’s profit. We focus on coordination of the entire supply chain through a three-parameter buyback contract. We show that our three-parameter contract can coordinate the system if the retailers have symmetric margins. Moreover, under such a contract the manufacturer benefits from retailers’ cooperation since he can get a share of improved performance.     

Non-cooperative n-person game with a stopped set

A continuous time non-cooperative n-person Markov game with a stopped set is studied in this paper. We prove that, in the game process with or without discount factor, there exists an optimal stationary point of strategies, called the equilibrium point, and each player has his equilibrium stationary strategy, such that the total expected discounted or non-discounted gain are maximums.     

Coordinating ordering and pricing decisions in a two-stage distribution system with price-sensitive demand through short-term discounting

We consider a short-term discounting model in which the distributor offers a discounted price for the retailers’ orders placed at the beginning of its replenishment cycle, in a non-cooperative distribution system with one distributor and multiple retailers, each facing price-sensitive demand. We examine the value of the price discount strategy as a mechanism for the distributor to coordinate the retailers’ ordering and pricing decisions under two common types of demand, linear demand in price and constant elasticity demand in price. Our numerical study reveals that, in the presence of homogeneous retailers (namely, retailers with identical demand rates), the distributor’s profit improvement due to coordination generally decreases as the number of retailers or the inventory holding cost rate increases, but increases as price elasticity increases. Although an increase in the inventory holding cost rate has a negative effect on the distributor’s profit, it may have a positive effect on the retailers’ profits. We further find that with heterogeneous retailers (namely, retailers with different demand rates), offering a discounted price under linear demand benefits the distributor when both the inventory holding cost rate and the variation in demand are either small or large. This cross effect, however, is absent under constant elasticity demand.     

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.     

Stability and monotonicity in newsvendor situations

This study considers a supply chain that consists of n retailers, each of them facing a newsvendor problem, and a supplier. Groups of retailers might increase their expected joint profit by joint ordering and inventory centralization. However, we assume that the retailers impose some level of stock that should be dedicated to them. In this situation, we show that the associated cooperative game has a non-empty core. Afterwards, we concentrate on a dynamic situation, where several model cost parameters and the retailers’ dedicated stock levels can change. We investigate how the profit division might be affected by these changes. We focus on four monotonicity properties. We identify several classes of games with retailers, where some of the monotonicity properties hold. Moreover, we show that pairs of cooperative games associated with newsvendor situations do not necessarily satisfy these properties in general, when changes in dedicated stock levels are in concern.     

Game theoretical treatment of material accountability problems Part II

In a previous paper, the optimal strategy for an inspection authority which has to safeguard material on the basis of material accountability principles has been determined with game theoretical methods: Sets of reasonable inspection and diversion strategies have been defined, and a saddlepoint of the overall probability of detection forn inventory periods during the reference time under consideration has been determined. In this paper it is shown that, with respect to the probability of detection, performing a single inventory is superior to performing a multiple inventory. A justification is given for the use of multiple inventories when the detection time is also concerned.     

Inventory model for deteriorating items with freshness and price dependent demand: Optimal discounting and ordering policies

A major part of retail industry deals with items whose freshness declines with time, resulting in lower demand at the same price. The item may later begin to deteriorate, when it is customary to offer discount in order to boost sales. A discounting policy may bring many benefits for the retailer, if correctly chosen. Motivated by this we have developed and analyzed an inventory model when demand for a deteriorating item depends initially only upon its selling price and later also on the freshness condition. We consider general demand function and general deterioration distribution for an inventory model with lost sales shortage. It is shown that net profit is a concave function of the period with positive inventory and conditionally concave function of discount. Important managerial insights obtained from sensitivity analysis suggest some policies counter to those commonly practiced by the retailers while others are in concurrence with the strategies in vogue.     

Managing a retail-competition distribution channel with incentive policies

In reality, the multi-retailer channel of distribution has occurred in many industries, such as electronics, appliances, and apparel. The practice of the supplier providing incentives to retailers to promote sales is also quite prevalent in today’s business. This paper considers a two-retailer supply chain in which the supplier provides a cash discount to a specific retailer (a senior company owning more market share and having less pressure on the utilization of capital investment) and a credit period to another (a junior company owning less market share and having more pressure on the utilization of capital investment). The end demand for each channel has a substitute effect in terms of retail prices. The research problem originates from operations of dual-retailer channels in the automotive parts and accessories industry. The objective of the supplier is to determine the cash discount and credit period to maximize his profit. Both retailers determine pricing and ordering policies to maximize profits. This paper applies a Supplier Stackelberg framework to obtain equilibrium solutions for every entity. Numerical analysis is conducted to discuss the influence retailer competition has on the decision behaviors of the supplier and retailers.     

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.     

Single-manufacturer,multi-retailer consignment policy for retailers’ generalized demand distributions

Consignment policy (CP) is a novel approach to the inventory management in supply chains. It is based on strong interaction and reliable collaboration between vendor(s) and buyer(s), which is acquiring growing importance in today's industrial reality. Unlike most literature focusing on single-vendor single-buyer models and deterministic customer demand, a single-manufacturer (vendor) multi-retailer (buyer) generic model is developed under stochastic customer demand in this study. In order to understand the potential benefits of CP, it is compared with a traditional policy (TP) model developed in the similar approach. The models are tested with two scenarios of uniform and exponential demand distributions of the retailers. The results show how CP works better than the traditional uncoordinated optimization. It not only helps the manufacturer to generate higher profit, but also coordinates retailers to achieve a higher supply chain profit. At the same time, each retailer earns at least as much as they do in TP. Further price discount sensitivity analysis demonstrates the efficiency of CP when facing price-demand fluctuation.     

Allocation of warehouse inventory with electronic data interchange and fixed order intervals

This paper considers the problem of allocating warehouse inventory to retailers where retailer orders and the replenishment of warehouse inventory occur periodically on a fixed schedule. We assume that the warehouse and the retailers have the opportunity to exchange demand information through Electronic Data Interchange (EDI). At the warehouse level, for instance, the available information on the retailer's demand may be utilized in determining the shipment quantities needed to meet the desired service level to the retailers. Unlike similar models focusing primarily on optimizing systems wide performance measures, in this paper we focus on the service level furnished to the retailers by the warehouse. To this end, three different allocation policies are considered: static, myopic, and dynamic rules characterizing the impact of available demand information on the resulting service levels. Numerical illustrations exemplify the allocation rules considered. An interesting though counter intuitive observation is that the existence of additional demand information cannot, a prior, be assumed superior.     

Correlation and unmediated cheap talk in repeated games with imperfect monitoring

This paper studies n-player \((n\ge 3)\) undiscounted repeated games with imperfect monitoring. We prove that all uniform communication equilibrium payoffs of a repeated game can be obtained as Nash equilibrium payoffs of the game extended by unmediated cheap talk. We also show that all uniform communication equilibrium payoffs of a repeated game can be reached as Nash equilibrium payoffs of the game extended by a pre-play correlation device and a cheap-talk procedure that only involves public messages; furthermore, in the case of imperfect public and deterministic signals, no cheap talk is conducted on the equilibrium path.     

需求信息不对称下供应链中流程与产品创新模式选择研究

在制造商进行流程创新和产品创新的供应链中,当需求预测信息不对称时,研究了零售商的需求信息分享策略以及制造商最优创新模式。利用精炼贝叶斯理论和Stackelberg博弈模型,首先求得了每一种创新模式下信息分享价值、促进需求信息分享的激励机制以及供应链均衡的信息分享策略,其次对两种创新模式下利润进行对比分析。研究发现,在两种创新供应链模型中,当创新效率较高和较低时,零售商自愿分享和不分享需求信息分别是均衡策略;当创新效率处于中间水平时,通过设计一个讨价还价机制可以使零售商分享需求信息成为一个均衡。此外,当消费者对质量(价格)更敏感时,制造商选择产品创新(流程创新)模式可以使供应链成员都获益。     

Managing an integrated production inventory system with information on the production and demand status and multiple non-unitary demand classes

In this paper, we study a system consisting of a manufacturer or supplier serving several retailers or clients. The manufacturer produces a standard product in a make-to-stock fashion in anticipation of orders emanating from n retailers with different contractual agreements hence ranked/prioritized according to their importance. Orders from the retailers are non-unitary and have sizes that follow a discrete distribution. The total production time is assumed to follow a k₀-Erlang distribution. Order inter-arrival time for class l demand is assumed to follow a k_l-Erlang distribution. Work-in-process as well as the finished product incur a, per unit per unit of time, carrying cost. Unsatisfied units from an order from a particular demand class are assumed lost and incur a class specific lost sale cost. The objective is to determine the optimal production and inventory allocation policies so as to minimize the expected total (discounted or average) cost. We formulate the problem as a Markov decision process and show that the optimal production policy is of the base-stock type with base-stock levels non-decreasing in the demand stages. We also show that the optimal inventory allocation policy is a rationing policy with rationing levels non-decreasing in the demand stages. We also study several important special cases and provide, through numerical experiments, managerial insights including the effect of the different sources of variability on the operating cost and the benefits of such contracts as Vendor Managed Inventory or Collaborative Planning, Forecasting, and Replenishment. Also, we show that a heuristic that ignores the dependence of the base-stock and rationing levels on the demands stages can perform very poorly compared to the optimal policy.     

Exact evaluation of (R,Q)-policies for two-level inventory systems with Poisson demand

In this paper we show how to exactly evaluate holding and shortage costs for a two-level inventory system with one warehouse and N different retailers. Lead-times (transportation times) are constant, and the retailers face different Poisson demand processes. All facilities apply continuous review (R, Q)-policies. We express the policy costs as a weighted mean of costs for one-for-one ordering policies.     

Sequential share bargaining

This paper presents a new extension of the Rubinstein-St?hl bargaining model to the case with n players, called sequential share bargaining. The bargaining protocol is natural and has as its main feature that the players’ shares in the surplus are determined sequentially rather than simultaneously. The protocol also assumes orderly voting, a restriction on the order in which players respond to a proposal. The bargaining protocol requires unanimous agreement for proposals to be implemented. Unlike all existing bargaining protocols with unanimous agreement, the resulting game has unique subgame perfect equilibrium utilities for any value of the discount factor. The result builds on the analysis of so-called one-dimensional bargaining problems. We show that also one-dimensional bargaining problems have unique subgame perfect equilibrium utilities for any value of the discount factor.     

Coasian dynamics in repeated English auctions

We extend the Coase conjecture to the case of a seller with a single object, who faces n potential buyers and holds a sequence of English auctions until the object is sold. In an independent-private-values environment in which buyers and sellers share the same discount factor, we show that the (perfect Bayesian) equilibrium path of reserve prices obeys a Coasian logic. Moreover, the equilibrium reserve path lies below that for the repeated sealed-bid, second-price auctions studied by McAfee and Vincent (in Games Econ Behav 18:246–276). Nevertheless, the open (English) and sealed-bid formats are shown to be revenue equivalent.     

Volume discount pricing strategy in the VMI supply chain with price sensitive demand

This paper develops a volume discount scheme to coordinate Vendor Managed Inventory (VMI) supply chains with multiple heterogeneous retailers, in which the supply chain is modelled as a Stackelberg game with price sensitive demand. The paper proposes a method to construct a volume discount price scheme and shows that, any volume discount can be represented as a piecewise constant function of demand. We provide the game formulations of VMI supply chains and develop algorithms to solve this type of game problems, including finding the optimal volume discount scheme. Through a numerical study comparing the results of applying a volume discount strategy with the profits from a single wholesale price strategy, we show that the volume discount pricing strategies can be used to improve profits for all participants in the VMI supply chain in comparison with single price strategies.