Efficient truthful mechanisms for the single‐source shortest paths tree problem
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[2] E. H. Clarke. Multipart pricing of public goods , 1971 .
[3] Guido Proietti,et al. Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems , 2003, Algorithmica.
[4] A. K. Mittal,et al. The k most vital arcs in the shortest path problem , 1990 .
[5] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[6] Theodore Groves,et al. Incentives in Teams , 1973 .
[7] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[8] Robert E. Tarjan,et al. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..
[9] Enrico Nardelli,et al. A faster computation of the most vital edge of a shortest path , 2001, Inf. Process. Lett..
[10] Seth Pettie,et al. An optimal minimum spanning tree algorithm , 2000, JACM.
[11] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[12] Seth Pettie,et al. Computing shortest paths with comparisons and additions , 2002, SODA '02.
[13] Enrico Nardelli,et al. Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures , 2004, Algorithmica.
[14] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[15] Haim Kaplan,et al. Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators , 1998, STOC '98.
[16] Guido Proietti,et al. A truthful mechanism for the non-utilitarian minimum radius spanning tree problem , 2005, SPAA '05.
[17] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .