{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:54Z","timestamp":1725536814984},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_11","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"112-123","source":"Crossref","is-referenced-by-count":1,"title":["Private Capacities in Mechanism Design"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Auletta","sequence":"first","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"}]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00224-006-1316-9","volume":"40","author":"N. Andelman","year":"2007","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. Theory of Computing Systems\u00a040(4), 423\u2013436 (2007)","journal-title":"Theory of Computing Systems"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Auletta, V., Penna, P., Persiano, G.: Private capacities in mechanism design. Technical report, AEOLUS (2009), http:\/\/www.dia.unisa.it\/~penna\/papers\/capacitated-md-full.pdf","DOI":"10.1007\/978-3-642-03816-7_11"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1111\/j.1468-0262.2006.00695.x","volume":"74","author":"S. Bikhchandani","year":"2006","unstructured":"Bikhchandani, S., Chatterji, S., Lavi, R., Mu\u2019alem, A., Nisan, N., Sen, A.: Weak monotonicity characterizes deterministic dominant strategy implementation. Econometrica\u00a074(4), 1109\u20131132 (2006)","journal-title":"Econometrica"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"11_CR6","first-page":"260","volume-title":"FOCS","author":"S. Dobzinski","year":"2008","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. In: FOCS, pp. 260\u2013269. IEEE Computer Society, Los Alamitos (2008)"},{"key":"11_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":"11_CR8","unstructured":"Gui, H., Muller, R., Vohra, R.V.: Dominant strategy mechanisms with multidimensional types. Discussion Papers 1392, Northwestern University, Center for Mathematical Studies in Economics and Management Science (July 2004)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/11561071_55","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Kov\u00e1cs","year":"2005","unstructured":"Kov\u00e1cs, A.: Fast monotone 3-approximation algorithm for scheduling related machines. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 616\u2013627. Springer, Heidelberg (2005)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multidimensional scheduling via cycle monotonicity. Games and Economic Behavior (2008) (in press), doi:10.1016\/j.geb.2008.08.001","DOI":"10.1016\/j.geb.2008.08.001"},{"key":"11_CR11","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proc. of annual ACM symposium on discrete algorithms (SODA), pp. 1143\u20131152 (2007)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Mathematics of Operations Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"#cr-split#-11_CR13.1","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. Games and Economic Behavior??35, 166???196 (2001);","DOI":"10.1006\/game.1999.0790"},{"key":"#cr-split#-11_CR13.2","unstructured":"Extended abstract in the Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 129???140 (1999)"},{"key":"11_CR14","unstructured":"Roberts, K.: The characterization of implementable choice rules. Aggregation and Revelation of Preferences, 321\u2013348 (1979)"},{"issue":"2","key":"11_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 necessary and sufficient condition for rationalizability in a quasi-linear context. Journal of Mathematical Economics\u00a016(2), 191\u2013200 (1987)","journal-title":"Journal of Mathematical Economics"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/1064009.1064040","volume-title":"Proceedings of the 6th ACM conference on Electronic commerce (EC)","author":"M. Saks","year":"2005","unstructured":"Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proceedings of the 6th ACM conference on Electronic commerce (EC), pp. 286\u2013293. ACM, New York (2005)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8\u201337 (1961)","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:33:50Z","timestamp":1558478030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}