{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:08:59Z","timestamp":1763057339486},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_52","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"596-607","source":"Crossref","is-referenced-by-count":11,"title":["New Constructions of Mechanisms with Verification"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Auletta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"De Prisco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. of the STOC, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. of FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-27836-8_17","volume-title":"Automata, Languages and Programming","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: The power of verification for one-parameter agents. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 171\u2013182. Springer, Heidelberg (2004)"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"52_CR5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"William Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8\u201337 (1961)","journal-title":"The Journal of Finance"},{"issue":"1","key":"52_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"Edward H. Clarke","year":"1971","unstructured":"Clarke, E.: Multipart Pricing of Public Goods. Public Choice, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentive in Teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"52_CR8","unstructured":"Lavi, R., Mu\u2019Alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: Proc. of FOCS (2003)"},{"key":"52_CR9","unstructured":"Gui, H., Muller, R., Vohra, R.V.: Dominant strategy mechanisms with multidimensional types. Technical report (2004)"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proc. of EC, pp. 286\u2013293 (2005)","DOI":"10.1145\/1064009.1064040"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11429647_3","volume-title":"Structural Information and Communication Complexity","author":"V. Auletta","year":"2005","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: On designing truthful mechanisms for online scheduling. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 3\u201317. Springer, Heidelberg (2005)"},{"key":"52_CR12","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Mahdian, M., Parkes, D.C.: Online auctions with re-usable goods. In: Proc. of EC 2005, pp. 165\u2013174 (2005)","DOI":"10.1145\/1064009.1064027"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Porter, R.: Mechanism design for online real-time scheduling. In: Proc. of EC 2004, pp. 61\u201370 (2004)","DOI":"10.1145\/988772.988783"},{"key":"52_CR14","unstructured":"Mu\u2019Alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: Proc. of 18th AAAI, pp. 379\u2013384 (2002)"},{"key":"52_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-4068(87)90007-3","volume":"16","author":"J.C. Rochet","year":"1987","unstructured":"Rochet, J.C.: A condition for rationalizability in a quasi-linear context. Journal of Mathematical Economics\u00a016, 191\u2013200 (1987)","journal-title":"Journal of Mathematical Economics"},{"key":"52_CR16","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"52_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_69","volume-title":"Automata, Languages and Programming","author":"C. Chekuri","year":"2001","unstructured":"Chekuri, C., Khanna, S.: A PTAS for minimizing weighted completion time on uniformly related machines. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, Springer, Heidelberg (2001)"},{"issue":"2","key":"52_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jagm.1998.0987","volume":"30","author":"F. Chudak","year":"1999","unstructured":"Chudak, F., Shmoys, D.: Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms\u00a030(2), 323\u2013343 (1999)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T17:07:45Z","timestamp":1555693665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11786986_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}