Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
ACM SIGACT news distributed computing column 9
ACM SIGACT News
On the Difficulty of Some Shortest Path Problems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Finding the most vital node of a shortest path
Theoretical Computer Science - Computing and combinatorics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Self-interested automated mechanism design and implications for optimal combinatorial auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Mechanism design for policy routing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the expected payment of mechanisms for task allocation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Towards Fast Vickrey Pricing using Constraint Programming
Artificial Intelligence Review
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
Proceedings of the 6th ACM conference on Electronic commerce
Proceedings of the 6th ACM conference on Electronic commerce
Pricing multicasting in more flexible network models
ACM Transactions on Algorithms (TALG)
Proceedings of the 11th annual international conference on Mobile computing and networking
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Mechanism design for policy routing
Distributed Computing - Special issue: PODC 04
ACM Transactions on Algorithms (TALG)
On the difficulty of some shortest path problems
ACM Transactions on Algorithms (TALG)
On the K-simple shortest paths problem in weighted directed graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
Improved distance sensitivity oracles via random sampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A near-linear time algorithm for computing replacement paths in planar directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Simulation of the behavior of bidders in first-price sealed-bid auctions on communication networks
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Hidden information and actions in multi-hop wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Informational overhead of incentive compatibility
Proceedings of the 9th ACM conference on Electronic commerce
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Theoretical Computer Science
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science
A nearly optimal oracle for avoiding failed vertices and edges
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Finding the anti-block vital edge of a shortest path between two nodes
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An adaptive algorithm for failure recovery during dynamic service composition
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Approximate mechanisms for the graphical TSP and other graph traversal problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms (TALG)
Truthful least-priced-path routing in opportunistic spectrum access networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A multidimensional procurement auction for trading composite services
Electronic Commerce Research and Applications
Fast top-k simple shortest paths discovery in graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
On the $k$ Shortest Simple Paths Problem in Weighted Directed Graphs
SIAM Journal on Computing
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
An experimental study on approximating K shortest simple paths
ESA'11 Proceedings of the 19th European conference on Algorithms
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
Replacement paths and k simple shortest paths in unweighted directed graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
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
Economic mechanisms for shortest path cooperative games with incomplete information
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Accelerating vickrey payment computation in combinatorial auctions for an airline alliance
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The impact of edge deletions on the number of errors in networks
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Proceedings of the 13th ACM Conference on Electronic Commerce
Mechanism design for a multicommodity flow game in service network alliances
Operations Research Letters
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
IEEE/ACM Transactions on Networking (TON)
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms (TALG)
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We solve a shortest path problem that is motivated by recent interest in pricing networks or other computational resources. Informally, how much is an edge in a network worth to a user who wants to send data between two nodes along a shortest path? If the network is a decentralized entity, such as the Internet, in which multiple self-interested agents own different parts of the network, then auction-based pricing seems appropriate. A celebrated result fromauction theory shows that the use of Vickrey pricing motivates the owners of the network resources to bid truthfully. In Vickrey's scheme, each agent is compensated in proportion to the marginal utility he brings to the auction. In the context of shortest path routing, an edge's utility is the value by which it lowers the length of the shortest path 驴 the differencebetween the shortest path lengths with and without the edge. Our problem is to compute these marginal values for all the edges of the network efficiently. The na篓ýve method requires solving the single-source shortest path problem up to n times, for an n-node network. We show that the Vickrey prices for all the edges can be computed in the same asymptotic time complexity as one single-source shortest path problem. This solves an open problem posed by Nisan and Ronen [12].