Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Constructive bounds and exact expectation for the random assignment problem
Random Structures & Algorithms
The ζ (2) limit in the random assignment problem
Random Structures & Algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
Combinatorics, Probability and Computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the expected payment of mechanisms for task allocation: [extended abstract]
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
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
Brief announcement: on the expected overpayment of VCG mechanisms in large networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures
Random Structures & Algorithms
ACM Transactions on Algorithms (TALG)
First-passage percolation on a width-2 strip and the path cost in a VCG auction
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
| Hi-index | 0.00 |
We explore the average-case "Vickrey" cost of structures in three random settings: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the Vickrey cost of a minimum spanning tree (MST) in a complete graph with random edge weights; and the Vickrey cost of a perfect matching in a complete bipartite graph with random edge weights. In each case, in the large-size limit, the Vickrey cost is precisely 2 times the (non-Vickrey) minimum cost, but this is the result of case-specific calculations, with no general reason found for it to be true. Separately, we consider the problem of sparsifying a complete graph with random edge weights so that all-pairs shortest paths are preserved approximately. The problem of sparsifying a given graph so that for every pair of vertices, the length of the shortest path in the sparsified graph is within some multiplicative factor and/or additive constant of the original distance has received substantial study in theoretical computer science. For the complete digraph ${\vec{K}_n}$ with random edge weights, we show that whp ***(n ln n ) edges are necessary and sufficient for a spanning subgraph to give good all-pairs shortest paths approximations.