Bribeproof mechanisms for two-values domains.

ALGORITHMIC GAME THEORY, SAGT 2016(2016)

引用 2|浏览40
暂无评分
摘要
Schummer [27] introduced the concept of bribeproof mechanism which, in a context where monetary transfer between agents is possible, requires that manipulations through bribes are ruled out. Unfortunately, in many domains, the only bribeproof mechanisms are the trivial ones which return a fixed outcome. This work presents one of the few constructions of non-trivial bribeproof mechanisms for this setting. Though the suggested construction applies to rather restricted domains, the results obtained are tight: for several natural problems, the method yields the only possible bribeproof mechanism and no such mechanism is possible on more general domains.
更多
查看译文
关键词
Group Strategyproofness, Strategyproof Mechanisms, Path Auctions, Three-valued Domain, Single-minded Bidders
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要