{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:09Z","timestamp":1742913969284,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_29","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"398-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Mechanisms with Monitoring for Truthful RAM Allocation"],"prefix":"10.1007","author":[{"given":"Annam\u00e1ria","family":"Kov\u00e1cs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: How to route and tax selfish unsplittable traffic. In: SPAA, pp. 196\u2013205 (2004)","DOI":"10.1145\/1007912.1007942"},{"issue":"12","key":"29_CR2","doi-asserted-by":"publisher","first-page":"3779","DOI":"10.1257\/aer.104.12.3779","volume":"104","author":"E Ben-Porath","year":"2014","unstructured":"Ben-Porath, E., Dekel, E., Lipman, B.L.: Optimal allocation with costly verification. Am. Econ. Rev. 104(12), 3779\u20133813 (2014)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1137\/050641181","volume":"39","author":"L Blumrosen","year":"2009","unstructured":"Blumrosen, L., Nisan, N.: On the computational power of demand queries. SIAM J. Comput. 39(4), 1372\u20131391 (2009)","journal-title":"SIAM J. Comput."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-73545-8_20","volume-title":"Computing and Combinatorics","author":"G Christodoulou","year":"2007","unstructured":"Christodoulou, G., Gourv\u00e8s, L., Pascual, F.: Scheduling selfish tasks: about the performance of truthful algorithms. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 187\u2013197. Springer, Heidelberg (2007)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1002\/spe.844","volume":"38","author":"R Dementiev","year":"2008","unstructured":"Dementiev, R., Kettner, L., Sanders, P.: STXXL: standard template library for XXL data sets. Softw. Pract. Exper. 38(6), 589\u2013637 (2008)","journal-title":"Softw. Pract. Exper."},{"issue":"4","key":"29_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A Fiat","year":"1991","unstructured":"Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., Young, N.: Competitive paging algorithms. J. Algorithms 12(4), 685\u2013699 (1991)","journal-title":"J. Algorithms"},{"key":"29_CR8","unstructured":"Fotakis, D., Krysta, P., Ventre, C.: Combinatorial auctions without money. In: AAMAS, pp. 1029\u20131036 (2014)"},{"key":"29_CR9","unstructured":"Fotakis, D., Krysta, P., Ventre, C.: The power of verification for greedy mechanism design. In: AAMAS, pp. 307\u2013315 (2015)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden,T.: Optimal mechanism design and money burning. In: STOC, pp. 75\u201384 (2008)","DOI":"10.1145\/1374376.1374390"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2015.01.001","volume":"571","author":"P Krysta","year":"2015","unstructured":"Krysta, P., Ventre, C.: Combinatorial auctions with verification are tractable. Theoret. Comput. Sci. 571, 21\u201335 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms for Memory Hierarchies","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol. 2625. Springer, Heidelberg (2003)"},{"key":"29_CR13","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, 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.geb.2012.09.002","volume":"86","author":"P Penna","year":"2014","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86, 491\u2013509 (2014)","journal-title":"Games Econ. Behav."},{"key":"29_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. J. Math. Econ. 16, 191\u2013200 (1987)","journal-title":"J. Math. Econ."},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2013.07.034","volume":"518","author":"C Ventre","year":"2014","unstructured":"Ventre, C.: Truthful optimization using mechanisms with verification. Theoret. Comput. Sci. 518, 64\u201379 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"29_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1561\/0400000014","volume":"2","author":"JS Vitter","year":"2006","unstructured":"Vitter, J.S.: Algorithms and data structures for external memory. Found. Trends Theoret. Comput. Sci. 2(4), 305\u2013474 (2006)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"key":"29_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511835216","volume-title":"Mechanism Design: A Linear Programming Approach","author":"RV Vohra","year":"2011","unstructured":"Vohra, R.V.: Mechanism Design: A Linear Programming Approach. Cambridge University Press, New York (2011)"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T09:12:07Z","timestamp":1703754727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_29","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"}}]}}