{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:06:58Z","timestamp":1775282818593,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424703","type":"print"},{"value":"9783540446668","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_14","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"102-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximation Algorithms for Budget-Constrained Auctions"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Garg","sequence":"first","affiliation":[]},{"given":"Vijay","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Vinayaka","family":"Pandit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"14_CR1","unstructured":"J-P Benoit and V. Krishna. Multiple-object auctions with budget constrained bidders. A working paper at \n                    http:\/\/econ.la.psu.edu\/vkrishna\/multi10.ps\n                    \n                  , April 1998."},{"key":"14_CR2","unstructured":"Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In International Joint Conferences on Artificial Intelligence, 1999."},{"issue":"1","key":"14_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1257\/jep.10.1.159","volume":"10","author":"R. P. McAfee","year":"1996","unstructured":"R. P. McAfee and J. McMillan. Analyzing the airwaves auctions. Journal of Economic Perspectives, 10(1):159\u2013175, 1996.","journal-title":"Journal of Economic Perspectives"},{"issue":"3","key":"14_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1257\/jep.8.3.145","volume":"8","author":"J. McMillan","year":"1994","unstructured":"J. McMillan. Selling spectrum rights. Journal of Economic Perspectives, 8(3):145\u2013162, 1994.","journal-title":"Journal of Economic Perspectives"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/mnsc.26.9.935","volume":"26","author":"T. R. Palfrey","year":"1980","unstructured":"T. R. Palfrey. Multiple object, discriminatory auctions with bidding constraints: A game theoretic analysis. Management Science, 26:935\u2013946, 1980.","journal-title":"Management Science"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1287\/opre.25.4.620","volume":"25","author":"M. Rothkopf","year":"1977","unstructured":"M. Rothkopf. Bidding in simultaneous auctions with a constraint on exposure. Operations Research, 25:620\u2013629, 1977.","journal-title":"Operations Research"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. H. Rothkopf","year":"1998","unstructured":"M. H. Rothkopf, A. Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44:1131\u20131147, August 1998.","journal-title":"Management Science"},{"key":"14_CR8","unstructured":"T. Sandholm. An algorithm for optimal winner determination in combinatorial auction. Technical Report WUCS-99-01, Washington University, Department of Computer Science, January 1999."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"D.B. Shmoys and E. Tardos. An approximation algorithm for the generalised assignment problem. Mathematical Programming A, 62:461\u2013474, 1993.","journal-title":"Mathematical Programming A"},{"key":"14_CR10","unstructured":"Martin Spicer. International survey of spectrum assignment for cellular and pcs. Technical report, September 1996. Federal Telecommunications Commission, available at \n                    http:\/\/www.fcc.gov\/wtb\/auctions\/papers\/spicer.html\n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:06:25Z","timestamp":1558256785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}