品牌专营下供应链价格和批量联合最优决策

假定需求是价格的函数,首先研究了非品牌专营下供应链的最优价格决策和最优批量决策,然后研究了品牌专营下供应商、零售商价格和批量的最优决策.建立了供应商优先决策的Stackelberg博弈模型,通过求解得到了该博弈问题均衡解,即得到了供应商控制的品牌产品最优零售价格和零售商控制的最优订货批量.最后将该模型应用于一个实例中,比较了非品牌专营下和品牌专营下最优决策的不同和供应链利润的不同,品牌专营提高了供应链整体的利润以及供应商自身利润占整个供应链利润的比例.     

双渠道供应链中合作广告与定价的动态模型

基于单个制造商与单个零售商所组成的双渠道供应链结构,利用微分对策方法,分别考察了动态架构中Stackelberg博弈与合作博弈情形下渠道成员的最优定价和广告策略,并对此两种博弈结构下的反馈均衡结果进行了分析比较.研究发现,两种博弈相比,制造商的直销价格相同,零售商在合作博弈下选择更小的零售价格;制造商在合作博弈下对广告的投入更多,而零售商在两种博弈下的广告投入水平取决于零售商的广告竞争强度与两个渠道销售价格竞争强度的关系;两种博弈下供应链系统利润的大小关系依赖于系统参数.     

考虑延迟现象的质量改进投入和营销努力动态协同策略

利用时滞微分方程刻画质量改进投入对品牌商誉提升的延迟现象,分别构建了制造商和零售商采取非合作博弈、合作博弈以及成本分担的部分合作博弈(制造商参与营销的单向部分合作博弈、零售商参与生产的单向部分合作博弈、制造商参与营销及零售商参与生产的双向部分合作博弈)五种决策模式下的微分博弈模型。借助哈密尔顿极大值原理,求解得到五种情形下的制造商最优质量改进投入策略和零售商的最优营销努力策略以及供应链利润。对比五种博弈模式下的结果发现:1)延时现象会降低制造商进行质量改进投入的积极性,但对零售商营销努力无影响;品牌商誉在延迟现象影响下出现先衰减后提升的演进规律;2)合作博弈对于供应链绩效总是最优的,三种成本分担的部分合作博弈契约虽不能实现供应链的完全协调,但可以对非合作博弈情形进行帕累托改进;3)对比两种单向部分合作博弈,在提高供应链利润方面,制造商参与营销的成本分担契约优于零售商参与生产的成本分担契约;4)三种成本分担契约中,双向合作的部分合作博弈是供应链的最优选择,但随着延迟时间增大,其帕累托改进效果将不再明显。     

易腐品供应链企业联合采购决策与费用分配研究

在激烈的市场竞争中,如何降低成本以及保证产品的新鲜度对于销售易腐性产品的零售商来说具有至关重要的意义.企业间通过实施联合采购可以降低采购成本,增加与供应商的谈判议价能力,因此联合采购受到越来越多的企业以及学者的关注.考虑了在非瞬时补货情况下多零售商向同一供应商联合采购某种易腐品的订货决策及费用分配问题.以易腐品联合采购过程中产生的订货费用作为分配的对象,应用合作博弈理论,将非瞬时补货情况下易腐品联合采购的费用分配问题构造成易腐品的联合采购博弈,证明了该博弈的核心非空且为子模博弈,并给出了核心中的一个分配方案,同时还讨论了补货速率对零售商分担的订货费用的影响.论文最后对几种典型的比例分配解的效率进行了模拟分析.     

碳限额与交易机制下受资金约束的供应链优化

在碳限额与交易机制下,研究零售商受资金约束的供应链优化问题。构建了制造商占优的两级供应链Stackelberg博弈模型,通过引入减排成本分担机制,分别给出了分散决策和集中决策的最优解。通过收益共享契约,实现了供应链协调和供应链成员利润的帕累托改善。通过算例分析了不同减排成本分担系数、碳交易价格对供应链利润和订购量、碳减排决策的影响,为供应链各成员开展减排合作提供了理论依据。研究结果表明,供应链成员的合作不仅可以提高供应链总绩效,而且有利于为消费者提供更多、更绿色的产品;碳价格的提高,促使供应链更加努力减排,从而提高了供应链总利润。     

基于微分博弈的二级猪肉供应链质量行为协调机制研究

运用微分博弈方法研究了由单一生猪屠宰加工企业和单一超市构成的二级猪肉供应链质量行为协调机制。首先考察并比较了Nash非合作博弈、Stackelberg主从博弈以及协同合作博弈情形下屠宰加工企业和超市的最优质量行为决策,研究结果表明协同合作决策模式下,屠宰加工企业和超市的质量行为以及猪肉供应链总体利润均严格优于在非合作决策模式下的相应值。然后导出了能够使屠宰加工企业和超市的个体利润达到帕累托最优,进而实现双方质量行为协调的供应链总体利润分配系数的取值范围。     

二级供应链上不完美互补产品的定价决策

建立一个由两个制造商和一个零售商组成供应链模型,以求解制造商和零售商的最优定价决策,其中两个制造商向零售商批发的产品是不完美互补的,且零售商采取混合捆绑策略销售这两种产品。考虑三种情形下的决策:(1)完全非合作博弈;(2)局部合作博弈;(3)合作博弈。通过比较前两种情形下的决策,利用Nash协商模型求解得到消除水平和垂直供应链冲突的最优定价决策。与完全非合作博弈决策相比,局部合作博弈决策对制造商是有利的,在一定的条件下也可以实现对零售商收益的帕累托改进;而合作博弈决策在任何情况下都要明显地优于完全非合作博弈决策以及局部合作博弈决策,同时合作博弈决策下的最优产品需求量相比局部合作博弈决策下的最优产品需求量提高了一倍。最后,通过数值试验验证了文章所得结论。     

信用期下时滞变质品供应链库存和定价的Stackelberg均衡策略

在允许缺货和考虑资金机会成本情况下,根据时滞变质品的基本库存模型,分别构建了信用期下供应商为领导者(SL)和零售商为领导者(RL)的Stackelberg博弈模型。通过分析SL和RL下的Stackelberg博弈模型唯一均衡解,得到两个模型中均衡解的解析表达式。最后,根据数值算例分析得出:(1)在SL供应链中信用期并不总使整个供应链协调,然而在RL供应链中信用期的协调效果较好;(2)延长信用期或增加零售价格均能刺激零售商多订货;(3)在两个模型中,零售价格均随变质时刻递增,且整条供应链达到Pareto改进;(4)SL中供应商变动信用期与RL中零售商变动价格相比,SL供应链收益更高;而当信用期和价格固定,其他参数变动时,RL供应链收益更大。     

基于微分博弈的数据开放策略及合作收益分配机制研究

数据作为数字经济时代一种重要的生产要素,在国民经济运行中的作用越来越重要。然而,现阶段我国社会数据开放仍处于起步阶段,急需加快推进数据开放共享。为准确分析数据开放主体政府和企业的数据开放策略,运用微分博弈分别构建Nash非合作博弈、Stackelberg主从博弈和协同合作博弈模型,得到三种情形下政府和企业最优开放数据努力程度、社会数据开放水平最优轨迹以及最优收益函数;其次,在协同合作博弈情景下,将时间因素引入Nash谈判模型,进一步分析政府和企业合作时具有时间一致性的动态收益分配机制;最后,结合数值仿真对影响社会数据开放水平的相关参数进行灵敏性分析。研究结果发现,当政府获得收益分配比例大于1/3时,Stackelberg主从博弈下的政府和企业双方收益以及社会数据开放水平均高于Nash非合作情形;协同合作情形下,双方总收益和社会数据开放水平均能达到帕累托最优状态。     

供应链协调中供应商的价格歧视策略

分析了包含一个供应商和两个不同零售商的供应链网络的协调问题.将这一问题构建为一个两层次的博弈模型:零售商之间的非合作博弈以及供应商与零售商之间的Stackelberg博弈.博弈的均衡表明,通过简单的价格歧视,供应商就能够实现整个供应链网络的协调,而且价格歧视的水平与零售商之间的市场容量差异、产品需求的价格敏感系数以及产品的边际生产成本有关.在合理的参数范围内,市场容量更大的零售商所收取的零售价格较低,从供应商那里取货的成本也较低.这样的结论是比较符合现实情形的,这也就说明该模型为现实世界中的价格差异提供了另一种解释.此外,还分析了当供应商无法实施价格歧视时,由此导致的供应链的损失.     

A basic searchlight game

A searchlight game is a two-person zero-sum dynamic game of the pursuit-evasion type in which at least one of the two players has a searchlight. A searchlight can be flashed a given number of times within a fixed time period and the objective is to catch the opponent in the region illuminated by the flash. Olsder and Papavassilopoulos instituted the study of these games and, in this paper, we supplement their results, obtaining a closed formula for the value and optimal strategies for the players in their basic game.     

Convex and exact games with non-transferable utility

We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set.     

Totally monotonic games and flow games

Equivalences between totally balanced games and flow games, and between monotonic games and pseudoflow games are well-known. This paper shows that for every totally monotonic game there exists an equivalent flow game and that for every monotonic game, there exists an equivalent flow-based secondary market game.     

Search and Ambush Games with Capacities

Search games with capacities are bipersonal zero-sum games where a player has to hide a number of objects or an amount of material in a fixed number of containers and his opponent attempts to locate them. In this article, we deal with games on a discrete structureless set and on a discrete set with linear order. In both cases, the capacities under consideration are continuous. Some of the games studied generalize previously studied games.     

Continuous Accumulation Games in Continuous Regions

In a continuous accumulation game on a continuous region, a Hider distributes material over a continuous region at each instant of discrete time, and a Seeker examines the region. If the Seeker locates any of the material hidden, the Seeker confiscates it. The goal of the Hider is to accumulate a certain amount of material before a given time, and the goal of the Seeker is to prevent this. In previous works, we have studied accumulation games involving discrete objects and continuous material over discrete locations. The issues raised when the region is continuous are substantially different. In this paper, we study accumulation of continuous material over two types of continuous regions: the interval and the circle.     

Formulation and analysis of combat problems as zero-sum bicriterion differential games

In this paper, we present a formulation and analysis of a combat game between two players as a zero-sum bicriterion differential game. Each player's twin objectives of terminating the game on his own target set, while simultaneously avoiding his opponent's target set, are quantified in this approach. The solution in open-loop pure strategies is sought from among the Pareto-optimal security strategies of the players. A specific preference ordering on the outcomes is used to classify initial events in the assured win, draw, and mutual kill regions for the players. The method is compared with the event-constrained differential game approach, recently proposed by others. Finally, a simple example of the turret game is solved to illustrate the use of this method.     

A game locating a needle in a square haystack

The following hider-seeker zero-sum game is considered. The hider hides a needle of length , in the closed unit square, and the seeker tries to locate it by shooting in a straight line across the square. The payoff to the seeker is 1 if he hits the needle and 0 otherwise.A solution of the game is obtained when or whena lies in either of the intervals and ; in addition, it is shown that, whenn is a positive integer anda=1/n, the value of the game is 1/2n. The properties of the solutions are in marked contrast to those for the analogous game over the closed unit disc, which the authors solved in a previous paper, and suggest that a complete solution may well be difficult. It is also shown that every member of a whole class of haystack games has a value.     

Folk theorems in multicriteria repeated N-person games

In this paper we consider the question of existence of a multicriteria-Nash equilibrium in multicriteria multistage N-person games. Besides, we present several forms of multicriteria-Nash equilibrium for repeated games both with infinitely and finitely many stages. The author thanks the Spanish Ministry of Science and Technology through grant number BFM01-2378.     

On the linear-quadratic,closed-loop,no-memory Nash game

Linear closed-loop no-memory strategies for the LQ Nash game are considered. We exhibit a class of such problems with the property that the solution exists for any finite time interval; for the infinite time case, there exist none or a unique or many solutions, depending on the choice of the parameters. In addition, the limit of the finite time solution as the time interval increases does not have to yield the infinite time case solution. A geometric formulation of the coupled algebraic Riccati equation is given. This formulation seems to be an interesting starting point for a thorough study of these equations.This work was supported in part by the United States Air Force, Office of Scientific Research, under Grants Nos. AFOSR-80-0171 and AFOSR-82-0174.