First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction

We study both the time constant for first-passage percolation, and the Vickery-Clarke-Groves (VCG) payment for the shortest path, on a width-2 strip with random edge costs. These statistics attempt to describe two seemingly unrelated phenomena, arising in physics and economics respectively: the first-passage percolation time predicts how long it takes for a fluid to spread through a random medium, while the VCG payment for the shortest path is the cost of maximizing social welfare among selfish agents. However, our analyses of the two are quite similar, and require solving (slightly different) recursive distributional equations. Using Harris chains, we can characterize distributions, not just expectations.

[1]  J. Hammersley,et al.  Percolation processes , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[3]  J. Hammersley,et al.  First-Passage Percolation, Subadditive Processes, Stochastic Networks, and Generalized Renewal Theory , 1965 .

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

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

[6]  R. Smythe,et al.  First-passage percolation on the square lattice. I , 1977, Advances in Applied Probability.

[7]  Svante Janson,et al.  An upper bound for the velocity of first-passage percolation , 1981, Journal of Applied Probability.

[8]  Harry Kesten,et al.  Percolation Theory and First-Passage Percolation , 1987 .

[9]  R. Durrett.  Probability: Theory and Examples , 1993 .

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

[11]  Piet Van Mieghem,et al.  FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH , 2001, Probability in the Engineering and Informational Sciences.

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

[13]  Aleta Ricciardi.  Proceedings of the twenty-first annual symposium on Principles of distributed computing , 2002, PODC 2002.

[14]  Sven Erick Alm,et al.  Lower and Upper Bounds for the Time Constant of First-Passage Percolation , 2002, Combinatorics, Probability and Computing.

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

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

[17]  David Gamarnik,et al.  Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method , 2004, APPROX-RANDOM.

[18]  J. Michael Steele,et al.  The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence , 2004 .

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

[20]  D. Aldous,et al.  A survey of max-type recursive distributional equations , 2004, math/0401388.

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

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

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

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

[25]  D. Gamarnik,et al.  Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method , 2006 .

[26]  David J. Aldous,et al.  Cost-Volume Relationship for Flows Through a Disordered Network , 2005, Math. Oper. Res..