{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T06:05:32Z","timestamp":1759730732027},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_19","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"235-246","source":"Crossref","is-referenced-by-count":5,"title":["Truthfulness and Approximation with\u00a0Value-Maximizing Bidders"],"prefix":"10.1007","author":[{"given":"Salman","family":"Fadaei","sequence":"first","affiliation":[]},{"given":"Martin","family":"Bichler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1462153.1462157","volume":"56","author":"M Babaioff","year":"2009","unstructured":"Babaioff, M., Lavi, R., Pavlov, E.: Single-value combinatorial auctions and algorithmic implementation in undominated strategies. J. ACM 56(1), 1\u201332 (2009)","journal-title":"J. ACM"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1086\/261411","volume":"94","author":"G Demange","year":"1986","unstructured":"Demange, G., Gale, D., Sotomayor, M.: Multi-item auctions. J. Polit. Econ. 94, 863\u2013872 (1986)","journal-title":"J. Polit. Econ."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Dughmi, S.: On the power of randomization in algorithmic mechanism design. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 505\u2013514. IEEE (2009)","DOI":"10.1109\/FOCS.2009.42"},{"issue":"1","key":"19_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.jcss.2011.02.010","volume":"78","author":"S Dobzinski","year":"2012","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. J. Comput. Syst. Sci. 78(1), 15\u201325 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-540-79309-0_17","volume-title":"Algorithmic Game Theory","author":"J Feldman","year":"2008","unstructured":"Feldman, J., Muthukrishnan, S.M., Nikolova, E., P\u00e1l, M.: A truthful mechanism for offline ad slot scheduling. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 182\u2013193. Springer, Heidelberg (2008)"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41, 587\u2013601 (1973)","journal-title":"Econometrica"},{"issue":"1\u20133","key":"19_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0166-218X(99)00124-9","volume":"99","author":"M Halldorsson","year":"2000","unstructured":"Halldorsson, M., Kratochvil, J., Telle, J.: Independent sets with domination constraints. Discrete Appl. Math. 99(1\u20133), 39\u201354 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"19_CR8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0899-8256(03)00184-2","volume":"47","author":"R Holzman","year":"2004","unstructured":"Holzman, R., Kfir-Dahav, N., Monderer, D., Tennenholtz, M.: Bundling equilibrium in combinatorial auctions. Games Econ. Behav. 47(1), 104\u2013123 (2004)","journal-title":"Games Econ. Behav."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Lavi, R.: Computationally efficient approximation mechanisms. In: Algorithmic Game Theory, pp. 301\u2013329 (2007)","DOI":"10.1017\/CBO9780511800481.014"},{"issue":"6","key":"19_CR10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2049697.2049699","volume":"58","author":"R Lavi","year":"2011","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. J. ACM (JACM) 58(6), 25 (2011)","journal-title":"J. ACM (JACM)"},{"key":"19_CR11","volume-title":"Combinatorial Auctions","author":"D Lehmann","year":"2006","unstructured":"Lehmann, D., Mueller, R., Sandholm, T.: The winner determination problem. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions. MIT Press, Cambridge (2006)"},{"issue":"5","key":"19_CR12","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D Lehmann","year":"2002","unstructured":"Lehmann, D., O\u0107allaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM (JACM) 49(5), 577\u2013602 (2002)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"19_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.A.: Strategy-proofness and arrow\u2019s conditions. existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theory 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theory"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, W., Yuan, S., Wang, J.: Optimal real-time bidding for display advertising. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014, pp. 1077\u20131086. ACM, New York (2014)","DOI":"10.1145\/2623330.2623633"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:59:49Z","timestamp":1498341589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}