公共物品私人供给的纳什均衡分析

按私人供给的决定方式,公共物品可以划分为三类,替代型、互补型和包含型。本采用博弈论的方法,通过模型对三种情况下参与方的供给决策行为进行分析,并求出纳什均衡解,章最后讨论了所求解的合理性,并通过比较提出了一些有益的结论和启示。     

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

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

不完备偏好扩展式博弈的序贯均衡

将Kreps和Wilson提出的序贯均衡解概念推广到了存在不完备偏好的情形.首先给出了一个修正的颤抖手完美均衡的概念,然后应用它去证明不完备偏好扩展式博弈序贯均衡的存在性.     

On the Convergence to Nash Equilibrium in Problems of Distributed Computing

This paper studies two problems that arise in distributed computing. We deal with these problems from a game theoretical approach. We are interested in the convergence to the Nash equilibrium of algorithms based on the best reply strategy in a special case of linear costs. We present three specific types of algorithm that converge to the equilibrium. In our first model, composed of two processors, the convergence is established through monotonicity of the sequence of updates generated by each of the three algorithms. In the second model, made up of N processors, the convergence is due to the contraction of the algorithms.     

约束形式下广义最大元Nash均衡的存在性

运用广义最大元方法在非传递性偏好下给出了博弈均衡的存在性定理,推广了一些经典的博弈均衡存在性定理.在文中介绍策略式博弈的Nash均衡具有宽泛的条件,在微观经济理论中有广泛的应用.     

价格歧视下四种市场的均衡产量和价格

在线性需求函数条件下,对1个垄断厂商市场情形用微分法,对,1个厂商市场情形用完全信息静态博弈的方法,对实施二度价格歧视时均衡产量和价格的确定进行了研究,给出了市场均衡歧视产量,均衡歧视价格和均衡歧视总收益的统一的计算公式,并分析了其性质.     

相位阻尼信道条件下量子斗鸡博弈模型均衡解分析

利用量子博弈的相关理论,以噪音强度和记忆强度为参量,建立了相位阻尼信道条件下的量子斗鸡博弈模型,求出了模型的量子纳什均衡解,讨论了两参量对均衡解稳定性的影响,得出在无记忆相位阻尼信道条件下,当噪音强度小于阈值0.24时,纳什均衡仍然为帕累托最优解,当噪音强度大于0.24时,均衡解演变为另2个均衡解,不再是帕累托最优;在有记忆相位阻尼信道条件下,当噪音强度小于0.24,且记忆强度大于0.5时,均衡解是稳定的.特殊地,当信道是完全记忆时,均衡解的稳定性与噪音强度无关.     

求2~3-三矩阵对策Nash平衡解的方法

提出了求2~3-三矩阵对策Nash平衡解的方法.     

Equilibrium analysis in batch-arrival queues with complementary services

This paper studies a batch-arrival queue with two complementary services. The two services are complementary and any customer has no benefit from obtaining just one of them. To the best of the authors’ knowledge, there are no works contributed to the batch-arrival queues on analysis of the equilibrium behaviors in queueing systems by now. The properties of batch-arrival queues, which is more practical and universal in reality, induce different Nash equilibria under competition or monopoly compared with the single-arrival queues. We observe the joint effect of batch joining rate and cost structure on the behavior of customers and graphically interpret the equilibrium solutions under competition. Moreover, we discuss the model under three types of price structures and give comparisons from customer and server points.     

Monotone Control of Queueing Systems with Heterogeneous Servers

A multi-server controllable queueing system with heterogeneous servers is considered. Several monotonicity properties of optimal policies for such a system are proved.     

基于学习的互利协调与互制均衡及其矢量分析

纳什均衡代表了博弈参与人如何博弈的一致性预测.但是,有限理性的博弈者一般不会在一次博弈中取得一致性预期,他们总是通过不断的重复学习,使得预期逐渐向均衡方向演化.对互利协调与互制均衡进行分析,并探讨协调和均衡的动态形成机理.互制均衡强调自我实现,倾向个体利益最优.互利协调在强调自我实现的基础上,注重双赢,引导合作.现代博弈学习理论正是从有限理性的实际出发,通过学习和进化,最终实现博弈的均衡或协调.这对于如何走出传统博弈的困境具有重要意义.     

可修排队系统可靠性指标的分解特性

本文提出了分析可修排队系统的另一途径-分解法,剖析了一些典型可修排队系统的结构,即是经典排队系统模型与经典可靠性系统模型的一种卷积关系.应用提出的分解分析法,我们不仅可推导出在交通强度ρ<1时的有关结果,而且可得到在交通强度ρ≥1时的有关结果和一些重要的分解关系式.它使得我们把对可修排队系统的研究,转化为分别对经典排队系统与经典可靠性系统的研究,降低了对可修排队系统研究的难度.     

多目标决策问题的博弈论方法初探

本通过对多目标决策中常用解法的改进，提出了运用博弈论的方法求解多目标评价的思想，讨论了相互冲突的目标决策和非合作博弈问题中的三种类型，并给出了相应的求解路径。     

A two-population game in observable double-ended queuing systems

In this study, the existing game theoretical framework is extended to strategic queuing in search of solutions for a two-population game in observable double-ended queuing systems with zero matching times. We show that multiple Nash equilibria and one unique subgame perfect Nash equilibrium exist in this game.     

On the Full Idle Time in Multiphase Queueing Systems

The modern queueing theory is a powerful tool for a quantitative and qualitative analysis of communication systems, computer networks, transportation systems, and many other technical systems. The paper is designated to the analysis of queueing systems arising in the network theory and communications theory (such as the so-called multiphase queueing systems, tandem queues, or series of queueing systems). We present heavy traffic limit theorems for the full idle time in multiphase queueing systems. We prove functional limit theorems for values of the full idle time of a queueing system, which is its important probability characteristic. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 367–386, July–September, 2005.     

M/M/C休假排队系统-综述

本文介绍了带有各种休假策略的Ｍ／Ｍ／Ｃ休假排队的研究方法及结果,在所有服务台全的条件下,我们证明了系统的稳态队长和稳态等待时间可分解成两个独立随机变量和和,其中一个随机变量愉是相应的经典Ｍ／Ｍ／Ｃ排队的稳态队长与稳态等待时间。     

Infinite horizon noncooperative differential games with nonsmooth costs

For a noncooperative differential game, the value functions of the various players satisfy a system of Hamilton-Jacobi equations. In the present paper, we study a class of infinite-horizon scalar games with either piecewise linear or piecewise smooth costs, exponentially discounted in time. By the analysis of the value functions, we find that results about existence and uniqueness of admissible solutions to the HJ system, and therefore of Nash equilibrium solutions in feedback form, can be recovered as in the smooth costs case, provided the costs are globally monotone. On the other hand, we present examples of costs such that the corresponding HJ system has infinitely many admissible solutions or no admissible solutions at all, suggesting that new concepts of equilibria may be needed to study games with general nonlinear costs.     

Strong stability of Nash equilibria in load balancing games

We study strong stability of Nash equilibria in load balancing games of m(m 2)identical servers,in which every job chooses one of the m servers and each job wishes to minimize its cost,given by the workload of the server it chooses.A Nash equilibrium(NE)is a strategy profile that is resilient to unilateral deviations.Finding an NE in such a game is simple.However,an NE assignment is not stable against coordinated deviations of several jobs,while a strong Nash equilibrium(SNE)is.We study how well an NE approximates an SNE.Given any job assignment in a load balancing game,the improvement ratio(IR)of a deviation of a job is defined as the ratio between the pre-and post-deviation costs.An NE is said to be aρ-approximate SNE(ρ1)if there is no coalition of jobs such that each job of the coalition will have an IR more thanρfrom coordinated deviations of the coalition.While it is already known that NEs are the same as SNEs in the 2-server load balancing game,we prove that,in the m-server load balancing game for any given m 3,any NE is a(5/4)-approximate SNE,which together with the lower bound already established in the literature yields a tight approximation bound.This closes the final gap in the literature on the study of approximation of general NEs to SNEs in load balancing games.To establish our upper bound,we make a novel use of a graph-theoretic tool.     

促进技术成果转化长期合作的重复博弈分析

本通过对目前中国技术创新工程中。国内技术市场成果转化过程的分析，利用重复博弈的方法进行分析。提出了建立长期合作的成果转化机制，大大有利于提高技术成果的技术含量及其转化的程度，促进研制技术成果的科研院所与利用技术成果创造效益的企业的共同发展。     

奇异双线性系统二次型微分博弈的鞍点均衡

研究了有限时间段内的奇异双线性二次型性能指标的鞍点均衡问题. 针对问题求解的复杂性,引入降阶变换将问题分解为快、慢两个子系统,然后利用极大值原理求得了系统的最优控制策略.最后给出了数值算例的仿真以验证算法的正确性和有效性.