Paper Info
Title
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
Abstract
A newsc heme for electronic sealed-bid auctions that preserves losing bids is presented. By this scheme, the computational complexity of the opening phase can be reduced to O(log l); previous works required O(N驴l) or O(N驴log l) where the number of bidders is N and the range of bids is l. The proposed scheme has two technical points. One is that computational complexity is independent of the number of bidders. The other is a newefficien t value-comparing method. These techniques allowour auction scheme to be more than five hundred times faster than previous schemes. Furthermore, our auction scheme can be eleven million times faster than previous schemes if it is assured that auctioneers do not conspire.
Year
Venue
Keywords
2001
ISC
electronic sealed-bid auction,previous scheme,auction scheme,eleven million time,previous work,efficient sealed-bid auctions,hundred time,log l,lump comparison,massive numbers,techniques allowour auction scheme,proposed scheme,computational complexity,comparative method
Field
DocType
ISBN
Secure channel,Mathematical optimization,Mathematical economics,Computer science,Common value auction,Bidding,Computational complexity theory,Distributed computing
Conference
3-540-42662-0
Citations 
PageRank 
References 
22
1.21
10
Authors
3
Name
Order
Citations
PageRank
Koji Chida17312.49
Kunio Kobayashi2937.08
Hikaru Morita311913.58