Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
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
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A faster computation of the most vital edge of a shortest path
Information Processing Letters
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the most vital node of a shortest path
Theoretical Computer Science - Computing and combinatorics
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
A truthful (2 - 2/k)-approximation mechanism for the steiner tree problem with k terminals*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
Approximate mechanisms for the graphical TSP and other graph traversal problems
WINE'07 Proceedings of the 3rd 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
| 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 controlled by a selfish agent. In this paper we analyze the problem of designing a truthful mechanism for computing one of the most used structures in communication networks, i.e., the single-source shortest paths tree. More precisely, we will show that under various realistic agents' behavior scenarios, it can be guaranteed not only the existence, but also the efficiency (in terms of running time complexity) of such mechanisms. In particular, for the fundamental case in which the problem is utilitarian, we will show that a truthful mechanism can be computed in O(mn log α(m,n)) time, where α(m,n) is the classic inverse of the Ackermann's function.