{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:17:07Z","timestamp":1742379427008},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_55","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"558-567","source":"Crossref","is-referenced-by-count":13,"title":["Spectrum Bidding in Wireless Networks and Related"],"prefix":"10.1007","author":[{"given":"Xiang-Yang","family":"Li","sequence":"first","affiliation":[]},{"given":"Ping","family":"Xu","sequence":"additional","affiliation":[]},{"given":"ShaoJie","family":"Tang","sequence":"additional","affiliation":[]},{"given":"XiaoWen","family":"Chu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J.S., Shachnai, H., Shapira, I.: Scheduling Split Intervals. In: ACM SODA 2002, pp. 732\u2013741 (2002)"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive Compatible Multi Unit Combinatorial Auctions. In: TARK 2003, pp. 72\u201387 (2003)","DOI":"10.1145\/846241.846250"},{"key":"55_CR3","unstructured":"Li, X.Y., Xu, P., Tang, S.J., Chu, X.W.: Spectrum Bidding in Wireless Networks and Related. Technical Report, IIT (2008)"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation Techniques for Utilitarian Mechanism Design. In: ACM STOC 2005, pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"55_CR5","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the Multiple Knapsack Problem. In: ACM SODA 2000, pp. 213\u2013222 (2002)"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Groves, T.: Incentives in Teams. Econometrica, 617\u2013631 (1973)","DOI":"10.2307\/1914085"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Hastad, J.: Clique is Hard to Approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Mathematica, 105\u2013142 (1999)","DOI":"10.1007\/BF02392825"},{"key":"55_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLS. Journal of ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of ACM"},{"key":"55_CR10","unstructured":"Jansen, K., Zhang, G.: On Rectangle Packing: Maximizing Benefits. In: ACM SODA 2004, pp. 204\u2013213 (2004)"},{"key":"55_CR11","unstructured":"Kovaleva, S.: Improved Dynamic Programming Subroutine in the PTAS for the unit-Height Rectangle Packing Problem. In: APPOL II Workshop (2002)"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Lehmann, D.J., O\u2019Callaghan, L.I., Shoham, Y.: Truth Revelation in Approximately Efficient Combinatorial Auctions. In: ACM Conf. on Electronic Comm, pp. 96\u2013102 (1999)","DOI":"10.1145\/336992.337016"},{"key":"55_CR13","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"2002","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (2002)"},{"key":"55_CR14","unstructured":"Papadimitriou, A.A.C., Talwar, K., Tardos, E.: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. In: ACM SODA 2003, pp. 205\u2013214 (2003)"},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"Stine, J.A.: Spectrum Management: The Killer Application of ad hoc and Mesh Networking. In: IEEE Symp. on New Frontiers in Dynamic Spectrum Access Net (2005)","DOI":"10.1109\/DYSPAN.2005.1542634"},{"key":"55_CR16","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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:02:21Z","timestamp":1605762141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}