Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
A faster computation of the most vital edge of a shortest path
Information Processing Letters
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Truthful multicast routing in selfish wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Strongly polynomial-time truthful mechanisms in one shot
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Designing a truthful mechanism for a spanning arborescence bicriteria problem
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Let a communication network be modelled by an undirected graph G=(V,E) of n nodes and m edges, and assume that each edge is owned by a selfish agent, which establishes the cost of using her edge by pursuing only her personal utility. In such a non-cooperative setting, we aim at designing a truthful mechanism for the problem of finding a minimum Steiner tree of G. Since no poly-time computable exact truthful mechanism can exist for such a problem (unless P=NP), we provide a truthful (2–2/k)-approximation mechanism which can be computed in O((n+ k2) m log α(m,n)) time, where k is the number of terminal nodes, and α(.,.) is the classic inverse of the Ackermann’s function. This compares favorably with the previous known O(kn(m+n log n)) time and 2-approximate truthful mechanism for solving the problem.