共查询到20条相似文献,搜索用时 703 毫秒
1.
本文考虑随机因素干扰的情形下,运用HJB方程和动态规划方法分别求解Nash非合作博弈和协同创新博弈模型下大学与企业的知识共享策略。结果表明:(1)两种博弈情形下,知识共享的成本越高,共享的知识量越少,知识共享边际收益越高;(2)协同创新博弈模式下的知识共享量、系统总收益均高于Nash非合作博弈,更易于达到Pareto最优,即推动产学研协同创新有助于提升系统总收益;(3)在合作情形下,大学与企业的决策目标定位于整体收益最大化,使得双方在知识共享努力程度与整体收益情况均优于Nash非合作博弈,在对知识共享行为有效协调下,合作策略是大学与企业构建协同创新系统,促进系统内知识共享的最优选择。 相似文献
2.
Zhipeng Li Minyue Fu Huanshui Zhang Zongze Wu 《Journal of The Franklin Institute》2018,355(12):5240-5255
In this paper, we consider a stochastic linear quadratic mean field game for the continuum-parameterized multi-agent systems with multiplicative noise. Based on the Nash certain equivalence principle, we obtain a series of decentralized control laws. Then, Dynkin’s formula and comparison principle are employed to prove the boundedness of the state of the closed loop system in the mean square sense. Finally, we show that the set of decentralized controls has an ?-Nash equilibrium property. 相似文献
3.
4.
In this paper, we propose a novel method for addressing the multi-equilibria consensus problem for a network of n agents with dynamics evolving in discrete-time. In this method, we introduce, for the first time in the literature, two concepts called primary and secondary layer subgraphs. Then, we present our main results on directed graphs such that multiple consensus equilibria states are achieved, thereby extending the existing single-state consensus convergence results in the literature. Furthermore, we propose an algorithm to determine the number of equilibria for any given directed graph automatically by a computer program. We also analyze the convergence properties of multi-equilibria consensus in directed networks with time-delays under the assumption that all delays are bounded. We show that introducing communication time-delays does not affect the number of equilibria of the given network. Finally, we verify our theoretical results via numerical examples. 相似文献
5.
Huanhuan Yuan Yuanqing Xia Yuan Yuan Hongjiu Yang 《Journal of The Franklin Institute》2021,358(10):5281-5304
We consider a remote state estimation process under an active eavesdropper for cyber-physical system. A smart sensor transmits its local state estimates to a remote estimator over an unreliable network, which is eavesdropped by an adversary. The intelligent adversary can work in passive eavesdropping mode and active jamming mode. An active jamming mode enables the adversary to interfere the data transmission from sensor to estimator, and meanwhile improve the data reception of itself. To protect the transmission data from being wiretapped, the sensor with two antennas injects noise to the eavesdropping link with different power levels. Aiming at minimizing the estimation error covariance and power cost of themselves while maximizing the estimation error covariance of their opponents, a two-player nonzero-sum game is constructed for sensor and active eavesdropper. For an open-loop case, the mixed Nash equilibrium is obtained by solving an one-stage nonzero-sum game. For a long term consideration, a Markov stochastic game is introduced and a Nash Q-learning method is given to find the Nash equilibrium strategies for two players. Numerical results are provided to show the effectiveness of our theoretical conclusions. 相似文献
6.
7.
8.
9.
10.
11.
分析在不同的市场结构下,不同属性的标准在被采纳过程中,企业与企业之间以及企业与政府之间的博弈行为,并通过相应的博弈模型试图找到不同状况下博弈的纳什均衡解,为标准被顺利采纳提供针对性政策参考。 相似文献
12.
In this paper, we investigate the optimal denial-of-service attack scheduling problems in a multi-sensor case over interference channels. Multiple attackers aim to degrade the performance of remote state estimation under attackers’ energy constraints. The attack decision of one attacker may be affected by the others while all attackers find their own optimal strategies to degrade estimation performance. Consequently, the Markov decision process and Markov cooperative game in two different information scenarios are formulated to study the optimal attack strategies for multiple attackers. Because of the complex computations of the high-dimensional Markov decision process (Markov cooperative game) as well as the limited information for attackers, we propose a value iteration adaptive dynamic programming method to approximate the optimal solution. Moreover, the structural properties of the optimal solution are analyzed. In the Markov cooperative game, the optimal joint attack strategy which admits a Nash equilibrium is studied. Several numerical simulations are provided to illustrate the feasibility and effectiveness of the main results. 相似文献
13.
Julian Barreiro-Gomez Carlos Ocampo-Martinez Nicanor Quijano José M. Maestre 《Journal of The Franklin Institute》2017,354(14):5771-5796
This paper solves a data-driven control problem for a flow-based distribution network with two objectives: a resource allocation and a fair distribution of costs. These objectives represent both cooperation and competition directions. It is proposed a solution that combines either a centralized or distributed cooperative game approach using the Shapley value to determine a proper partitioning of the system and a fair communication cost distribution. On the other hand, a decentralized non-cooperative game approach computing the Nash equilibrium is used to achieve the control objective of the resource allocation under a non-complete information topology. Furthermore, an invariant-set property is presented and the closed-loop system stability is analyzed for the non-cooperative game approach. Another contribution regarding the cooperative game approach is an alternative way to compute the Shapley value for the proposed specific characteristic function. Unlike the classical cooperative-games approach, which has a limited application due to the combinatorial explosion issues, the alternative method allows calculating the Shapley value in polynomial time and hence can be applied to large-scale problems. 相似文献
14.
15.
针对由单个制造商和零售商所组成的闭环供应链,考虑政府奖惩零售商回收废旧品活动的情况,基于博弈论方法,分别构建了集中式、制造商和零售商存在Nash均衡博弈、制造商领导的Stackelberg博弈、零售商领导的Stackelberg博弈等模式下的闭环供应链决策模型,进而探讨了政府设置的奖惩力度和废旧品最低回收率分别对四种模式闭环供应链的决策、系统各成员及总利润的影响问题。研究表明:产品的单位批发价格和废旧品的回收率均会随着政府奖惩力度的增加而增加;产品的单位销售价格会随着政府奖惩力度的增加而减少;制造商的利润会随着政府奖惩力度的增加而增加;零售商的利润和集中式决策闭环供应链的总利润同时受到政府奖惩力度和废旧品最低回收率的影响。因此,政府通过设置合理的奖惩力度和废旧品最低回收率,可使得闭环供应链和系统各成员在获得满意经济效益的同时实现生态效益。 相似文献
16.
17.
针对当前研究的网络舆情传播问题,本文依据现有网络舆情的传播实例,归纳总结出网络舆情传播的新特征。探讨以“网络大V”为代表的舆情传播者和以政府部门为代表的网络舆情管控者之间的博弈模型,运用秩依效用理论,考虑博弈双方带有心理偏好时的博弈状态,依据不同的实际情况分析其Nash均衡。最后用实例对模型进行验证。 相似文献
18.
电力工业改革在发电领域引入竞争,目的在于提高电力生产效率,促进电力工业的发展.发电企业竞价是一个不完全信息下的静态博弈问题,在深入分析不完全信息市场环境下发电企业竞价过程的基础上,运用博弈论中的暗标拍卖原理构建发电企业竞价的暗标拍卖贝叶斯博弈模型,并通过求解贝叶斯纳什均衡得出发电企业的最优竞价模型,从而为发电企业建立有效的竞价策略提供决策参考. 相似文献
19.
运用博弈论的思维方式和分析工具,研究在既定专利制度下的专利战略,通过专利战略的博弈分析,提出专利战略的组织行为策略应基于Nash均衡的理念;现代经济条件下,无论是技术创新、产品升级还是国际贸易,制定专利战略的均衡策略是组织行为的重要一环. 相似文献
20.
In this paper, optimized interaction control is investigated for human-multi-robot collaboration control problems, which cannot be described by the traditional impedance controller. To realize global optimized interaction performance, the multi-player non-zero sum game theory is employed to obtain the optimized interaction control of each robot agent. Regarding the game strategies, Nash equilibrium strategy is utilized in this paper. In human-multi-robot collaboration problems, the dynamics parameters of the human arm and the manipulated object are usually unknown. To obviate the dependence on these parameters, the multi-player Q-learning method is employed. Moreover, for the human-multi-robot collaboration problem, the optimized solution is difficult to resolve due to the existence of the desired reference position. A multi-player Nash Q-learning algorithm considering the desired reference position is proposed to deal with the problem. The validity of the proposed method is verified through simulation studies. 相似文献