Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem
暂无分享,去创建一个
[1] Bernard Chazelle. Minimum Spanning Trees , 2000 .
[2] Seth Pettie,et al. Computing shortest paths with comparisons and additions , 2002, SODA '02.
[3] Bernard Chazelle,et al. A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.
[4] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[5] Guido Proietti,et al. Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems , 2003, Algorithmica.
[6] Enrico Nardelli,et al. A faster computation of the most vital edge of a shortest path , 2001, Inf. Process. Lett..
[7] Enrico Nardelli,et al. Finding the most vital node of a shortest path , 2003, Theor. Comput. Sci..
[8] E. H. Clarke. Multipart pricing of public goods , 1971 .
[9] Theodore Groves,et al. Incentives in Teams , 1973 .
[10] Enrico Nardelli,et al. Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures , 2004, Algorithmica.
[11] Harold N. Gabow,et al. A scaling algorithm for weighted matching on general graphs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[12] Guido Proietti,et al. A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals , 2005, COCOON.
[13] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[14] Haim Kaplan,et al. Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators , 1998, STOC '98.
[15] A. K. Mittal,et al. The k most vital arcs in the shortest path problem , 1990 .
[16] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[17] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Guido Proietti,et al. A truthful mechanism for the non-utilitarian minimum radius spanning tree problem , 2005, SPAA '05.
[19] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[20] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[21] Kevin Downs,et al. Internetworking Technologies Handbook , 1997 .
[22] Enrico Nardelli,et al. Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast , 2002, Algorithmica.
[23] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .