Strongly polynomial-time truthful mechanisms in one shot
暂无分享,去创建一个
[1] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.
[2] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[3] Guido Proietti,et al. A truthful mechanism for the non-utilitarian minimum radius spanning tree problem , 2005, SPAA '05.
[4] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[5] E. H. Clarke. Multipart pricing of public goods , 1971 .
[6] Theodore Groves,et al. Incentives in Teams , 1973 .
[7] Joan Feigenbaum,et al. Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.
[8] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[9] Enrico Nardelli,et al. Finding the most vital node of a shortest path , 2001, Theor. Comput. Sci..
[10] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[11] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[12] Xiang-Yang Li,et al. Towards truthful mechanisms for binary demand games: a general framework , 2005, EC '05.
[13] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[14] Guido Proietti,et al. A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals , 2005, COCOON.
[15] Ron Lavi,et al. Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.
[16] Paolo Penna,et al. Strongly Polynomial-Time Truthful Mechanisms in One Shot , 2006, WINE.
[17] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions , 2008, Games Econ. Behav..
[18] Guido Proietti,et al. Efficient truthful mechanisms for the single‐source shortest paths tree problem , 2007, Concurr. Comput. Pract. Exp..
[19] Seth Pettie,et al. Computing shortest paths with comparisons and additions , 2002, SODA '02.
[20] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[21] Timothy J. Lowe,et al. Location on Networks: A Survey. Part I: The p-Center and p-Median Problems , 1983 .
[22] Refael Hassin,et al. On the Minimum Diameter Spanning Tree Problem , 1995, Inf. Process. Lett..