Vickrey prices and shortest paths: What is an edge worth?

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 252-259

  Hershberger, J ^a   Suri, S ^a  

^a MENTOR GRAPHICS CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); INTERNET; NETWORK PROTOCOLS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

SHORTEST PATH PROBLEMS;

GRAPH THEORY;

EID: 0035175911     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959899     Document Type: Conference Paper

References (26)

1. Linear programming and vickrey auctions
2. Finding the k shortest paths
3. Resource pricing and the evolution of congestion control
4. Optimization problems in congestion control
5. A simpler minimum spanning tree verification algorithm
6. A procedure for computing the K best solutions to discrete optimization problemns and its application to the shortest path problem
7. Truth revelation in approximately efficient combinatorial auctions
8. Pricing congestible network resources
9. Algorithmic mechanism design
10. Distributed rational decision making
11. Improved algorithm for optimal winner determination in combinatorial auctions and generalizations
12. CABOB: A fast optimal algorithm for combinatorial auctions
13. Pricing in computer networks: Reshaping the research agenda
14. A dynamic theory of incentives in multi-agent systems
15. A market protocol for decentralized task allocation
16. Sensitivty analysis of minimum spanning trees and shortest path trees
17. Auction protocols for decentralized scheduling
18. G-commerce: Market formulations controlling resource allocation on the computational grid
19. Finding the K shortest loopless paths in a network
20. Another algorithm for finding the K shortest loopless network paths