{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:15:34Z","timestamp":1743084934034,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_21","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:07:44Z","timestamp":1286971664000},"page":"234-245","source":"Crossref","is-referenced-by-count":3,"title":["Single-Parameter Combinatorial Auctions with Partially Public Valuations"],"prefix":"10.1007","author":[{"given":"Gagan","family":"Goel","sequence":"first","affiliation":[]},{"given":"Chinmay","family":"Karande","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Archer, A., Papadimitriou, C., Talwar, K., Tardos, E.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: SODA 2003: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 205\u2013214 (2003)"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","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\u00a056(1), 1\u201332 (2009)","journal-title":"J. ACM"},{"key":"21_CR3","volume-title":"Algorithmic Game Theory, ch. 11","author":"L. Blumrosen","year":"2007","unstructured":"Blumrosen, L., Nisan, N.: Algorithmic Game Theory, ch. 11. Cambridge University Press, Cambridge (2007)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Buchfuhrer, D., Dughmi, S., Fu, H., Kleinberg, R., Mossel, E., Papadimitriou, C., Schapira, M., Singer, Y., Umans, C.: Inapproximability for vcg-based combinatorial auctions. In: SODA 2010: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 518\u2013536 (2010)","DOI":"10.1137\/1.9781611973075.45"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N.: Limitations of vcg-based mechanisms. In: STOC 2007: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 338\u2013344 (2007)","DOI":"10.1145\/1250790.1250842"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: STOC 2005: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 610\u2013618 (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 1064\u20131073 (2006)","DOI":"10.1145\/1109557.1109675"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Goel, G., Karande, C., Wang, L.: Single-parameter combinatorial auctions with partially public valuations. CoRR abs\/1007.3539 (2010)","DOI":"10.1007\/978-3-642-16170-4_21"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Lucier, B.: Bayesian algorithmic mechanism design. In: STOC 2010: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 301\u2013310 (2010)","DOI":"10.1145\/1806689.1806732"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/S0899-8256(03)00184-2","volume":"47","author":"R. Holzman","year":"2001","unstructured":"Holzman, R., Kfir-dahav, N., Monderer, D., Tennenholtz, M.: Bundling equilibrium in combinatorial auctions. Games and Economic Behavior\u00a047(1), 104\u2013123 (2001)","journal-title":"Games and Economic Behavior"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 595\u2013604 (2005)","DOI":"10.1109\/SFCS.2005.76"},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","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\u00a049(5), 577\u2013602 (2002)","journal-title":"J. ACM"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Mirrokni, V., Schapira, M., Vondrak, J.: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In: EC 2008: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 70\u201377 (2008)","DOI":"10.1145\/1386790.1386805"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.geb.2007.12.009","volume":"64","author":"A. Mu\u00e1lem","year":"2008","unstructured":"Mu\u00e1lem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract. Games and Economic Behavior\u00a064(2), 612\u2013631 (2008)","journal-title":"Games and Economic Behavior"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-02930-1_26","volume-title":"Automata, Languages and Programming","author":"N. Nisan","year":"2009","unstructured":"Nisan, N., Bayer, J., Chandra, D., Franji, T., Gardner, R., Matias, Y., Rhodes, N., Seltzer, M., Tom, D., Varian, H., Zigmond, D.: Google\u2019s auction for tv ads. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 309\u2013327. Springer, Heidelberg (2009)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Schapira, M., Singer, Y.: On the hardness of being truthful. In: FOCS 2008: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 250\u2013259 (2008)","DOI":"10.1109\/FOCS.2008.54"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Vondrak, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 67\u201374 (2008)","DOI":"10.1145\/1374376.1374389"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:17:27Z","timestamp":1740593847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}