[论文解读] K-Implementation

Dov Monderer, Moshe Tennenholtz|arXiv (Cornell University)|Jun 30, 2011

Auction Theory and Applications被引用 2

一句话总结

本文提出了k-实施机制，一种非合作方在不改变规则或强制行为的前提下影响博弈结果的机制。通过承诺非负的金钱转移，该方能以最低成本实施理想的策略组合，其中k代表实际所需的支付金额，适用于完全信息和不完全信息博弈，包括VCG机制。

ABSTRACT

This paper discusses an interested party who wishes to influence the behavior of agents in a game (multi-agent interaction), which is not under his control. The interested party cannot design a new game, cannot enforce agents' behavior, cannot enforce payments by the agents, and cannot prohibit strategies available to the agents. However, he can influence the outcome of the game by committing to non-negative monetary transfers for the different strategy profiles that may be selected by the agents. The interested party assumes that agents are rational in the commonly agreed sense that they do not use dominated strategies. Hence, a certain subset of outcomes is implemented in a given game if by adding non-negative payments, rational players will necessarily produce an outcome in this subset. Obviously, by making sufficiently big payments one can implement any desirable outcome. The question is what is the cost of implementation? In this paper we introduce the notion of k-implementation of a desired set of strategy profiles, where k stands for the amount of payment that need to be actually made in order to implement desirable outcomes. A major point in k-implementation is that monetary offers need not necessarily materialize when following desired behaviors. We define and study k-implementation in the contexts of games with complete and incomplete information. In the latter case we mainly focus on the VCG games. Our setting is later extended to deal with mixed strategies using correlation devices. Together, the paper introduces and studies the implementation of desirable outcomes by a reliable party who cannot modify game rules (i.e. provide protocols), complementing previous work in mechanism design, while making it more applicable to many realistic CS settings.

研究动机与目标

• 解决在无法重设计规则、强制行动或控制支付的情况下，影响博弈中代理行为的挑战。
• 定义并分析k-实施机制，以实现以最小实际货币成本为目标结果的方法。
• 将k-实施机制扩展至不完全信息博弈，特别是VCG机制，并通过相关设备处理混合策略。
• 通过在现实世界计算科学场景中实现可靠影响，为传统机制设计提供实用补充。

提出的方法

• 将k-实施定义为承诺非负转移的能力，以确保理性代理选择在目标集合内的结果。
• 利用代理避免劣策略的假设，将可能结果的集合限制为可通过转移诱导的结果。
• 将实施成本建模为k，即当代理遵循期望策略时实际支付的最小总金额。
• 将框架扩展至不完全信息博弈，重点关注代理估值为私有的VCG机制。
• 引入相关设备以处理混合策略，使k-实施机制能够应用于随机策略组合。
• 分析在完全信息和不完全信息设置下，承诺可信度与成本效率之间的权衡。

实验结果

研究问题

• RQ1 在无法强制行为或修改规则的博弈中，实施期望策略组合集合所需的最小成本k是多少？
• RQ2 k-实施机制在不完全信息博弈中，特别是在VCG机制中的表现如何？
• RQ3 能否通过相关设备将k-实施机制扩展至混合策略？
• RQ4 在k-实施机制下，确保理性代理选择目标集合内结果的条件是什么？

主要发现

• k-实施机制使可靠方能够通过承诺转移来影响结果，而无需强制行动或改变博弈规则。
• 实施成本由k捕捉，即当代理遵循期望策略时实际支付的金额，该金额可能远低于承诺的最大转移额。
• 在具有不完全信息的VCG博弈中，k-实施机制仍具可行性，因其利用了代理的理性与激励相容性。
• 通过使用相关设备，k-实施机制可扩展至混合策略，从而扩大其适用范围。
• k-实施机制通过聚焦最小实际成本并保持结果控制，为传统机制设计提供了一种实用的替代方案。