Who to Trust for Truthfully Maximizing Welfare

作者: Christos Tzamos , Dimitris Fotakis , Emmanouil Zampetakis

DOI:

关键词:

摘要: We introduce a general approach based on \emph{selective verification} and obtain approximate mechanisms without money for maximizing the social welfare in domain of utilitarian voting. Having good allocation mind, mechanism with verification selects few critical agents detects, using oracle, whether they have reported truthfully. If yes, produces desired allocation. Otherwise, ignores any misreports proceeds remaining agents. randomized truthful (or almost truthful) that verify only $O(\ln m / \epsilon)$ agents, where $m$ is number outcomes, independently total are $(1-\epsilon)$-approximate welfare. also show constant approximation ratio needs to $\Omega(\log m)$ A remarkable property our \emph{robustness}, namely their outcome depends reports

参考文章(30)
Piotr Krysta, Carmine Ventre, Combinatorial auctions with verification are tractable european symposium on algorithms. pp. 39- 50 ,(2010) , 10.1007/978-3-642-15781-3_4
Aris Filos-Ratsikas, Peter Bro Miltersen, Truthful Approximations to Range Voting workshop on internet and network economics. pp. 175- 188 ,(2014) , 10.1007/978-3-319-13129-0_13
Dimitris Fotakis, Christos Tzamos, On the Power of Deterministic Mechanisms for Facility Location Games electronic commerce. ,vol. 2, pp. 15- ,(2014) , 10.1145/2665005
Michael Schapira, Yaron Singer, Inapproximability of Combinatorial Public Projects workshop on internet and network economics. pp. 351- 361 ,(2008) , 10.1007/978-3-540-92185-1_41
Ariel D. Procaccia, Can approximation circumvent gibbard-satterthwaite? national conference on artificial intelligence. pp. 836- 841 ,(2010)
Piotr Krysta, Carmine Ventre, Dimitris Fotakis, Combinatorial auctions without money adaptive agents and multi-agents systems. pp. 1029- 1036 ,(2014) , 10.5555/2615731.2617410
Itai Sher, Rakesh Vohra, Price discrimination through communication Theoretical Economics. ,vol. 10, pp. 597- 648 ,(2015) , 10.3982/TE1129
David P. Williamson, David B. Shmoys, The Design of Approximation Algorithms ,(2011)
Emmanouil Pountourakis, Guido Schäfer, Mechanisms for Hiring a Matroid Base without Money algorithmic game theory. ,vol. 8768, pp. 255- 266 ,(2014) , 10.1007/978-3-662-44803-8_22
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, The power of verification for one-parameter agents Journal of Computer and System Sciences. ,vol. 75, pp. 190- 211 ,(2009) , 10.1016/J.JCSS.2008.10.001