论文标题

具有DSL策略的代理商的最佳机制设计:组合拍卖中的Sybil攻击情况

Optimal Mechanism Design for Agents with DSL Strategies: The Case of Sybil Attacks in Combinatorial Auctions

论文作者

Gafni, Yotam, Tennenholtz, Moshe

论文摘要

在不确定性下的强大决策中,自然的选择是采用安全(又称安全)级别的策略。但是,在许多重要情况下,最著名的是拍卖,有多种安全水平策略,因此使选择不清楚。 我们考虑两个精致的概念: (i)我们称为DSL(可区分的安全级别)的术语,并基于``Incrimin''的概念,``歧视''的概念,该术语在消除琐碎的等效性时采用了动作的成对比较。这概述了一个事实,即在比较两项行动时,代理商不应在导致相同收益的情况下关心收益。 (ii)社会选择理论中著名的词汇概念,我们适用于强大的决策。特别是,leximin始终是DSL,但反之亦然。 我们研究了这些观念与其他健壮概念的关系,并说明了它们在拍卖和其他环境中使用的结果。经济设计旨在在面对自我激励参与者时最大化社会福利。在网络环境(例如网络)中,参与者的激励措施采用了一种新的形式,源于缺乏明确的代理身份 - 创建SYBIL攻击的能力,即每个参与者使用多个身份行动的能力。众所周知,Sybil攻击是福利最大化的主要障碍。 我们的主要结果证明,当DSL攻击者对拍卖的竞标面临不确定性时,即使在Sybil攻击下,著名的VCG机制也在福利最大化。总的来说,我们的工作表明了在不确定性,经济设计和代理商在线多机构系统中的鲁棒性之间的成功基本协同作用。

In robust decision making under uncertainty, a natural choice is to go with safety (aka security) level strategies. However, in many important cases, most notably auctions, there is a large multitude of safety level strategies, thus making the choice unclear. We consider two refined notions: (i) a term we call DSL (distinguishable safety level), and is based on the notion of ``discrimin'', which uses a pairwise comparison of actions while removing trivial equivalencies. This captures the fact that when comparing two actions an agent should not care about payoffs in situations where they lead to identical payoffs. (ii) The well-known Leximin notion from social choice theory, which we apply for robust decision-making. In particular, the leximin is always DSL but not vice-versa. We study the relations of these notions to other robust notions, and illustrate the results of their use in auctions and other settings. Economic design aims to maximize social welfare when facing self-motivated participants. In online environments, such as the Web, participants' incentives take a novel form originating from the lack of clear agent identity -- the ability to create Sybil attacks, i.e., the ability of each participant to act using multiple identities. It is well-known that Sybil attacks are a major obstacle for welfare-maximization. Our main result proves that when DSL attackers face uncertainty over the auction's bids, the celebrated VCG mechanism is welfare-maximizing even under Sybil attacks. Altogether, our work shows a successful fundamental synergy between robustness under uncertainty, economic design, and agents' strategic manipulations in online multi-agent systems.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源