{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:50:34Z","timestamp":1769979034717,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705741","type":"print"},{"value":"9783540705758","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_67","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"820-832","source":"Crossref","is-referenced-by-count":80,"title":["Bayesian Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annam\u00e1ria","family":"Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"67_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS 2004, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: On the computational power of iterative auctions I: demand queries. Discussion paper no. 381, The Center for the Study of Rationality, The Hebrew University. An extended abstract in EC 2005 contained preliminary results (2005)","DOI":"10.1145\/1064009.1064013"},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctionss with complement-free bidders. In: The 37th ACM symposium on theory of computing (STOC) (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA 2006 (2006)","DOI":"10.1145\/1109557.1109675"},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U.: On maximizing welfare where the utility functions are subadditive. In: STOC 2006 (2006)","DOI":"10.1145\/1132516.1132523"},{"key":"67_CR7","unstructured":"Feige, U., Vondrak, J.: The allocation problem with submodular utility functions (manuscript, 2006)"},{"key":"67_CR8","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish routing with incomplete information. In: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms (SPAA), pp. 203\u2013212 (2005)","DOI":"10.1145\/1073970.1074000"},{"key":"67_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1007\/11600930_107","volume-title":"Internet and Network Economics","author":"D. Garg","year":"2005","unstructured":"Garg, D., Narahari, Y.: Price of anarchy of network routing games with incomplete information. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 1066\u20131075. Springer, Heidelberg (2005)"},{"key":"67_CR10","doi-asserted-by":"crossref","unstructured":"Groves, T.: Incentives in teams. Econometrica, 617\u2013631 (1973)","DOI":"10.2307\/1914085"},{"key":"67_CR11","doi-asserted-by":"crossref","unstructured":"Harsanyi, J.C.: Games with incomplete information played by \u2019bayesian\u2019 players, parts i ii and iii. Management science\u00a014 (1967-1968)","DOI":"10.1287\/mnsc.14.5.320"},{"key":"67_CR12","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"67_CR13","doi-asserted-by":"crossref","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: ACM conference on electronic commerce (2001)","DOI":"10.1145\/501158.501161"},{"key":"67_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: ACM Conference on Electronic Commerce (2000)","DOI":"10.1145\/352871.352872"},{"key":"67_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC (1999)","DOI":"10.1145\/301250.301287"},{"key":"67_CR16","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Computationally feasible vcg-based mechanisms. In: ACM Conference on Electronic Commerce (2000)","DOI":"10.1145\/352871.352898"},{"issue":"2","key":"67_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"67_CR18","volume-title":"FOCS","author":"A. Vetta","year":"2002","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: FOCS. IEEE Computer Society, Los Alamitos (2002)"},{"key":"67_CR19","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"},{"key":"67_CR20","doi-asserted-by":"crossref","unstructured":"Vondrak, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC 2008 (2008)","DOI":"10.1145\/1374376.1374389"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:13:13Z","timestamp":1738325593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}