首页> 外文期刊>Autonomous agents and multi-agent systems >Picky losers and carefree winners prevail in collective risk dilemmas with partner selection
【24h】

Picky losers and carefree winners prevail in collective risk dilemmas with partner selection

机译:挑剔的输家和无忧无虑的赢家在具有合作伙伴选择的集体风险困境中占上风

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Understanding how to design agents that sustain cooperation in multi-agent systems has been a long-lasting goal in distributed artificial intelligence. Proposed solutions rely on identifying free-riders and avoiding cooperating or interacting with them. These mechanisms of social control are traditionally studied in games with linear and deterministic payoffs, such as the prisoner's dilemma or the public goods game. In reality, however, agents often face dilemmas in which payoffs are uncertain and non-linear, as collective success requires a minimum number of cooperators. The collective risk dilemma (CRD) is one of these games, and it is unclear whether the known mechanisms of cooperation remain effective in this case. Here we study the emergence of cooperation in CRD through partner-based selection. First, we discuss an experiment in which groups of humans and robots play a CRD. This experiment suggests that people only prefer cooperative partners when they lose a previous game (i.e., when collective success was not previously achieved). Secondly, we develop an evolutionary game theoretical model pointing out the evolutionary advantages of preferring cooperative partners only when a previous game was lost. We show that this strategy constitutes a favorable balance between strictness (only interact with cooperators) and softness (cooperate and interact with everyone), thus suggesting a new way of designing agents that promote cooperation in CRD. We confirm these theoretical results through computer simulations considering a more complex strategy space. Third, resorting to online human-agent experiments, we observe that participants are more likely to accept playing in a group with one defector when they won in a previous CRD, when compared to participants that lost the game. These empirical results provide additional support to the human predisposition to use outcome-based partner selection strategies in human-agent interactions.
机译:了解如何设计维持多项代理系统合作的代理人在分布式人工智能中一直是持久的目标。提出的解决方案依赖于识别搭便车,避免与他们合作或与之互动。传统上,这些社会控制机制在游戏中进行了线性和确定性的收益,例如囚犯的困境或公共产品游戏。然而,实际上,代理经常面临困境,因为集体成功需要最少数量的合作者的收益不确定和非线性的困境。集体风险困境(CRD)是这些游戏之一,目前还不清楚,在这种情况下,已知合作机制是否仍然有效。在这里,我们通过基于伙伴的选择研究CRD合作的出现。首先,我们讨论一个实验,其中一群人和机器人发挥CRD。该实验表明,当他们失去前一场比赛时,人们才更喜欢合作伙伴(即,当之前未实现集体成功时)。其次,我们开发了一个进化的游戏理论模型,这些模型只有在前一次游戏丢失时才会唯一偏爱合作伙伴的进化优势。我们表明,这种策略构成了严格(只与合作者互动)和柔软性(与每个人合作互动)之间的有利平衡,从而建议设计促进CRD合作的代理商的新方式。考虑到更复杂的策略空间,我们通过计算机模拟确认这些理论结果。第三,借助在线人工代理实验,我们观察到参与者更有可能在与失去游戏中的参与者中赢得一个缺陷的一组缺陷队员。这些经验结果向人类倾向提供了额外的支持,以利用人代代理相互作用中的基于结果的合作伙伴选择策略。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号