{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:12:24Z","timestamp":1768558344491,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540200642","type":"print"},{"value":"9783540396581","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_12","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:24:30Z","timestamp":1279826670000},"page":"102-113","source":"Crossref","is-referenced-by-count":16,"title":["Multi-player and Multi-round Auctions with Severely Bounded Communication"],"prefix":"10.1007","author":[{"given":"Liad","family":"Blumrosen","sequence":"first","affiliation":[]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Segal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: Auctions with severely bounded communications. In: 43th FOCS (2002)","DOI":"10.1109\/SFCS.2002.1181965"},{"key":"#cr-split#-12_CR2.1","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N., Segal, I.: Multi-player and multi-round auctions with severely bounded communications (2003);","DOI":"10.1007\/978-3-540-39658-1_12"},{"key":"#cr-split#-12_CR2.2","unstructured":"Full version available from http:\/\/www.cs.huji.ac.il\/~liad"},{"key":"12_CR3","unstructured":"Riley, J.G., Samuelson, W.F.: Optimal auctions. American Economic Review, 381\u2013392 (1981)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: Symposium on Discrete Algorithms, pp. 735\u2013744 (2001)","DOI":"10.1007\/3-540-44676-1_35"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: ACM Symposium on Theory of Computing (2001)","DOI":"10.1145\/380752.380883"},{"key":"12_CR6","unstructured":"Klemperer, P.: The economic theory of auctions. Edward Elgar Publishing (2000)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: ACM Conference on Electronic Commerce, pp. 233\u2013241 (2000)","DOI":"10.1145\/352871.352897"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Lehmann, D., O\u2019Callaghan, L.I., Shoham, Y.: Truth revelation in rapid, approximately efficient combinatorial auctions. In: 1st ACM conference on electronic commerce (1999)","DOI":"10.1145\/336992.337016"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Myerson, R.B.: Optimal auction design. Mathematical of operational research, 58\u201373 (1981)","DOI":"10.1287\/moor.6.1.58"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Algorithms for selfish agents. In: STACS (1999)","DOI":"10.1007\/3-540-49116-3_1"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Nisan, N., London, S., Regev, O., Camiel, N.: Globally distributed computation over the internet \u2013 the popcorn project. In: ICDCS (1998)","DOI":"10.1109\/ICDCS.1998.679836"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC (1999)","DOI":"10.1145\/301250.301287"},{"key":"12_CR13","unstructured":"Nisan, N., Segal, I.: Communication requirements of efficiency and supporting lindahl prices (2003), working paper available from http:\/\/www.cs.huji.ac.il\/~noam\/mkts.html"},{"key":"12_CR14","unstructured":"Web page. ebay, http:\/\/www.ebay.com"},{"key":"12_CR15","unstructured":"Web page. vertical-net, http:\/\/www.verticalnet.com"},{"key":"12_CR16","unstructured":"Ronen, A., Saberi, A.: Optimal auctions are hard. In: 43th FOCS (2002)"},{"key":"12_CR17","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":"12_CR18","unstructured":"Vohra, R., de Vries, S.: Combinatorial auctions: A survey (2000), Availailabe from www.kellogg.nwu.edu\/faculty\/vohra\/htm\/res.htm"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Waldspurger, C.A., Hogg, T., Huberman, B.A., Kephart, J.O., Stornetta, W.S.: Spawn: A distributed computational economy. IEEE Transactions on Software Engineering\u00a018(2) (1992)","DOI":"10.1109\/32.121753"},{"key":"12_CR20","unstructured":"Walsh, W.E., Wellman, M.P., Wurman, P.R., MacKie-Mason, J.K.: Auction protocols for decentralized scheduling. In: Proceedings of The Eighteenth International Conference on Distributed Computing Systems (ICDCS 1998) (1998)"},{"key":"12_CR21","unstructured":"Web-page. commerce-one, http:\/\/www.commerceone.com"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:00:44Z","timestamp":1559293244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}