共查询到17条相似文献,搜索用时 46 毫秒
1.
2.
本文建立了两个企业的序贯价格竞争模型,基于有限理性预期调整,研究了企业博弈的动态演化特征,分析了模型的均衡解及其稳定性条件。研究发现,边界解和纳什均衡解是一定参数条件下的局部稳定均衡。基于有限理性的动态博弈能够实现基于完全信息的纳什均衡。单纯跟随策略是一定条件下的均衡策略,并能使跟随企业获得更高的销售价格。企业之间报价的相互跟随程度和企业预期的调整速度将会影响均衡点的稳定性。本文对模型进行了数值模拟分析,当参数不满足稳定性条件时会出现分岔、奇异吸引子等混沌现象。本文的主要研究结果对相关行业的企业竞争和稳定市场有启发意义。 相似文献
3.
经典古诺寡头模型以及目前相关的寡头定产竞争模型最致命的缺陷是对寡头博弈目标的假设、时序假设、有限理性与知识的假设与现实严重不符.本文依据新的博弈条件假设,构建了一种对现实决策情形具有较强的普适性的描述性博弈结构模型.该模型能够对现实中的主导与从属型厂商之间、存在先知先觉博弈者的战略定产决策问题进行很好地描述,且经证明经典古诺博弈模型是该模型的一种特例.在此基础上,本文证明了:一般情况下,斗争策略是基于战略利益的双寡头定产竞争的纳什均衡策略,并找到了双寡头战略调整的聚点均衡;发现了:存在战略扩展阻尼条件的先期决策寡头的阻尼纳什均衡,并给出了该问题的构造性的证明和仿真算例. 相似文献
4.
5.
住房信贷定价偏低,除了与银行机构自身信息不对称有关之外,还与货币政策的有限理性有直接或间接的关系.这是由于货币政策相对宽松,使无风险利率也相应降低,从而导致住房信贷的定价偏低.本文主要针对住房信贷偏低定价问题展开探讨,同时也对住房信贷市场上的有关金融机构的自我操控、控制行为以及政府参与等方面做了简要的分析. 相似文献
7.
本文从有限理性的角度,对折现现金流定价模型给出了一个灰色数学描述,引进了信心度的概念,建立了一个含有投资人行为心理为参数的模型,提出了灰色有效市场假说;最后利用该模型和灰色有效市场假说,把股票市场的非有效性现象纳入了一个解释框架. 相似文献
8.
本文通过对证券组合投资的预期收益率和投资风险进行综合定量分析,建立了证券组合投资的预期收益率和投资风险进行综合定量分析,建立了证券组合投资的预期收益率和投资风险两个目标均达到最优的多目标规划模型,并对模型进行分析,最后通过案例给出了模型的最优解。 相似文献
9.
一种多目标的斯坦克尔伯格模型 总被引:3,自引:1,他引:3
本文分析了在传统理性假定下经济分析工具面临的困境,在关于人类理性行为研究基础上,提出了用多目标的方法,结合权重向量来构造新的理性,建立了多目标斯坦克尔伯格模型.该模型是传统斯坦克尔伯格模型的扩展,模型的构造和均衡结果对实际情况能够作出更有效的解释和预测.本文的研究方法对于其他博弈模型具有一定的普遍意义. 相似文献
10.
在Becker与Murphy的"理性成瘾"理论基础上进行了拓展研究.在假定成瘾者预期寿命有限的条件下,构建了有限时域理性成瘾模型,并运用最优控制理论获得了最优成瘾消费与成瘾资本的显式表达式.研究表明,预期寿命的延长,理性成瘾者会相对降低对成瘾品的消费量;成瘾品的消费量与成瘾者的风险偏好、耐心程度和成瘾资本衰减速率等因素有关;成瘾消费具体表现为随年龄增长而单调上升或者先缓慢下降然后再快速上升这两种情形.基于中国健康与营养调查(CHNS)香烟与酒类消费数据,实证分析了寿命有限约束下理性成瘾理论的合理性.研究还表明,在控制和戒除有害成瘾行为的过程中,应该充分考虑成瘾者的个体特征以及成瘾物品本身特性所产生的潜在影响. 相似文献
11.
本文提出一种基于Mealy自动机的多人重复博弈演化模型。该模型用Mealy自动机表示博弈参与人的战略行为,并构造一个基于遗传算法的自动机演化程序。博弈初始时,博弈参与人提交一个Mealy自动机。博弈参与人的有限自动机在当前状态下与竞争对手的自动机进行博弈,并且依据其获取的支付转换到下一状态,然后在新的状态下开始新一周期的博弈。在进行一段时间博弈后,则利用自动机演化程序对自动机进行演化,演化的标准是依据其在这一段时间博弈中的获得的平均支付及战略成本。通过仿真可以验证,在参与人理性程度较低且存在信息干扰的情况下,博弈参与人为了降低在博弈过程中的信息失真率,战略成本需要以较大的幅度下降。 相似文献
12.
In this article, we model various forms of non‐optimizing behavior in a newsvendor setting, including biases such as recency, reinforcement, demand chasing, and anchoring, as well as unsystematic decision errors. We assume that a newsvendor may evaluate decisions by examining both past outcomes and future expected payoffs. Our model is motivated by laboratory observations under several types of supply chain contracts. Ordering decisions are found to follow multi‐modal distributions that are dependent on contract structures and incentives. We differ from previous research by using statistics to determine which behavioral factors are applicable to each decision maker. A great deal of heterogeneity was discovered, indicating the importance of calibrating a contract to the individual. Our analysis also shows that the profit performance and the effectiveness of co‐ordinating contracts can be affected by non‐optimizing behaviors significantly. We conclude that, in addition to the aggregate order quantities, the decision distributions should be considered in designing contracts. 相似文献
13.
Clemens Heuberger 《Journal of Combinatorial Optimization》2004,8(3):329-361
Given a (combinatorial) optimization problem and a feasible solution to it, the corresponding inverse optimization problem is to find a minimal adjustment of the cost function such that the given solution becomes optimum.Several such problems have been studied in the last twelve years. After formalizing the notion of an inverse problem and its variants, we present various methods for solving them. Then we discuss the problems considered in the literature and the results that have been obtained. Finally, we formulate some open problems. 相似文献
14.
针对考虑顾客有限“碳行为”偏好的选址-路径-库存联合优化问题,引入环保度系数作为碳排放量的特征向量,在低碳产品加价率存在的情况下,刻画了顾客有限“碳行为”偏好和市场逆需求系数对低碳产品需求量的影响,构建了选址-路径-库存系统中考虑有“碳行为”偏好的联合优化模型,并分析了顾客行为偏好对企业收益的影响。使用基于NNC的多目标求解方法,对考虑成本和碳排放的双目标问题进行处理并得到一组Pareto解集,数值实验证明了产品环保度、顾客有限“碳行为”偏好对企业运作方案和收益水平的影响。 相似文献
15.
16.
In this paper we consider some inverse combinatorial optimization problems, that is, for a given set of feasible solutions of an optimization problem, we wish to know: under what weight vectors (or capacity vectors) will these feasible solutions become optimal solutions? We analysed shortest path problem, minimum cut problem, minimum spanning tree problem and maximum-weight matching problem, and found that in each of these cases, the solution set of the inverse problem is charaterized by solving another combinatorial optimization problem. The main tool in our approach is Fulkerson's theory of blocking and anti-blocking polyhedra with some necessary revisions. 相似文献
17.
We consider Steiner minimum trees (SMT) in the plane, where only orientations with angle
, 0 i – 1 and an integer, are allowed. The orientations define a metric, called the orientation metric, , in a natural way. In particular, 2 metric is the rectilinear metric and the Euclidean metric can beregarded as metric. In this paper, we provide a method to find an optimal SMT for 3 or 4 points by analyzing the topology of SMT's in great details. Utilizing these results and based on the idea of loop detection first proposed in Chao and Hsu, IEEE Trans. CAD, vol. 13, no. 3, pp. 303–309, 1994, we further develop an O(n2) time heuristic for the general SMT problem, including the Euclidean metric. Experiments performed on publicly available benchmark data for 12 different metrics, plus the Euclidean metric, demonstrate the efficiency of our algorithms and the quality of our results. 相似文献