{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:41:09Z","timestamp":1736314869807,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322078"},{"type":"electronic","value":"9783540322085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_12","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"147-160","source":"Crossref","is-referenced-by-count":1,"title":["Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents"],"prefix":"10.1007","author":[{"given":"A.","family":"Ferrante","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Parlato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Sorrentino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-31856-9_6","volume-title":"STACS 2005","author":"N. Andelman","year":"2005","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 69\u201382. Springer, Heidelberg (2005)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-540-24749-4_53","volume-title":"STACS 2004","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, P.: Deterministic Truthful Mechanisms for Scheduling on Selfish Machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 608\u2013619. Springer, Heidelberg (2004)"},{"key":"12_CR4","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, P.: 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":"12_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"12_CR6","doi-asserted-by":"publisher","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\u00a0(45), 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematic\u00a017(2) (1969)","DOI":"10.1137\/0117039"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Computationally Feasible VCG Mechanisms. In: Proceedings of the 2nd ACM Conference on Electronic Commerce (EC), pp. 242\u2013252 (2000)","DOI":"10.1145\/352871.352898"},{"key":"12_CR10","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"12_CR11","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. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T19:29:43Z","timestamp":1736278183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11671411_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}