Average-Case Analyses of Vickrey Costs

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.

[1]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[2]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[3]  David Gamarnik,et al.  First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction , 2006, WINE.

[4]  Alan M. Frieze,et al.  On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[5]  G. Parisi.  A Conjecture on random bipartite matching , 1998, cond-mat/9801176.

[6]  D. Aldous.  Asymptotics in the random assignment problem , 1992 .

[7]  Éva Tardos,et al.  Frugal path mechanisms , 2002, SODA '02.

[8]  D. Coppersmith,et al.  Constructive bounds and exact expectation for the random assignment problem , 1999 .

[9]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[10]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[11]  Artur Czumaj,et al.  On the expected payment of mechanisms for task allocation: [extended abstract] , 2004, EC '04.

[12]  D. Bertsimas,et al.  The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model: A Unified Approach , 1992 .

[13]  M. Mézard,et al.  Replicas and optimization , 1985 .

[14]  Don Coppersmith,et al.  Constructive bounds and exact expectations for the random assignment problem , 1998, Random Struct. Algorithms.

[15]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[16]  Johan Wästlund.  An easy proof of the $\zeta(2)$ limit in the random assignment problem , 2009 .

[17]  Johan Wästlund.  AN EASY PROOF OF THE ζ ( 2 ) LIMIT IN THE RANDOM ASSIGNMENT PROBLEM , 2006 .

[18]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[19]  Giorgio Parisi,et al.  Mean-Field Equations for the Matching and the Travelling Salesman Problems , 1986 .

[20]  Svante Janson,et al.  One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights , 1999, Combinatorics, Probability and Computing.

[21]  David R. Karger,et al.  Brief announcement: on the expected overpayment of VCG mechanisms in large networks , 2005, PODC '05.

[22]  Amin Saberi,et al.  On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[23]  Edith Elkind,et al.  True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs , 2005, EC '05.

[24]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

[25]  B. Prabhakar,et al.  Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures , 2005 .

[26]  Joan Boyar,et al.  The relative worst order ratio for online algorithms , 2007, TALG.

[27]  Svante Linusson,et al.  A proof of Parisi’s conjecture on the random assignment problem , 2003, math/0303214.

[28]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[29]  Kenneth Steiglitz,et al.  Frugality in path auctions , 2004, SODA '04.