arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1712.06709cs.GT
收藏

对于两个自然问题,没有一种真实机制能比$n$近似更好

No truthful mechanism can be better than $n$ approximate for two natural problems

Stefano Leucci, Akaki Mamageishvili, Paolo Penna

摘要:

这项工作给出了第一个自然的非功利性的问题,通过VCG机制的平凡的$n$近似是最好的。也就是说,没有任何真实的机制可以比$n$近似更好,其中$n$是代理的数量。这些问题是最短路径的最小-最大变量和(有向)最小生成树机制设计问题。在这些采购拍卖中,代理拥有网络的边缘,并且相应的边缘成本是私有的。而不是子网络的总重量,在最小最大变量中,我们的目标是最小化最大代理成本。

英文摘要:

This work gives the first natural non-utilitarian problems for which the trivial $n$ approximation via VCG mechanisms is the best possible. That is, no truthful mechanism can be better than $n$ approximate, where $n$ is the number of agents. The problems are the min-max variant of shortest path and (directed) minimum spanning tree mechanism design problems. In these procurement auctions, agents own the edges of a network, and the corresponding edge costs are private. Instead of the total weight of the subnetwork, in the min-max variant we aim to minimize the maximum agent cost.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑