{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:29Z","timestamp":1725893969349},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_19","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"163-170","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders"],"prefix":"10.1007","author":[{"given":"Wenbin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jiangtao","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","volume":"24","author":"R. Anstee","year":"1987","unstructured":"Anstee, R.: A polynomial algorithm for b-matchings: An alternative approach. Inform. Process. Lett.\u00a024, 153\u2013157 (1987)","journal-title":"Inform. Process. Lett."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: TARK 2003 (2003)","DOI":"10.1145\/846241.846250"},{"key":"19_CR3","volume-title":"ACM Conference on Electornic Commerce","author":"L. Blumrosen","year":"2005","unstructured":"Blumrosen, L., Nisan, N.: On the computational power of iterative auctions I: Demand queries. In: ACM Conference on Electornic Commerce, ACM Press, New York (2005)"},{"key":"19_CR4","unstructured":"Chen, W.B., Meng, J.T., Yin, D.P.: The upper and lower approximation bounds for k-duplicates combinatorial auctions with submodular and subadditive bidders (in submission)"},{"key":"19_CR5","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, Chichester (1998)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions. MIT Press, Cambridge, 2005 (Forthcoming)","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithm for combinatorial auctions with complement-free bedders. In: Proceedings of 37th STOC, pp. 610\u2013618 (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"19_CR8","unstructured":"Dobzinski, S., Schapira, M.: Optimal upper and lower approximation bound for k-duplicates combinatorial auctions. Working paper (2005)"},{"key":"19_CR9","first-page":"41","volume-title":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing","author":"U. Feige","year":"2006","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 41\u201350. ACM Press, New York (2006)"},{"key":"19_CR10","volume-title":"ACM conference on electronic commerce","author":"B. Lehmann","year":"2001","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: ACM conference on electronic commerce, ACM Press, New York (2001)"},{"key":"19_CR11","volume-title":"ACM Conference On Electronic Commerce","author":"D. Lehmanm","year":"1999","unstructured":"Lehmanm, D., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. In: ACM Conference On Electronic Commerce, ACM Press, New York (1999)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/129712.129772","volume-title":"Proceedings of the twenty-fourth annual ACM symposium on theory of computing","author":"N. Nisan","year":"1992","unstructured":"Nisan, N.: RL\u2009\u2286\u2009SC. In: Proceedings of the twenty-fourth annual ACM symposium on theory of computing, pp. 619\u2013623. ACM Press, New York (1992)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N., Segal, I.: The communication requirements of efficient allocations and supporting prices. Journal of Economic Theory (to appear)","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"19_CR14","unstructured":"Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. In: IJCAI (1999)"},{"issue":"1\/2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0004-3702(02)00229-1","volume":"140","author":"M. Tennenholtz","year":"2002","unstructured":"Tennenholtz, M.: Tractable combinatorial auctions and b-matching. Artificial Intelligence\u00a0140(1\/2), 231\u2013243 (2002)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:39Z","timestamp":1619517099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}