{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:12:57Z","timestamp":1725487977601},"reference-count":32,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181965","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"page":"406-415","source":"Crossref","is-referenced-by-count":14,"title":["Auctions with severely bounded communication"],"prefix":"10.1109","author":[{"given":"L.","family":"Blumrosen","sequence":"first","affiliation":[]},{"given":"N.","family":"Nisan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352872"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-49116-3_1","article-title":"Algorithms for selfish agents","author":"nisan","year":"1999","journal-title":"STACS"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00361"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00296"},{"key":"13","article-title":"Truth revelation in rapid, approximately efficient combinatorial auctions","author":"lehmann","year":"0","journal-title":"Proc 1999 ACM Conference in Electronic Commerce"},{"key":"14","first-page":"572","article-title":"On the role of discrete bid levels in oral auctions","author":"harstad","year":"1994","journal-title":"European J Operations Research"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352897"},{"key":"12","article-title":"The progressive second price auction mechanism for network resource sharing","author":"lazar","year":"0","journal-title":"8th International Symposium on Dynamic Games Maastricht The Netherlands July 1998"},{"article-title":"The communication complexity of efficient allocation problems","year":"2001","author":"nisan","key":"21"},{"key":"20","article-title":"Globally distributed computation over the internet - The popcorn project","author":"nisan","year":"1998","journal-title":"ICDCS"},{"journal-title":"Rules of Encounter Designing Conventions for Automated Negotiation among Computers","year":"1994","author":"rosenschein","key":"22"},{"key":"23","doi-asserted-by":"crossref","DOI":"10.3386\/w7729","article-title":"Last minute bidding and the rules for ending second-price auctions: Theory and evidence from a natural experiment on the internet","author":"roth","year":"2000"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0336"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/231699.231703"},{"key":"26","article-title":"Economic mechanism design for computerized agents","author":"varian","year":"0","journal-title":"Proceedings of the First Usenix Conference on Electronic Commerce New York July 1995"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.2307\/2977633"},{"article-title":"Combinatorial auctions: A survey","year":"2000","author":"vohra","key":"28"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/32.121753"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335332"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181965"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.2307\/1912821"},{"key":"1","article-title":"Incentive-compatible online auctions for digital goods","author":"bar-yossef","year":"0","journal-title":"13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2002"},{"key":"30","article-title":"Auction protocols for decentralized scheduling","author":"walsh","year":"0","journal-title":"Proceedings of The Eighteenth International Conference on Distributed Computing Systems (ICDCS-98) 1998"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380883"},{"key":"6","first-page":"735","article-title":"Competitive auctions and digital goods","author":"goldberg","year":"2001","journal-title":"Symposium on Discrete Algorithms"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501172"},{"key":"5","first-page":"381","article-title":"Optimal auctions","author":"riley","year":"1981","journal-title":"American Economic Review"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.2307\/1912571"},{"key":"4","article-title":"Economic models for allocating resources in computer systems","author":"ferguson","year":"1995","journal-title":"Market-Based Control A Paradigm for Distributed Resource Allocation"},{"key":"9","article-title":"Online markets for distributed market services: The majic system","author":"levy","year":"0","journal-title":"USITS'01 2001"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/49.414643"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","acronym":"SFCS-02","location":"Vancouver, BC, Canada"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181965.pdf?arnumber=1181965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,25]],"date-time":"2018-02-25T01:00:22Z","timestamp":1519520422000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181965","relation":{},"subject":[]}}