首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 343 毫秒
1.
陶为群 《经济数学》2020,37(2):80-87
对于较重要的三方合作利益分配博弈问题,将相互体谅作为基本遵循并基于适应性预期模型,建立三方相互体谅讨价还价模型.运用这个模型,可以把三方相互体谅讨价还价达成均衡,归结为单调有界数列收敛与常系数非齐次线性差分方程组求解的结合运用.三方相互体谅讨价还价属于不完全信息动态合作博弈.对模型求解,一般地揭示三方相互体谅讨价还价达成均衡的过程与结果,阐明讨价还价有满足初始条件的唯一解和充要条件,以及充要条件的经济含义和数学意义.三方相互体谅讨价还价模型是对于两方相互体谅讨价还价模型的拓展,可以为建立更多方相互体谅讨价还价模型提供借鉴.  相似文献   

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

3.
针对现有文献大多忽视技术被许可方的议价能力问题,在一个双边垄断的框架之内,运用轮流出价的讨价还价模型,讨论了技术许可的价格契约.研究表明,当双方的时间贴现率反映各自议价成本的高低时,双方议价成本的相对大小决定其讨价还价的能力,也决定了各自对新增利润的分割;同时,说明了技术许可方拥有全部议价能力只是讨价还价模型的一种极端情形.模型对现实更有解释力,拓展了现有的研究思路.  相似文献   

4.
通过一个弱收敛方法,本文首次以拉普拉斯变换的形式给出α-稳定Levy运动干扰的经典风险模型的Gerber-Shiu期望折扣惩罚函数(G-S函数).用同样的方法,也获得了这个风险模型的最终破产概率作为本文结果的补充.作为检验,这个风险过程的最终破产概率实际上是G-S函数的特殊情形.  相似文献   

5.
将实物期权定价方法引入到讨价还价谈判博弈中,分别建立了完全信息和不完全信息跨国并购期权博弈模型,并应用纳什讨价还价定理求出了其中不完全信息博弈的唯一解,以及完全信息博弈的解区间.该模型证明期权估值法具有普遍意义, DCF估值法是跨国并购中的一种特例,最后,通过联想并购IBM PC案例检验了模型的基本结论.  相似文献   

6.
本文基于目前的网络资费模式,提炼出三种网络定价结构模型,研究本地网络服务提供商(ISP)及用户之间的利润分配.首先,利用一个简化的网络业务质量(Qos)保证模型构造目标函数,说明合作博弈得到的解比非合作博弈情形下更优,合作博弈时得到纳什议价解与双方的相对议价权力有关.然后,从社会结构理论角度,说明议价权力取决于网络结构类型以及局中人在结构中所处的位置.相对议价权力大,获益较多;相对议价权力小,获益较少.最后,通过实例分析得到三种网络定价结构模型下的纳什议价解.结果表明,本地网络服务提供商的合并、收购、互联有利于提高其相对议价权力,从而获益增加.  相似文献   

7.
黄松  杨超  张曦 《运筹与管理》2010,19(3):15-22
研究了一类在报童模型中考虑客户战略行为和风险态度时的最优定价与库存控制问题。假定零售商销售的商品具有季节需求特性,销售期末未售出的商品只能降价处理,战略客户以效用最大化为目标确定最优购买时机,零售商以期望利润最大化为目标确定最优销售数量和销售价格,得到了双方静态博弈时的理性预期均衡解,分析了理性预期均衡解的存在唯一性,以及理性预期均衡解与模型参数的关系,并进一步将模型做了两方面的拓展:(1)考虑了战略客户对商品的价值估计值不同时的情形;(2)考虑了零售商风险态度的情形,并分别给出了两种情形下理性预期均衡解的求解方法。最后通过一个数值算例对模型的结果进行了说明。  相似文献   

8.
针对农地流转市场存在双边信息不对称议价的现实,基于Rubinstein讨价还价博弈刻画了农地流转双方的议价过程,根据子博弈精炼纳什均衡得到了均衡流转价格,最后利用有关数据进行了算例分析.研究发现:均衡流转价格与流入方议价能力负相关、与流出方议价能力正相关;在流出方先出价的不完全信息讨价还价博弈中,当流出方对流入方的策略空间了解的越准确,或者流入方对流出方的策略空间了解的越少时,均衡交易价格越高;另外,流转双方的心理预期价格越高,均衡交易价格也越高.将流转双方的讨价还价过程、信息结构、破裂点纳入到农地流转价格的研究,既兼顾了流出方和流入方的利益,为双方谈判和议价提供了理论上的指导,也为农地流转价格的研究提供了新的视角.  相似文献   

9.
在供应链环境下的生产活动中,各成员对所辖资源具有独立的支配权,因此需要合理的机制使得协同调度方案得以实施,以提高供应链整体的效率.研究由具备不同讨价还价能力的成员所组成的供应链,建立了以纳什讨价还价公理体系为基础的调度谈判模型.在装配系统中,讨论两供应商关于交付顺序的协商.为求取纳什谈判解,提出了一类新的以多目标乘积项作为目标函数的调度问题.对于单机型供应商,新问题的计算复杂性尚未确定,设计了一种多项式时间的启发式算法以求得近优解,并通过数值算例进行验证.该谈判模型为供应链中各成员提供了一种合理的调度协调机制.  相似文献   

10.
结合DEA和博弈的思想研究二阶段网络系统的固定成本分摊问题,将分摊成本作为新的投入,可以证明存在某种分摊使DMU整体效率达到最优,在此基础上考虑各个DMU之间以及DMU内部之间的博弈,首先建立讨价还价乘积最大化模型,求出各DMU唯一的分摊解,然后建立DMU子系统之间的讨价还价模型,给出子系统的分摊解,最终的分摊方案满足系统效率和子系统效率为1,与现有的方法相比具有一定的优势.  相似文献   

11.
讨论了多目标多人合作对策中支付函数是模糊数的情形,利用模糊数学相关理论, 对Nash提出的6条公理进行拓广,并证明这种情况下λ-纳什谈判解的存在性.  相似文献   

12.
In this paper, we report the results of a series of experiments on a version of the centipede game in which the total payoff to the two players is constant. Standard backward induction arguments lead to a unique Nash equilibrium outcome prediction, which is the same as the prediction made by theories of “fair” or “focal” outcomes. We find that subjects frequently fail to select the unique Nash outcome prediction. While this behavior was also observed in McKelvey and Palfrey (1992) in the “growing pie” version of the game they studied, the Nash outcome was not “fair”, and there was the possibility of Pareto improvement by deviating from Nash play. Their findings could therefore be explained by small amounts of altruistic behavior. There are no Pareto improvements available in the constant-sum games we examine. Hence, explanations based on altruism cannot account for these new data. We examine and compare two classes of models to explain these data. The first class consists of non-equilibrium modifications of the standard “Always Take” model. The other class we investigate, the Quantal Response Equilibrium model, describes an equilibrium in which subjects make mistakes in implementing their best replies and assume other players do so as well. One specification of this model fits the experimental data best, among the models we test, and is able to account for all the main features we observe in the data.  相似文献   

13.
We study a supply chain with two independent companies producing an identical product and cooperating through transshipment. Previous studies of this chain show that only under certain conditions, linear transshipment prices could be found that induce the companies to choose the first best production quantities. Moreover, even if such transshipment prices do exist, they result in a unique division of total expected profit and thus they cannot accommodate arbitrary divisions of the profit. Using the Generalized Nash Bargaining Solution, we derive coordinating transshipment prices that always give rise to a coordinating contract for the chain. This contract relies on an implicit pricing mechanism.  相似文献   

14.
We study connections between optimistic bilevel programming problems and generalized Nash equilibrium problems. We remark that, with respect to bilevel problems, we consider the general case in which the lower level program is not assumed to have a unique solution. Inspired by the optimal value approach, we propose a Nash game that, transforming the so-called implicit value function constraint into an explicitly defined constraint function, incorporates some taste of hierarchy and turns out to be related to the bilevel programming problem. We provide a complete theoretical analysis of the relationship between the vertical bilevel problem and our “uneven” horizontal model: in particular, we define classes of problems for which solutions of the bilevel program can be computed by finding equilibria of our game. Furthermore, by referring to some applications in economics, we show that our “uneven” horizontal model, in some sense, lies between the vertical bilevel model and a “pure” horizontal game.  相似文献   

15.
This paper is concerned with the analysis of a Nash equilibrium of a noncooperative game. It can be shown that, without complete information about the other players' objectives or interests, the group of players, as a whole, can reach a Nash equilibrium by adopting a class of adaptive expectation and dynamic adjustment processes. It is shown that, if the expectation and adjustment processes are made continuously, the stability of the overall dynamic process is independent of the specific mechanisms of the expectation and the adjustment, but depends on the properties of each player's objective or payoff function. If, however, expectation and adjustment processes are made at discrete time intervals, the stability of the discrete process depends on the speed of adjustment chosen by each player.This research was supported by ONR Contract No. N00014-75-C-0738. The authors are indebted to the referee for several valuable comments and suggestions for improvement.  相似文献   

16.
The Bargaining Problem paradigm is extended to time-consuming conflict situations. Such a situation can be represented by a chain of bargaining domains, each representing the conflict at a different point in time. The solution function selects a point in the union of all these domains. We characterize a solution function which satisfies several requirements and explore its properties. One of the results is that an extension of the Adding requirement (Thomson-Myerson 1980) is enough, under some conditions, to yield a solution point, so there is no need to extend the stronger requirements of Independence of Irrelevant Alternatives (Nash 1950) or Monotonicity (Kalai-Smorodinsky 1975).  相似文献   

17.
Starting from the paper by Nash and Sofer (1990), we propose a heuristic adaptive truncation criterion for the inner iterations within linesearch-based truncated Newton methods. Our aim is to possibly avoid “over-solving” of the Newton equation, based on a comparison between the predicted reduction of the objective function and the actual reduction obtained. A numerical experience on unconstrained optimization problems highlights a satisfactory effectiveness and robustness of the adaptive criterion proposed, when a residual-based truncation criterion is selected.  相似文献   

18.
All in good time     
Why is issue-by-issue bargaining a common phenomenon, even though it disallows the beneficial trade-offs across issues that are possible when negotiating a global solution? We show that under asymmetric information, issue-by-issue bargaining has two attractive features. First, it avoids bundling a good deal on one issue with a bad deal on another issue, when the lack of gains to agreement on the latter is not a priori common knowledge. Second, it avoids the imposition of the asymmetric information inefficiency of “harder” issues on issues which turn to be “easier” to solve. That’s why when the agenda is not imposed on the parties but is rather left for them to determine when negotiating, they may very well opt for issue-by-issue bargaining. We demonstrate this in a natural game where bargainers communicate, whenever they choose to do so, their willingness to discuss or make offers either on one of the issues or on a bundle of issues.  相似文献   

19.
介绍了基于红利贴现的适应性预期股价模型,对适应性预期股价决定模型和理性预期股价决定模型进行了比较,并分析总结了已有的实证结果,得出了适应性预期模型对于成熟股票市场有很强解释能力并将对我国股市有借鉴意义的结论.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号