{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:41Z","timestamp":1725474521897},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_10","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"99-111","source":"Crossref","is-referenced-by-count":3,"title":["First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction"],"prefix":"10.1007","author":[{"given":"Abraham","family":"Flaxman","sequence":"first","affiliation":[]},{"given":"David","family":"Gamarnik","sequence":"additional","affiliation":[]},{"given":"Gregory B.","family":"Sorkin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1002\/rsa.1015","volume":"18","author":"D.J. Aldous","year":"2001","unstructured":"Aldous, D.J.: The \u03b6(2) limit in the random assignment problem. Random Structures Algorithms\u00a018(4), 381\u2013418 (2001)","journal-title":"Random Structures Algorithms"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0963548302005266","volume":"11","author":"S.E. Alm","year":"2002","unstructured":"Alm, S.E., Parviainen, R.: Lower and upper bounds for the time constant of first-passage percolation. Comb. Probab. Comput.\u00a011(5), 433\u2013445 (2002)","journal-title":"Comb. Probab. Comput."},{"key":"10_CR3","first-page":"1","volume-title":"Probability on discrete structures, Encyclopaedia Math. Sci.","author":"D.J. Aldous","year":"2004","unstructured":"Aldous, D.J., Steele, J.M.: The objective method: probabilistic combinatorial optimization and local weak convergence. In: Probability on discrete structures, Encyclopaedia Math. Sci., vol.\u00a0110, pp. 1\u201372. Springer, Berlin (2004)"},{"key":"10_CR4","unstructured":"Archer, A., Tardos, \u00c9.: Frugal path mechanisms. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (San Francisco, California), January 06-08, pp. 991\u2013999 (2002)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0305004100032680","volume":"53","author":"S.R. Broadbent","year":"1957","unstructured":"Broadbent, S.R., Hammersley, J.M.: Percolation processes i. crystals and mazes. Proceedings of the Cambridge Philosophical Society\u00a053, 629\u2013641 (1957)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"8","author":"E. Clarke","year":"1971","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice\u00a08, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Ronen, A.: On the expected payment of mechanisms for task allocation (extended abstract). In: Proceedings of the fifth ACM Conference on Electronic Commerce, pp. 252\u2013253 (2004)","DOI":"10.1145\/988772.988819"},{"key":"10_CR8","volume-title":"Probability: theory and examples","author":"R. Durrett","year":"1996","unstructured":"Durrett, R.: Probability: theory and examples, 2nd edn. Duxbury Press, Belmont (1996)","edition":"2"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Elkind, E.: True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs. In: Proceedings of the sixth ACM Conference on Electronic Commerce, pp. 108\u2013117 (2005)","DOI":"10.1145\/1064009.1064021"},{"key":"10_CR10","unstructured":"Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 694\u2013702 (2004)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/571825.571856","volume-title":"PODC 2002: Proceedings of the twenty-first annual symposium on Principles of distributed computing","author":"J. Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: PODC 2002: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 173\u2013182. ACM Press, New York (2002)"},{"key":"10_CR12","unstructured":"Gamarnik, D., Nowicki, T., Swirscsz, G.: Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method, Random Structures and Algorithms (to appear)"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica\u00a041(4), 617\u2013631 (1973)","journal-title":"Econometrica"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S026996480115206X","volume":"15","author":"R. Hofstad Van Der","year":"2001","unstructured":"Van Der Hofstad, R., Hooghiemstra, G., Van Mieghem, P.: First-passage percolation on the random graph. Probab. Eng. Inf. Sci.\u00a015(2), 225\u2013237 (2001)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"10_CR15","series-title":"Bernoulli-Bayes-Laplace Anniversary","first-page":"61","volume-title":"First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory","author":"J.M. Hammersley","year":"1965","unstructured":"Hammersley, J.M., Welsh, J.D.: First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. Bernoulli-Bayes-Laplace Anniversary, pp. 61\u2013110. Springer, Heidelberg (1965)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.2307\/3213186","volume":"18","author":"S. Janson","year":"1981","unstructured":"Janson, S.: An upper bound for the velocity of first-passage percolation. Journal of Applied Probability\u00a018, 256\u2013262 (1981)","journal-title":"Journal of Applied Probability"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1214\/aop\/1176991975","volume":"15","author":"H. Kesten","year":"1987","unstructured":"Kesten, H.: Percolation theory and first-passage percolation. Ann. Probab.\u00a015, 1231\u20131271 (1987)","journal-title":"Ann. Probab."},{"key":"10_CR18","first-page":"126","volume-title":"PODC 2005: Proceedings of the 24th annual ACM symposium on Principles of distributed computing","author":"D. Karger","year":"2005","unstructured":"Karger, D., Nikolova, E.: Brief announcement: on the expected overpayment of VCG mechanisms in large networks. In: PODC 2005: Proceedings of the 24th annual ACM symposium on Principles of distributed computing, pp. 126\u2013126. ACM Press, New York (2005)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/SFCS.2003.1238178","volume-title":"FOCS 2003: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Mihail","year":"2003","unstructured":"Mihail, M., Papadimitriou, C., Saberi, A.: On certain connectivity properties of the internet topology. In: FOCS 2003: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, p. 28. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: Proceedings of the thirty-first annual ACM symposium on Theory of computing (Atlanta, Georgia, United States), pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"10_CR21","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0063306","volume-title":"First-passage percolation on the square lattice","author":"R.T. Smythe","year":"1978","unstructured":"Smythe, R.T., Wierman, J.C.: First-passage percolation on the square lattice. Lecture Notes in Mathematics, vol.\u00a0671. Springer, Heidelberg (1978)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickery","year":"1961","unstructured":"Vickery, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:09:09Z","timestamp":1558285749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11944874_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}