基于合作博弈的易腐性产品运输设施选择的费用分配

易腐性产品的价值会随着时间而损失,运输易腐性产品时,客户除了支付运输费用外还需要承担产品的价值损失。本文把易腐性产品的价值损失和运输费用之和作为总费用,应用合作博弈理论,把易腐性产品的运输设施选择的费用分配问题构造成费用分配博弈,证明了在易腐性产品线性价值损失的情况下,运输设施选择博弈的核心非空,且为子模博弈,并讨论核仁、夏普利值、τ-值等解。论文最后讨论了有约束运输的设施选择的费用分配博弈的解的情况,说明其核心也许为空,并提出了进一步研究的方向。     

非合作-合作两型博弈的Shapley值纯策略纳什均衡解求解方法

在合作中又有竞争的"经济全球化"时代背景下,经济实体之间越来越多地体现出竞争与合作交织的特点,既有策略的选择,同时也有利益的分配或者成本的分摊,即竞争与合作相互联系。为此,Brandenburger和Stuart提出了非合作-合作两型博弈模型为这类博弈提供了有效的工具。目前非合作-合作两型博弈研究较少,且Brandenburger和Stuart提出的非合作-合作两型博弈存在一些不足：合作博弈用核心求解可能为空或者不唯一。Shapley值是一种重要的合作博弈单值解,满足匿名性、有效性、可加性和虚拟性,表达形式简单且唯一,对一些成本分摊问题和利益分配问题,给决策者提供了一个公平满意的分配方案。因此本文研究将Shapley值作为合作博弈的解时非合作-合作两型博弈解存在的条件。为了分析本文提出的基于Shapley值的非合作-合作两型博弈的新理论框架,首先给出了其特征函数满足的联盟无外部性条件。在满足此条件下,我们进一步证明了非合作-合作两型博弈解存在的条件及性质。结合数值实例比较分析合作博弈用核心和Shapley值求解非合作-合作两型博弈解的优缺点。研究表明：当用Shapley值求解合作博弈解,降低了非合作-合作两型博弈解存在条件。因此,本文的研究不仅弥补了Brandenburger和Stuart提出的非合作-合作两型博弈中合作博弈的核心为空或者不唯一的情况,而且为非合作-合作两型博弈的解提供新的理论框架,从而为既有竞争又有合作的博弈问题提供新的求解方法,因此,本文的研究具有一定的理论价值和应用价值。     

A Game Theory Approach for Assessment of Risk and Deployment of Police Patrols in Response to Criminal Activity in San Francisco

An efficient police patrol schedule must ensure the allocation of an appropriate number of officers sufficient to respond to the danger of criminal incidents, particularly in an urban environment, even when the available number of personnel is limited. This study proposes a framework that incorporates two game theory models designed for the allocation of police officers to patrol shifts. In the first step, the interactions of three factors between the criminal and the operation captain are modeled as a zero-sum, noncooperative game, after which a mixed strategy Nash equilibrium method is used to derive the risk value for each district to be patrolled. In the second step, the risk values are used to compute the Shapley value for all 10 districts, for three different threat levels. A fair allocation of police personnel based on the Shapley value is made with a minimum set of personnel deployment costs. The efficacy of the proposed method is verified using openly available data from the San Francisco City Police detailing incidents from the year 2016. The experimental results show that police planners can use this framework to quantitatively evaluate the criminal threat in each district when deciding upon the deployment of patrol officers for three shifts per day.     

Social Indeterminacy

An extension of Condorcet's paradox by McGarvey (1953) asserts that for every asymmetric relation R on a finite set of candidates there is a strict‐preferences voter profile that has the relation R as its strict simple majority relation. We prove that McGarvey's theorem can be extended to arbitrary neutral monotone social welfare functions that can be described by a strong simple game G if the voting power of each individual, measured by the Shapley–Shubik power index, is sufficiently small. Our proof is based on an extension to another classic result concerning the majority rule. Condorcet studied an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is p>1/2. Condorcet's jury theorem asserts that if the number of voters tends to infinity then the probability that the first candidate will be elected tends to one. We prove that this assertion extends to a sequence of arbitrary monotone strong simple games if and only if the maximum voting power for all individuals tends to zero.     

On the Discrete Version of the Aumann–Shapley Cost‐Sharing Method

Each agent in a finite set requests an integer quantity of an idiosyncratic good; the resulting total cost must be shared among the participating agents. The Aumann–Shapley prices are given by the Shapley value of the game where each unit of each good is regarded as a distinct player. The Aumann–Shapley cost‐sharing method charges to an agent the sum of the prices attached to the units she consumes. We show that this method is characterized by the two standard axioms of Additivity and Dummy, and the property of No Merging or Splitting: agents never find it profitable to split or to merge their consumptions. We offer a variant of this result using the No Reshuffling condition: the total cost share paid by a group of agents who consume perfectly substitutable goods depends only on their aggregate consumption. We extend this characterization to the case where agents are allowed to consume bundles of goods.     

模糊合作对策的Shapley值

考虑合作对策中支付函数是模糊数的情形,利用模糊数学相关理论,对Shapley提出的三条公理进行拓广,并构造了模糊Shapley值.针对局中人在合作完成后需要对具体的联盟收益进行分配的情况,文中利用构造的模糊Shapley值隶属函数给出了确定的收益分配方案.最后将该方法应用到动态联盟伙伴企业收益分配的实例中.     

基于EOQ的集成供应成本分摊问题研究

第三方物流的集成供应是降低供应链成本的有效途径,而集成供应成本在各供应商企业之间的分摊是需要解决的核心问题.本文详细阐述了第三方物流的集成供应问题,基于合作博弈理论建立了第三方物流集成供应的成本分摊模型.在采用夏普利值法对该模型进行求解的过程中,针对夏普利值法难以赋值的问题,引入集成供应的经济订货批量模型,有效解决了了第三方物流供应成本分摊问题.最后,用算例对该方法进行了说明.     

具有联盟优先关系的模糊合作博弈的目标规划求解模型

用合作博弈研究实际管理问题中的分配方案时，常常存在一些不重要联盟或无效联盟，这些联盟影响公平合理的分配方案。因此，联盟的重要程度成为求解合作博弈必不可少的因素。本文考虑了联盟的重要性和局中人参与联盟的不确定性，研究了具有优先关系的模糊联盟合作博弈(简称为模糊合作博弈)。首先，借助于目标规划模型的优先因子可以表征联盟重要程度的思想，通过构建多优先级目标规划模型，得到模糊合作博弈新的解。其次，证明了构建的多优先级目标规划模型的解和模糊合作博弈的核心之间具有重要对应关系。最后，通过数值实例和比较分析，说明本文提出的多优先级目标规划模型求解模糊合作博弈问题的合理性和有效性。研究表明：(1)本文提出的多优先级目标规划模型考虑不同联盟重要程度，得到的解符合“多劳多得”原则，能够更公平合理解决实际管理中的分配问题。(2)本文的目标规划模型同时适用于求解存在联盟特征函数值缺失的合作博弈。与已有合作博弈的解进行比较分析，该模型无需估算无效联盟的特征函数缺失数据得到的分配值更为准确。从而，说明本文给出的目标规划求解模糊合作博弈解的模型，更符合许多管理学问题的实际情况。(3)通过多优先级目标规划模型最优解是否存在可判断模糊合作博弈的核心存在情况，若核心存在则该模型通过目标规划软件包可得到核心内的一个解，这样也得到了一个判断合作博弈核心是否存在的标准。(4)目标规划模型可弥补已有合作博弈解的一些不足，如核心可能为空集，Shapley值和最小二乘预核仁可能不满足个体合理性等。本文构建的多优先级目标规划模型不仅能求解联盟具有优先关系的模糊合作博弈，而且能够求解一般合作博弈的解，该目标规划模型作为合作博弈一种新的求解方法，能更有效地解决实际管理中的分配问题，具有更加广泛的应用价值。     

协作车辆路径成本分摊问题的 B-T Shapley 方法

多个企业协作配送能显著地降低物流配送成本和减少尾气排放, 研究协作配送模型与成本分摊方法是亟需解决的关键问题.传统经典成本分摊方法需要计算所有子联盟的协作成本, 在本问题中等价于需要求解2N-1个 (N为企业数量) 复杂的车辆路径问题.本文建立了多方协作车辆路径问题模型, 分析了协作配送成本分摊问题的属性.基于经典的Shapley成本分摊方法, 提出了B-T (Binary Tree) Shapley近似方法, 不仅将成本分摊本身计算复杂度由O (N22N) 降为O (N2log2N) , 而且将需要求解的车辆路径问题数量由2N-1个锐减至2N-1个, 从而能够在合理时间内完成协作配送问题的成本分摊.通过求解算例和实际案例, 计算结果表明, B-T Shapley的耗时与Shapley方法相比几乎可以忽略不计, 更重要的是B-T Shapley与Shapley的成本分摊结果之间仅有细微的偏差, 其平均准确度可以达到95%左右.     

Backward Induction Foundations of the Shapley Value

We present a noncooperative game model of coalitional bargaining, closely based on that of Gul (1989) but solvable by backward induction. In this game, Gul's condition of “value additivity” does not suffice to ensure the existence of a subgame perfect Nash equilibrium that supports the Shapley value, but a related condition—“no positive value‐externalities”—does. Multiple equilibria can arise only in the event of ties, and with a mild restriction on tie‐break rules these equilibria all support the Shapley value.     

基于Choquet延拓n人模糊对策的Shapley值

由于n人对策任意联盟可由它的特征向量来等价地表示,利用Choquet积分,将n人对策从集合{0,1}n延拓到[0,1]n上,通过建立公理化体系,对具有Choquet延拓形式n人模糊对策的Shapley值进行深入研究,证明了这类n人模糊对策Shapley值存在性与惟一性,并给出了此模糊对策Shapley值的解释表达式.最后将此模糊对策的Shapley值作为收益分配方案应用到供应链协作企业收益分配的实例中.     

联合订货区间值EOQ模型及变权Shapley值成本分摊方法

研究多个销售商企业组成联盟向一个供应商订购同种商品的联合订货问题。考虑到实际问题中很难预测到精确的需求，本文用区间表示单位时间需求量，研究允许缺货的销售商企业联合订货区间值EOQ模型，其中缺货完全回补。以联合订货平均成本最小为目标，结合连续有序加权集结算子求解出联合订货的周期、区间值订货量和区间值平均成本。定义变权Shapley值，给出区间值合作博弈的区间值变权Shapley值的求解方法，得出区间值变权Shapley值的表达式可直接利用相关联盟值的左、右端点计算得到。考虑联盟和局中人的相对重要性，结合需求率确定合成权重，提出基于区间值变权Shapley值的联合订货成本分摊方法。利用数值算例验证模型和方法的有效性。本文可为解决联合订货成本分摊问题提供决策参考。     

A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models

This study proposes a framework for the main parties of a sustainable supply chain network considering lot-sizing impact with quantity discounts under disruption risk among the first studies. The proposed problem differs from most studies considering supplier selection and order allocation in this area. First, regarding the concept of the triple bottom line, total cost, environmental emissions, and job opportunities are considered to cover the criteria of sustainability. Second, the application of this supply chain network is transformer production. Third, applying an economic order quantity model lets our model have a smart inventory plan to control the uncertainties. Most significantly, we present both centralized and decentralized optimization models to cope with the considered problem. The proposed centralized model focuses on pricing and inventory decisions of a supply chain network with a focus on supplier selection and order allocation parts. This model is formulated by a scenario-based stochastic mixed-integer non-linear programming approach. Our second model focuses on the competition of suppliers based on the price of products with regard to sustainability. In this regard, a Stackelberg game model is developed. Based on this comparison, we can see that the sum of the costs for both levels is lower than the cost without the bi-level approach. However, the computational time for the bi-level approach is more than for the centralized model. This means that the proposed optimization model can better solve our problem to achieve a better solution than the centralized optimization model. However, obtaining this better answer also requires more processing time. To address both optimization models, a hybrid bio-inspired metaheuristic as the hybrid of imperialist competitive algorithm (ICA) and particle swarm optimization (PSO) is utilized. The proposed algorithm is compared with its individuals. All employed optimizers have been tuned by the Taguchi method and validated by an exact solver in small sizes. Numerical results show that striking similarities are observed between the results of the algorithms, but the standard deviations of PSO and ICA–PSO show better behavior. Furthermore, while PSO consumes less time among the metaheuristics, the proposed hybrid metaheuristic named ICA–PSO shows more time computations in all small instances. Finally, the provided results confirm the efficiency and the performance of the proposed framework and the proposed hybrid metaheuristic algorithm.

     

基于优化Shapley值的产学研网络型合作利益协调机制研究——以产业技术创新战略联盟为例

随着复杂产品协同研制的兴起,以往的线型化产学研合作模式已难以适应现行的创新活动,正逐渐被网络化模式所替代。这种网络型合作模式还处于起步阶段,在跨组织协同管理、人才集聚、知识有效流动、利益分配等方面存在不少问题。本文以产业技术创新战略联盟为例,基于契约设计理论,研究创新主体在合作过程中的利益协调问题。对Shapley值进行优化,讨论在面对道德风险情况下,如何利用网络协同系数对奖励支付进行协调,以使创新主体利益分配更公平、更合理。同时,将这一协调机制设计进利益分配中,以达到应有的激励目的。     

Population monotonicity in matching games

The matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population monotonic allocation scheme is a collection of rules defining how to share the profit among players in each coalition such that every player is better off when the coalition expands. In this paper, we study matching games and provide a necessary and sufficient characterization for the existence of population monotonic allocation schemes. Our characterization implies that whether a matching game admits population monotonic allocation schemes can be determined efficiently.

     

面向价值网络的企业协同竞争博弈模型研究

运用演化博弈理论的方法,分析价值网络模式下企业的协同竞争机制,构建企业主体间协同竞争的演化博弈模型,指出价值网络模式下企业协同竞争行为的博弈过程及特点,揭示出系统的初始状态、发展阶段及利益分配机制对演化博弈过程的影响机理。     

Duality Approaches to Economic Lot‐Sizing Games

Sharing common production, resources, and services to reduce cost are important for not for profit operations due to limited and mission‐oriented budget and effective cost allocation mechanisms are essential for encouraging effective collaborations. In this study, we illustrate how rigorous methodologies can be developed to derive effective cost allocations to facilitate sustainable collaborations in not for profit operations by modeling the cost allocation problem arising from an economic lot‐sizing (ELS) setting as a cooperative game. Specifically, we consider the economic lot‐sizing (ELS) game with general concave ordering cost. In this cooperative game, multiple retailers form a coalition by placing joint orders to a single supplier in order to reduce ordering cost. When both the inventory holding cost and backlogging cost are linear functions, it can be shown that the core of this game is non‐empty. The main contribution of this study is to show that a core allocation can be computed in polynomial time under the assumption that all retailers have the same cost parameters. Our approach is based on linear programming (LP) duality. More specifically, we study an integer programming formulation for the ELS problem and show that its LP relaxation admits zero integrality gap, which makes it possible to analyze the ELS game by using LP duality. We show that there exists an optimal dual solution that defines an allocation in the core. An interesting feature of our approach is that it is not necessarily true that every optimal dual solution defines a core allocation. This is in contrast to the duality approach for other known cooperative games in the literature.     

Bargaining and Cooperation in Strategic Form Games

In this paper we view bargaining and cooperation as an interaction superimposed on a game in strategic form. A multistage bargaining procedure for N players, the “proposer commitment” procedure, is presented. It is inspired by Nash's two‐player variable‐threat model; a key feature is the commitment to “threats.” We establish links to classical cooperative game theory solutions, such as the Shapley value in the transferable utility case. However, we show that even in standard pure exchange economies, the traditional coalitional function may not be adequate when utilities are not transferable. (JEL: C70, C71, C78, D70)     

供应链不同合作模式下合作利益分配机制研究——以煤电企业供应链为例

供应链合作模式直接决定合作利益形成机理,并由此影响合作利益分配,针对不同合作模式研究合作利益分配机制十分必要。根据煤电企业供应链合作实际,运用无限阶段讨价还价博弈方法建立了基于利润分配因子的合作利益分配模型,该模型适合一方向另一方投资的合作利益分配;运用Shapley值法和风险期望原理,建立了基于合作贡献和风险补偿原则确定的合作利益分配模型,该模型适合对长期合同、战略合作等合作利益分配。本文研究结果不仅对煤电企业,而且对其他生产商与供应商之间的供应链合作利益分配机制的建立具有指导意义。     

基于Shapley值法的动态联盟伙伴企业利益分配策略

动态联盟被认为是21世纪最有前途的企业组织模式,它增强了企业自身的竞争力,使企业能更好地应对市场的不确定性。然而作为一种崭新的组织形态,它仍有许多问题值得研究。利益分配就是其中之一。本文首先介绍了用于解决多人合作对策问题的Shapley值法,并将之应用于动态联盟伙伴企业的利益分配,然后分析了用Shapley值法进行动态联盟利益分配的成功与不足,最后针对其不足提出了一种基于风险因子的修正算法。