一类包含刻板用户的Wardrop路由博弈

在平行边网络的背景下,考虑包含刻板用户的Wardrop路由博弈.针对线性函数下最大费用边模型和M/M/1型函数下用户和函数模型,分别给出了调和率(price of anarchy)的上界.     

共享经济中员工-企业关系演化博弈分析—基于平台用户监管视角

共享经济打破了传统的雇佣关系,本文旨在探讨共享经济背景下平台企业与员工关系的演化机制,通过引入平台用户监管,运用演化博弈思想,构建了平台型员工企业关系治理演化博弈模型,并进行了仿真分析。演化结果表明,员工合规行为与平台企业控制策略的选择取决于平台用户的监管力度,而且强化用户监督有助于促使平台企业加强监管并改善员工的行为规范。因此平台企业在制度设计中应充分发挥平台用户的监管效用,实现相互信任、和谐的员工企业关系。     

不同回收模式下用户隐私关切对闭环供应链决策的影响

在手机类废旧电子产品的回收活动中,用户对个人隐私关切度的加深会影响闭环供应链成员的决策.基于此,通过刻画用户隐私关切度等因素,构建基于制造商回收、二手商回收和混合回收模式的三个博弈模型,研究其对闭环供应链成员决策的影响.研究表明:用户隐私关切度增加可促进制造商和零售商的利润,但会降低二手商的利润;制造商回收模式下的供应...     

调和H~p空间和混合范数空间

设Ｄ是一具有Ｃ边界的有界区域．本文就Ｄ上的调和Ｈａｒｄｙ空间和调和混合范数空间,建立了若干互相之间的连续嵌入定理．     

界定用户平衡及Logit型随机用户平衡下的混合平衡交通网络效率损失

考虑一个具有两类用户的交通网络,一类用户按照用户平衡原则选择出行路径,另一类用户按照Logit型随机用户平衡原则选择出行路径.建立了描述这种混合平衡出行行为的变分不等式模型,给出了满足此种混合平衡的交通网络效率损失上界,结果表明,效率损失上界与被研究的交通网络拓扑结构,交通需求及两类用户的划分比例系数有关.     

界定Stackelberg博弈下的混合平衡交通网络效率损失

考虑一个受控制的交通网络,一类用户属于领导者,按照系统最优原则选择出行路径;另一类用户属于跟随者且具有不完全信息,按照Logit型随机用户平衡原则选择出行路径.建立了描述这种Stackelberg博弈下的混合平衡出行行为的变分不等式模型,给出了满足此种混合平衡的交通网络的效率损失上界,结果表明,效率损失上界与被研究的交通网络拓扑结构,交通需求及控制系数有关.     

ATIS和道路收费下的混合随机用户均衡的效率损失

在ATIS作用下的交通网络中,用户在交通信息的接受程度上是异质的;考虑到装有ATIS的用户并不总是遵循ATIS的建议,因此,引入信息遵从率这一参数,将所有用户分为三类:安装并遵从信息、安装但不遵从信息和不安装的用户;均按照随机用户均衡的方式进行择路,但对出行时间有不同的感知。同时考虑存在道路收费的情形下,用户在时间价值上是异质的。综合考虑交通信息与道路收费的影响,基于用户两方面的异质性,对其进行合理分类,构建了多用户多准则的混合随机均衡模型及其等价的变分不等式;当收费不作为系统总成本的一部分时,建立了时间准则与费用准则下的系统最优模型;在此基础之上,分别研究了两种准则下混合均衡相对于系统最优的效率损失,给出了效率损失上界,并进一步分析了效率损失上界与各参数间的关系;交通管理者可以从道路收费策略的实施、信息诱导系统的完善等角度进行路网的改造和优化设计。     

随机波动率环境下企业内生破产的期权博弈分析

将企业破产作为委托人-代理人的博弈问题,应用期权博弈分析的方法讨论此问题．在企业的资产价值的波动率服从快速均值回复OU过程的假设下,导出各博弈方的权益满足的偏微分方程,利用Taylor级数展开及求解一组Poisson方程的技巧,得到各博弈方的价值表达式．进而,讨论各博弈方的破产决策;企业的投资决策;融资决策以及贷方避免在破产时遭受损失的激励合同．最后,总结波动率的随机性对文献结论的影响．     

政府不同策略下用户创新知识交互差异化研究

知识交互是用户创新的重要环节,基于知识基础观和博弈论,考虑政府在用户创新中对企业与用户知识交互的激励作用,构建“政府-企业-用户”三方演化博弈模型,探讨政府不同策略下企业与用户之间知识交互行为的演化路径,分析不同约束条件下主体策略选择情况,并进行数值模拟。研究结果表明:政府政策激励在推动用户创新知识交互过程中有重要作用。当企业与用户知识交互紧密时,政府趋向于采取支持策略。当企业与用户知识交互收益小于某一阈值时,政府支持是决定用户创新知识交互的关键变量。当企业与用户知识交互收益处于某个范围时,政府支持并不会显著影响企业和用户的知识交互行为。     

TOADER型平均的调和与NEUMAN平均凸组合界

研究了TOADER型平均和调和平均与NEUMAN平均凸组合的序关系,运用单调性L’HOSPITAL法则,证明了TOADER型平均关于调和与NEUMAN平均凸组合的确界．作为应用,分别给出了第二类完全椭圆积分关于反双曲正弦和反正切函数的两个不等式．所得结果是对一些己知结果的改进．     

LP-Based Heuristic Algorithms for Interconnecting Token Rings via Source Routing Bridges

We develop a method to determine the topology of a network that interconnects a number of token rings using source routing bridges. The purpose is to compute a topology that provides low response delays for network users at a minimal cost of bridge installations. We formulate this network design problem as a mixed binary integer linear program. We develop effective heuristic algorithms. The algorithms exploit the topology and routing solutions of the linear programming relaxation in a sophisticated manner which we believe is new in the literature. The model incorporates performance issues, such as network stability, bridge overflow, back pressure effect and broadcast storm, that are specific to the underlying communication technology. By formally incorporating these performance issues, we tighten the model formulation and improve the quality of the LP bound considerably. Computational results are reported for problems with up to 20 token rings and 190 potential bridge locations.     

An analytical bound on the fleet size in vehicle routing problems: A dynamic programming approach

We present an analytical upper bound on the number of required vehicles for vehicle routing problems with split deliveries and any number of capacitated depots. We show that a fleet size greater than the proposed bound is not achievable based on a set of common assumptions. This property of the upper bound is proved through a dynamic programming approach. We also discuss the validity of the bound for a wide variety of routing problems with or without split deliveries.     

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

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

Locating median cycles in networks

In the median cycle problem the aim is to determine a simple cycle through a subset of vertices of a graph involving two types of costs: a routing cost associated with the cycle itself, and the cost of assigning vertices not on the cycle to visited vertices. The objective is to minimize the routing cost, subject to an upper bound on the total assignment cost. This problem arises in the location of a circular-shaped transportation and telecommunication infrastructure. We present a mixed integer linear model, and strengthen it with the introduction of additional classes of non-trivial valid inequalities. Separation procedures are developed and an exact branch-and-cut algorithm is described. Computational results on instances from the classical TSP library and randomly generated ones confirm the efficiency of the proposed algorithm. An application related to the city of Milan (Italy) is also solved within reasonable computation time.     

带参量的非合作装箱博弈

带参量的非合作装箱博弈是指:每个物品的尺寸都介于0和参量x(0相似文献   

The Problem of Capacity Addition in Multi-user Elastic Demand Communication Networks

In this paper we consider some properties on prices under flow control in a network that is to be shared by noncooperative users. Each user is faced with an optimization problem which is formulated as the minimization of its own criterion subject to constraint on the flows of the other users. The operating points of the network are the Nash equilibria of the underlying routing game. Our objective is to study the behavior of prices of all users when the network designer needs to allocate capacities to network links. For parallel links topologies, we show that degradation of the performances such as prices will not take place, as well as the users may find it beneficial to improve their requests     

ATIS和道路收费下混合SUE相对于SSO的效率损失

在ATIS和道路收费共同作用的异质性交通网络中,基于用户在信息接受程度与时间价值上的异质性,对用户进行合理分类,所有用户均按照随机方式进行择路.构建了多用户混合随机均衡等价的变分不等式模型,以及多用户随机社会最优模型.以用户感知的总出行成本作为系统性能评价的指标,当收费作为系统总成本的一部分时,分别在时间准则与费用准则下研究了多用户混合随机均衡相对于随机社会最优的绝对效率损失问题.研究结果表明,时间准则下的绝对效率损失上界与路段出行时间函数和混合随机均衡时系统的实际总出行时间有关,费用准则下的绝对效率损失上界还与出行者的社会经济特性和随机社会最优时系统的实际总出行时间有关.     

Equilibria for networks with malicious users

We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavior. While selfish users follow a strategy that minimizes their individual cost, a malicious user will use his flow through the network in an effort to cause the maximum possible damage to the overall cost. We define a generalized model, present characterizations of flows at equilibrium and prove bounds for the ratio of the social cost of a flow at equilibrium over the cost when centralized coordination among users is allowed. An extended abstract of this work appeared in the Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC) 2003. G. Karakostas’ research was supported by an NSERC Discovery research grant and MITACS. Part of this research was done when Viglas was a postdoctoral fellow at the University of Toronto, Canada.     

On the rate of convergence of the St. Petersburg game

We investigate the repeated and sequential portfolio St. Petersburg games. For the repeated St. Petersburg game, we show an upper bound on the tail distribution, which implies a strong law for a truncation. Moreover, we consider the problem of limit distribution. For the sequential portfolio St. Petersburg game, we obtain tight asymptotic results for the growth rate of the game.