Defensive weapons and star wars: a supergame with optimal punishments

We model the perspective faced by nuclear powers involved in a supergame where nuclear deterrence is used to stabilise peace. This setting allows us to investigate the bearings of defensive weapons on the effectiveness of deterrence and peace stability, relying on one-shot optimal punishments. We find that the sustainability of peace is unaffected by defensive shields if the latter are symmetric across countries, while asymmetric endowments of such weapons have clear-cut destabilising consequences.     

灰色矩阵对策

本文结合灰色系统与对策论的知识,给出了以区间型灰数为元素的灰矩阵对策的定义,讨论了灰矩阵对策在纯策略与混合策略意义下的最优策略及灰解的存在性。     

Cost allocation rules for elastic single‐attribute situations

Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

从大国博弈视角解读与应对第三次抵消战略

在常规军力优势相对衰落、经费预算日益缩紧的背景下,美军为维持其军事霸权,提出了旨在实现兵力全球自由投送的第三次抵消战略(Third Offset Strategy)。通过梳理抵消战略的现实背景、历史沿革和战略目的,我们发现如果把第三次抵消战略简单视作美军的军事技术发展战略甚至军事战略,就会陷入片面而幼稚的认识误区。除了防范潜在的技术诱骗和技术突袭,更应该从大国博弈的战略视角出发,全面审视和应对第三次抵消战略对我国的挑战。美军实现国家利益的需求导向、自我变革的决心勇气和创新能力、科技兴军的先进理念和以军为主的军民融合成功经验值得借鉴。要以我为主参与制定未来战争的"游戏规则",做到"你打你的,我打我的";要深入研究美军作战体系和美国国家战略的薄弱环节,有针对性地"攻其所必救",从而化解重大安全挑战,争得新的战略机遇期。     

大班幼儿建构游戏中同伴互动行为分析

采用非参与式观察法对36名大班幼儿建构游戏中的同伴互动行为进行观察,将收集到的344起同伴互动事件进行分析,从互动性别、互动主题、互动方式和互动情绪四个方面探讨大班幼儿在建构游戏中同伴互动行为的特征。并提出如下建议:教师应摒弃性别角色的刻板印象,鼓励女孩大胆体验建构游戏;教师应承认两性差异,给予男孩更多的耐心;幼儿园应定期评估材料的充分性与适宜性,投放充足且丰富的建构材料;教师应鼓励幼儿多进行分享、赞扬的友好互动。     

Many‐player rendezvous search: Stick together or split and meet?

Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

空间pNA''与对策的NA一致连续性

pNA是无原子对策理论中极其重要的Banach空间,Kohlberg和Tauman已经刻划了pNA中某类对策的特征。本文从另一角度来研究这一困难的问题,目的是刻划比pNA更大,但又与PNA极为相似的Banach空间pNA′中的对策之特征。我们证得pNA′中的对策可用NA一致连续性来刻划。     

推进颠覆性技术发展是大国博弈的战略选择

世界新一轮科技革命为颠覆性技术涌现创造了新的机遇,推进颠覆性技术发展已成为大国博弈的战略选择。文章简要分析了主要国家发展颠覆性技术的做法,从历史视角回顾了颠覆性技术发展对人类战争形态演变的历程,系统阐述新一轮科技革命为颠覆性技术发展创造的新机遇及其发展对未来战争形态的影响,提出加快推进我国颠覆性技术发展的几点建议。