效用函数与纳什均衡

本文引入效用函数将博弈问题描述为收入形式和效用形式两种模型,使得纳什均衡与参与人效用函数联系起来,并得到结论(1)效用函数的变化对纯策略纳什均衡不产生影响,却改变真混合策略纳什均衡;(2)效用函数严格拟凹时,真混合策略蚋什均衡是稳定的;(3)效用函数严格拟凸时,真混合策略纳什均衡不存在.     

模糊支付矩阵混合策略模型及其求解

在各局中人没有最优纯策略时,考虑选取不同策略的概率分布和支付矩阵的模糊性,建立模糊支付混合策略的对策模型.基于线性规划和三角模糊数排序准则,给出模型求解方法.模型在实例中得到验证,其计算简单,结果合理,可以为决策提供科学依据.     

对学生惩罚越重作弊越少吗?

对学生与监考老师在考试时作弊与不作弊的混合策略进行分析,从博弈论的角度运用最大期望收益与等收益法对混合策略的纳什均衡进行求解.结果显示,加大学生作弊的惩罚会导致老师监考不严,而对监考老师的奖励或惩罚越大,学生作弊的概率越小.因此,加大监考老师的激励是降低学生作弊的有效方法.根据经济学激励理论对学校与监考老师的博弈进行求解,结果既能满足激励相容约束,又能在学校与监考老师之间的序贯博弈中达到纳什均衡,为建立监考老师的激励机制与防止学生作弊提供了理论依据.     

基于博弈论混合策略下的路径选择模型

为了缓解交通拥挤的状况,预测出行者路径选择行为是一项值得研究的工作.在混合策略下,根据出行者之间的博弈关系,定义了混合策略下的得益函数,并引入求解混合策略纳什均衡的一种新方法,即极值法,对出行者的路径选择博弈模型进行了求解,有效弥补了传统划线法的不足,最终得到每个出行者的最优选择,实现了博弈各方的平衡.通过算例,有效地说明了混合策略下出行者最可能做出的路径选择.     

考虑投资人过度自信偏好的占线股票投资策略研究

当股票价格及收益的统计信息不足或无法构建精确概率分布时,股票占线投资问题获得广泛关注,即投资人能够运用在线算法和竞争分析设计出更好的占线投资策略以应对股价的不确定性。本文将投资人过度自信偏好这种认知偏差,引入到股票占线投资问题中,构建了离线对手与股票占线投资人的博弈模型,分别给出一般情形和存在动量效应情形下的最优混合策略和混合策略纳什均衡。结果发现,两种情形下的最优混合策略不仅克服了传统股票投资策略对股价或股票收益概率分布假设的过度依赖,并且更好地抽象了股票占线投资人过度自信、追涨杀跌等特征,对现有行为金融与金融占线交易问题的研究提供了有益补充。     

第三方支付平台交易的粗糙博弈模型及算法研究

鉴于第三方支付平台交易的参与者在策略选择时存在着不可分辨现象和博弈,而目前粗糙博弈论的研究仍缺少系统化的理论成果。本文首先对照经典博弈论的概念,给出了粗糙博弈论的定义,然后创立了求解n人非合作完全信息静态粗糙博弈论的混合策略均衡解的算法,最后建立了第三方支付平台交易的粗糙博弈模型,并给出模型的均衡解。应用实例表明模型和算法是有效可行的,比较符合当前第三方支付平台交易的实际状况和参与人的关系现状,模型的求解结果能够指导博弈各方更好地确定自己的策略。粗糙博弈论及非合作完全信息静态粗糙博弈论的混合策略均衡解的算法研究,给第三方支付平台交易的管理者提供了科学有益的借鉴。     

网络传媒业供应链质量控制策略与组织模式选择

网络传媒供应链由内容制作商提供有价值的信息产品(如娱乐、资讯等)并通过网站提供给消费者.产品质量控制对网络传媒供应链至关重要.首先利用博弈论的方法分析内容制作商和网站分别独立决策时的策略,纳什均衡揭示双方的"搭便车"动机使供应链整体利润无法达到最优.然后利用最优化的方法分析他们在垂直整合模式下的策略,发现协调决策可以提高整体利润.最后考虑垂直整合模式的新增成本,分析需求质量弹性、利润分配均匀性和质量控制成本等因素对供应链是否采取垂直整合模式的影响.帮助理解网络媒体产业的质量控制策略和供应链组织模式.     

不完全信息环境下具有随机工资和保费返还条款的DC养老金均衡策略

在不完全信息环境下,文章研究了具有随机工资和保费返还条款,且面临通胀风险的DC养老金均衡投资策略.假设养老金参与者连续不断地将其随机工资的固定比例作为保费缴纳到自己的养老金账户,基金经理将保费投资于一个无风险资产,一支股票和一支通胀指数债券以使养老金保值增值.其中股票预期收益率是随机的,并遵循均值回复过程,但基金经理无法直接观测.由于考虑了保费返还条款,则在累积期间死亡的参与者可提取按预先设定利率累积的保费.基金经理的决策目标是使每个幸存参与者养老金的终端价值期望最大化,并最小化终端价值的方差.利用滤波技术和纳什均衡框架,文章得到了DC养老金均衡策略和均衡值函数的解析式.最后,数值算例表明保费返还条款和信息损失都会使基金经理对风险投资更谨慎,但是保费返还条款对通胀指数债券均衡策略的影响更显著,而信息损失对股票均衡策略的影响更显著.     

基于Stackelberg博弈论的边缘计算卸载决策方法

为了解决移动边缘计算中移动用户的计算卸载决策问题,设计了一种基于Stackelberg博弈的卸载决策方法.方法将边缘云和移动用户分别视为博弈主导者和跟随者,边缘云通过对自身计算能力的定价实现有限计算能力下的效用最大化,而移动用户针对边缘云的定价策略,作出数据卸载的相应决策,实现效用最大化,通过单主多从Stackelberg博弈过程中策略的相互影响与进化,实现了双方效用的最优.证明了该Stackelberg博弈存在使得效用最优的纳什均衡解,并提出了一种分布式迭代算法求解博弈双方的纳什均衡解.通过数值分析,证明算法具有很好的收敛性,且分布式博弈算法可以得到比集中式算法更高的效用均值.     

检测水平有限和外部损失分担下的供应链质量控制模型研究

在制造商生产水平和品牌商检测水平共同决定产品质量的供应链系统中,构建了基于品牌商检测水平有限和制造商分担外部损失比例的质量控制模型,得出了不同参数关系下的供应链质量控制博弈的纳什均衡解,刻画了纯战略和混合战略均衡的形成机制,分析了混合策略均衡解与品牌商检测水平和制造商分担外部损失比例这两个参数之间的互动协调策略,并找出了重复博弈下品牌商采取冷酷战略时最优检测概率的影响因素。     

Stationary,completely mixed and symmetric optimal and equilibrium strategies in stochastic games

In this paper, we address various types of two-person stochastic games—both zero-sum and nonzero-sum, discounted and undiscounted. In particular, we address different aspects of stochastic games, namely: (1) When is a two-person stochastic game completely mixed? (2) Can we identify classes of undiscounted zero-sum stochastic games that have stationary optimal strategies? (3) When does a two-person stochastic game possess symmetric optimal/equilibrium strategies? Firstly, we provide some necessary and some sufficient conditions under which certain classes of discounted and undiscounted stochastic games are completely mixed. In particular, we show that, if a discounted zero-sum switching control stochastic game with symmetric payoff matrices has a completely mixed stationary optimal strategy, then the stochastic game is completely mixed if and only if the matrix games restricted to states are all completely mixed. Secondly, we identify certain classes of undiscounted zero-sum stochastic games that have stationary optima under specific conditions for individual payoff matrices and transition probabilities. Thirdly, we provide sufficient conditions for discounted as well as certain classes of undiscounted stochastic games to have symmetric optimal/equilibrium strategies—namely, transitions are symmetric and the payoff matrices of one player are the transpose of those of the other. We also provide a sufficient condition for the stochastic game to have a symmetric pure strategy equilibrium. We also provide examples to show the sharpness of our results.     

直觉模糊多目标二人零和矩阵对策

研究矩阵对策是深入研究对策理论的一个基本途径和重要手段。根据直觉模糊多目标决策和模糊对策理论,研究了支付值为直觉模糊值的多目标二人零和矩阵对策。首先介绍了基于直觉模糊集的多目标二人零和矩阵对策模型,接着提出了求解直觉模糊多目标二人零和矩阵对策的线性规划方法。最后以数例说明本文提出的方法。结果表明该方法能方便地得到对策的均衡策略和均衡解。     

PPP项目中投资者协同行为发生机制及其演化规律研究

在公私合作项目(PPP)项目中,政府和私人投资者可能会采取协同行为来追求自身利益。这就需要对政府和私人投资者的协同行为进行研究,以了解提高项目绩效的基础机制。首先,基于演化博弈模型分析项目投资者策略选择的动态演化过程,据此政府和私人投资者通过交互选择来实现各自的最优策略。其次,通过演化博弈模型分析发现,政府和私人投资者协作管理具有多重复杂路径演化,其稳定策略很大程度上取决于组织的初始状态及相互激励关系。然后,探讨不同情境下投资者的最优策略和有效增强投资者协同行为的利益协调机制。     

Bounded rationality, strategy simplification, and equilibrium

It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that players in a game may desire to balance maximization of payoff with minimization of strategy complexity, Rubinstein and co-authors studied forms of Nash equilibrium where strategies are maximally simplified in that no strategy can be further simplified without sacrificing payoff. Inspired by this line of work, we introduce a notion of equilibrium whereby strategies are also maximally simplified, but with respect to a simplification procedure that is more careful in that a player will not simplify if the simplification incents other players to deviate. We study such equilibria in two-player machine games in which players choose finite automata that succinctly represent strategies for repeated games; in this context, we present techniques for establishing that an outcome is at equilibrium and present results on the structure of equilibria.     

大博弈中Nash均衡的存在性

研究了具有任意多个局中人的非合作博弈(大博弈)中Nash均衡的存在性.将1969年Ma的截口定理推广得到新的截口定理.用这个新的截口定理进一步证明了:1)大博弈中Nash均衡的存在性;2)纯策略集为紧度量空间而且支付函数为连续函数时,连续大博弈中混合策略Nash均衡的存在性.并且存在性定理推出了2010年Salonen的结果,即此研究结果较Salonen的结论更具普遍意义.     

A note on the equilibria of the unbounded traveler’s dilemma

When there is no upward limit on admissible claims, the traveler’s dilemma admits a continuum of symmetric mixed strategy equilibria in addition to the pure strategy equilibrium in which both players ask and obtain the minimum. The payoff of any of these equilibria exceeds the payoff of the pure strategy one and any claim represents an attainable payoff. If the distinction between a large and an unbounded action set is fuzzy, this result can explain some puzzling stylized facts on the behavior of experimental subjects in the game.     

On the existence of approximate equilibrium in pure strategies for a game with incomplete information

The paper deals with a noncooperative game with incomplete information. By means of a purification theorem for vector valued payoff functions a procedure is developed by which players are enabled to replace mixed strategies by pure strategies at an approximate equilibrium point. Further, the problem of existence of an approximate equilibrium point is discussed. Assumptions concerning the payoff functions and information structure are given ensuring both the existence of approximate equilibrium and the workability of the replacement procedure.     

两人进化博弈策略的决定机制与应用研究

通过建立一般情况下的两人进化博弈模型,给出了系统均衡点对应的矩阵行列式和迹表达式的经济含义,分析了16种典型情形下的进化稳定策略,详细讨论了均衡点稳定性分析结果所对应的博弈双方决策过程,从策略权衡的视角揭示了策略选择的内在机制。研究结果表明:不同策略前提下的相对净支付决定了系统的进化稳定策略,对方的策略选择以及自身可选策略的支付比较是影响博弈主体策略选择的两个基本要素,博弈主体会趋向于选择在对方策略既定下能够带来更大支付的策略。最后以环境治理中地方政府与企业以及地方政府之间的博弈关系为例,从对称博弈和非对称博弈两方面阐明了本文所构建模型在政策设计中的应用价值:针对不同案例,只要明确了两人博弈的支付矩阵,就可以通过计算相对净支付确定博弈双方的行为演化规律和稳定策略,从而简化计算过程,更加直接和更为便捷地为政策设计提供理论参考。     

Definition and properties of cooperative equilibria in a two-player game of infinite duration

A two-player multistage game, with an infinite number of stages is considered. The concepts of overtaking and weakly overtaking payoff sequences are introduced. The class of strategies considered consists of memory strategies, which are based on the past history of the control and the initial state from where the game has been played. Weak equilibria are defined in this class of strategies. It is then shown how such equilibria can be constructed by composing into a trigger strategy a nominal cooperative control sequence and two threat strategies representing the announced retaliation by each player in the case where the other player does not play according to the nominal control. When the threats consists of a feedback equilibrium pair, the resulting cooperative equilibrium is perfect. Another result shows that, if each player can use a most effective threat based on a saddle-point feedback strategy, then any weak equilibrium in the class of memory strategies is in some sense related to this particular kind of equilibrium in the class of trigger strategies.Dedicated to G. LeitmannThis research was supported by SSHRC Grant No. 410-81-0722 and FCAC Grant No. EQ-428 to the first author. This research has also been made possible by a financial support from the University of Puerto Rico.     

Optimal strategic reasoning with McNaughton functions

The aim of the paper is to explore strategic reasoning in strategic games of two players with an uncountably infinite space of strategies the payoff of which is given by McNaughton functions—functions on the unit interval which are piecewise linear with integer coefficients. McNaughton functions are of a special interest for approximate reasoning as they correspond to formulas of infinitely valued Lukasiewicz logic. The paper is focused on existence and structure of Nash equilibria and algorithms for their computation. Although the existence of mixed strategy equilibria follows from a general theorem (Glicksberg, 1952) [5], nothing is known about their structure neither the theorem provides any method for computing them. The central problem of the article is to characterize the class of strategic games with McNaughton payoffs which have a finitely supported Nash equilibrium. We give a sufficient condition for finite equilibria and we propose an algorithm for recovering the corresponding equilibrium strategies. Our result easily generalizes to n-player strategic games which don't need to be strictly competitive with a payoff functions represented by piecewise linear functions with real coefficients. Our conjecture is that every game with McNaughton payoff allows for finitely supported equilibrium strategies, however we leave proving/disproving of this conjecture for future investigations.