{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:59Z","timestamp":1725559019168},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_4","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"26-38","source":"Crossref","is-referenced-by-count":33,"title":["Auctions with Budget Constraints"],"prefix":"10.1007","author":[{"given":"Nir","family":"Andelman","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, E.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 205\u2013214 (2003)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: Proc. 9th Conf. on Theoretical Aspects of Rationality and Knowledge, (TARK) (2003)","DOI":"10.1145\/846241.846250"},{"key":"4_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Deshmukh, K., Goldberg, A.V., Hartline, J.D., Karlin, A.R., 361\u2013373: Truthful and competitive double auctions. In: Proc. 10th Ann. European Symp. on Algorithms (ESA), pp. 361\u2013373 (2002)","DOI":"10.1007\/3-540-45749-6_34"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Fiat, A.V., Goldberg, J.D.: Competitive generalized auctions. In: Proc. 34th Ann. ACM Symp. on Theory of Computing (STOC), pp. 7\u201381 (2002)","DOI":"10.1145\/509907.509921"},{"key":"4_CR6","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Proc. 16th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 548\u2013553 (1999)"},{"key":"4_CR7","unstructured":"Goldberg, V., Hartline, J.D.: Competitiveness via consensus. In: Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 2003, pp. 215\u2013222 (2003)"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentocal processors. J. of the Association for Computing Machinery\u00a023, 317\u2013327 (1976)","journal-title":"J. of the Association for Computing Machinery"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013104. Plenium Press, New York (1972)"},{"key":"4_CR10","unstructured":"Leyton-Brown, K., Shoham, Y., Tennenholtz, M.: Bidding clubs in first-price auctions. In: AAAI\/IAAI, pp. 373\u2013378 (2002)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: Proc. 3rd ACM Conf. on Electronic Commerce (EC), pp. 18\u201328 (2001)","DOI":"10.1145\/501158.501161"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"4_CR13","unstructured":"Mu\u2019alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: AAAI\/IAAI, pp. 379\u2013384 (2002)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proc. 2nd ACM Conf. on Electronic Commerce (EC), pp. 1\u201312 (2000)","DOI":"10.1145\/352871.352872"},{"issue":"8","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. Rothkopf","year":"1998","unstructured":"Rothkopf, M., Pekec, A., Harstad, R.: Computationally manageable combinatorial auctions. Management Science\u00a044(8), 1131\u20131147 (1998)","journal-title":"Management Science"},{"key":"4_CR16","unstructured":"Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. In: Proc. 16th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 542\u2013547 (1999)"},{"issue":"1\/2","key":"4_CR17","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","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:45Z","timestamp":1605759705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}