0


合作和协调的组合问题

Combined Problems of Cooperation and Coordination
课程网址: http://videolectures.net/eccs07_stark_cpc/  
主讲教师: Hans-Ulrich Stark
开课单位: 苏黎世联邦理工学院
开课时间: 2007-11-28
课程语种: 英语
中文简介:
在博弈论中,对于具有玩家二元决策的对称双人游戏已经引起了很多关注。在这一框架内,社会合作和社会困境的问题主要与调查囚徒困境(PD)有关,其中T> R> P> S和2R> T + S.在这种情况下,在各种环境中研究个体抵制缺陷诱惑的准备情况。这些调查旨在解释自私个体之间合作的起源和稳定性。但是,如果抵制诱惑的意愿不足以达到预期的结果呢?也许存在多个期望的解决方案,并且个人还必须协调他们的行动以实现其中之一。在这项工作中,我专注于游戏理论冲突,在同一游戏中展现出合作和协调问题的组合。例子是(i)轮流困境(Neill,2003)和(ii)路线选择游戏(Helbing等,2005; Stark等,2007)。第一个(i)类似于上述PD,但是第二个不等式被反转为T + S>。 2R。帕累托无效平衡,从而合作困境保持不变,但系统最优解(最大累积收益)转移到双马的非对角线。当考虑迭代游戏时,这导致了一个非平凡的时间协调问题,因为在bimatrix的右上角和左下角解决方案之间的翻转将导致超级游戏的唯一Pareto有效解决方案。后一点也适用于T>路线选择游戏。 P> S> R和T + S> 2P,表示具有容量限制链路(交通网络,数据通信网络)的网络的有效使用问题。当然,对具有这种潜在冲突的系统的性能进行的调查产生与具有PD游戏潜在冲突的系统完全不同的结果。但是,目前在这方面的工作很少。在这篇文章中,我将介绍我目前关于这一主题的研究以及以前工作的实证结果。 [1] Helbing,D。; Schö nhof,M。; Stark,H.-U。; Holyst,J.A。(2005)。个人如何学会轮流:在拥挤游戏中出现交替合作以及囚徒困境。进阶复杂的系统。 8,87-116; [2] Neill,D。B.(2003)。转折困境中的合作与协调。在:TARK。第231-244页; [3] Stark,H.-U。; Helbing,D。; Schö nhof,M。; Holyst,J.A。(2007)。路线选择游戏中的交替合作策略:理论,实验和学习场景的效果。在:A。Innocenti; P. Sbriglia(编辑),游戏,理性和行为,Palgrave,MacMillan。
课程简介: In game theory, much attention has been paid to symmetrical 2-players games with binary decisions of the players. Within this frame, questions of social cooperation and social dilemmas have mostly been attached to investigations of the Prisoner's Dilemma (PD) with T > R > P > S and 2R > T + S. In this context, the readiness of individuals to resist the temptation to defect is studied in various settings. These investigations aim at explaining the origin and stability of cooperation among selfish individuals. But what if the readiness to resist temptation is not enough to reach a desired outcome? Maybe there are more than one desired solutions and the individuals additionally have to coordinate their actions to realize one of them. In this work, I focus on game theoretical conflicts that exhibit a combination of cooperation and coordination problems in the same game. Examples are (i) the Turn-Taking Dilemma (Neill, 2003) and (ii) the Route Choice Game (Helbing et al., 2005; Stark et al., 2007). The first one, (i), is similar to the above described PD, but the second inequality is reversed to T + S > 2R. The Pareto-inefficient equilibrium, and, thereby, the cooperation dilemma remains the same, but the system optimal solution (maximal cumulative payoff) is shifted to the off diagonal of the bimatrix. When considering an iterated game, this leads to a non-trivial, temporal coordination problem as flipping between the upper right and the lower left solutions of the bimatrix would lead to the only Pareto-efficient solution of the supergame. The latter point also holds for the Route Choice Game with T > P > S > R and T + S > 2P, that represents the problem of efficient usage of networks with capacity-restricted links (traffic networks, data-communication networks). Of course, investigations regarding the performance of systems with this underlying conflict yield completely different results than those with a PD game underlying. However, currently there is very little work done in this direction. In this contribution, I will present my current research on this topic as well as empirical results of previous work. [1] Helbing, D.; Schönhof, M.; Stark, H.-U.; Holyst, J. A. (2005). How individuals learn to take turns: Emergence of alternating cooperation in a congestion game and the prisoner's dilemma. Adv. Complex Syst. 8, 87-116; [2] Neill, D. B. (2003). Cooperation and coordination in the turn-taking dilemma. In: TARK. pp. 231-244; [3] Stark, H.-U.; Helbing, D.; Schönhof, M.; Holyst, J. A. (2007). Alternating cooperation strategies in a route choice game: Theory, experiments, and effects of a learning scenario. In: A. Innocenti; P. Sbriglia (eds.), Games, Rationality, and Behaviour, Palgrave, MacMillan.
关 键 词: 时间协调问题; 有效利用问题; 轮流交替合作
课程来源: 视频讲座网
最后编审: 2020-06-29:wuyq
阅读次数: 88