Keywords and Synonyms
False-name-proof auctions; Pseudonymous bidding ; Robustness against false-name bids
In Internet auctions, it is easy for a bidder to submit multiple bids under multiple identifiers (e. g., multiple e-mail addresses). If only one item/good is sold, a bidder cannot make any additional profit by using multiple bids. However, in combinatorial auctions, where multiple items/goods are sold simultaneously, submitting multiple bids under fictitious names can be profitable. A bid made under a fictitious name is called a false-name bid.
Each bidder can use multiple identifiers.
Each identifier is unique and cannot be impersonated.
Nobody (except the owner) knows whether two identifiers belongs to the same bidder or not.
The goal is to design a false-name-proof protocol, i. e., a protocol in which using false-names is useless, thus bidders voluntarily...
- 2.Yokoo, M.: The characterization of strategy/false-name proof combinatorial auction protocols: Price-oriented, rationing-free protocol. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 733–739 (2003)Google Scholar