{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:01:06Z","timestamp":1760299266449,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_25","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"343-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The VCG Mechanism for Bayesian Scheduling"],"prefix":"10.1007","author":[{"given":"Yiannis","family":"Giannakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Kyropoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.1110.0534","volume":"37","author":"I Ashlagi","year":"2012","unstructured":"Ashlagi, I., Dobzinski, S., Lavi, R.: Optimal lower bounds for anonymous scheduling mechanisms. Math. Oper. Res. 37(2), 244\u2013258 (2012)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"723","DOI":"10.2307\/3213876","volume":"22","author":"T Aven","year":"1985","unstructured":"Aven, T.: Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables. J. Appl. Probab. 22(3), 723\u2013728 (1985)","journal-title":"J. Appl. Probab."},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1214\/aoms\/1177704147","volume":"34","author":"RE Barlow","year":"1963","unstructured":"Barlow, R.E., Marshall, A.W., Proschan, F.: Properties of probability distributions with monotone hazard rate. Ann. Math. Stat. 34(2), 375\u2013389 (1963)","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.tcs.2008.09.023","volume":"409","author":"P Berenbrink","year":"2008","unstructured":"Berenbrink, P., Friedetzky, T., Hu, Z., Martin, R.: On weighted balls-into-bins games. Theor. Comput. Sci. 409(3), 511\u2013520 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Chawla, S., Immorlica, N., Lucier, B.: On the limits of black-box reductions in mechanism design. In: STOC, pp. 435\u2013448 (2012)","DOI":"10.1145\/2213977.2214019"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D., Sivan, B.: Prior-independent mechanisms for scheduling. In: STOC, pp. 51\u201360 (2013)","DOI":"10.1145\/2488608.2488616"},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1137\/120866038","volume":"42","author":"G Christodoulou","year":"2013","unstructured":"Christodoulou, G., Kov\u00e1cs, A.: A deterministic truthful PTAS for scheduling related machines. SIAM J. Comput. 42(4), 1572\u20131595 (2013)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s00453-008-9165-3","volume":"55","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A lower bound for scheduling mechanisms. Algorithmica 55(4), 729\u2013740 (2009)","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Weinberg, S.M.: Bayesian truthful mechanisms for job scheduling from bi-criterion approximation algorithms. In: SODA, pp. 1934\u20131952 (2015)","DOI":"10.1137\/1.9781611973730.130"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-25510-6_11","volume-title":"Internet and Network Economics","author":"N Devanur","year":"2011","unstructured":"Devanur, N., Hartline, J., Karlin, A., Nguyen, T.: Prior-independent multi-parameter mechanism design. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 122\u2013133. Springer, Heidelberg (2011)"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1137\/080744992","volume":"40","author":"P Dhangwatnotai","year":"2011","unstructured":"Dhangwatnotai, P., Dobzinski, S., Dughmi, S., Roughgarden, T.: Truthful approximation schemes for single-parameter agents. SIAM J. Comput. 40(3), 915\u2013933 (2011)","journal-title":"SIAM J. Comput."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.geb.2014.03.011","volume":"91","author":"P Dhangwatnotai","year":"2015","unstructured":"Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. Games Econ. Behav. 91, 318\u2013333 (2015)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.4086\/toc.2012.v008a005","volume":"8","author":"S Dughmi","year":"2012","unstructured":"Dughmi, S., Roughgarden, T., Sundararajan, M.: Revenue submodularity. Theory Comput. 8(1), 95\u2013119 (2012)","journal-title":"Theory Comput."},{"key":"25_CR16","unstructured":"Giannakopoulos, Y., Kyropoulou, M.: The VCG mechanism for bayesian scheduling. CoRR, abs\/1509.07455 (2015). http:\/\/arxiv.org\/abs\/1509.07455"},{"issue":"4","key":"25_CR17","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 41(4), 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"25_CR18","first-page":"1","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"LA Hall","year":"1997","unstructured":"Hall, L.A.: Approximation algorithms for scheduling. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 1\u201345. PWS, Boston (1997)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: EC, pp. 225\u2013234 (2009)","DOI":"10.1145\/1566374.1566407"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00453-012-9634-6","volume":"66","author":"E Koutsoupias","year":"2013","unstructured":"Koutsoupias, E., Vidali, A.: A lower bound of $$1+\\varphi $$ for truthful scheduling mechanisms. Algorithmica 66(1), 211\u2013223 (2013)","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.geb.2008.08.001","volume":"67","author":"R Lavi","year":"2009","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multidimensional scheduling via cycle monotonicity. Games Econ. Behav. 67(1), 99\u2013124 (2009)","journal-title":"Games Econ. Behav."},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-10841-9_5","volume-title":"Internet and Network Economics","author":"P Lu","year":"2009","unstructured":"Lu, P.: On 2-player randomized mechanisms for scheduling. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 30\u201341. Springer, Heidelberg (2009)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Lu, P., Yu, C.: An improved randomized truthful mechanism for scheduling unrelated machines. In: STACS, pp. 527\u2013538 (2008)","DOI":"10.1007\/978-3-540-92185-1_46"},{"key":"25_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"1\/2","key":"25_CR26","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35(1\/2), 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"25_CR27","first-page":"19","volume":"29","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. J. Artif. Int. Res. 29(1), 19\u201347 (2007)","journal-title":"J. Artif. Int. Res."},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \u201cBalls into Bins\u201d \u2014 a simple and tight analysis. In: Luby, M., Rolim, J.D.P., Serna, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159\u2013170. Springer, Heidelberg (1998)"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Talgam-Cohen, I., Yan, Q.: Supply-limiting mechanisms. In: EC, pp. 844\u2013861 (2012)","DOI":"10.1145\/2229012.2229077"},{"key":"25_CR30","unstructured":"Sivan, B.: Prior Robust Optimization. Ph.D. thesis, University of Wisconsin-Madison (2013)"},{"issue":"1","key":"25_CR31","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1), 8\u201337 (1961)","journal-title":"J. Finance"},{"issue":"21\u201323","key":"25_CR32","doi-asserted-by":"publisher","first-page":"2196","DOI":"10.1016\/j.tcs.2009.02.001","volume":"410","author":"C Yu","year":"2009","unstructured":"Yu, C.: Truthful mechanisms for two-range-values variant of unrelated scheduling. Theor. Comput. Sci. 410(21\u201323), 2196\u20132206 (2009)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T09:12:31Z","timestamp":1703754751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}