This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying AI technologies. However, the possibility of a new type of cheating called a false-name bid, i.e., a bid submitted under a fictitious name, has been pointed out. A protocol called Leveled Division Set (LDS) protocol that is robust against false-name bids has been developed. However, this protocol requires the auctioneer to define a leveled division set. A leveled division set is a series of division sets, where a division set is a set of divisions and a division is a combination of bundles of goods. We need to solve a very complicated optimization problem to construct a leveled division set in order to obtain a good social surplus. We have developed a heuristic method for overcoming this problem. In this method, we first find a good division with a winner determination algorithm, and then construct a leveled division set by using this division as a seed. Through a simulation, we showthat our method can obtain a social surplus that is very close to optimal.
|ジャーナル||IJCAI International Joint Conference on Artificial Intelligence|
|出版物ステータス||出版済み - 12 1 2001|
|イベント||17th International Joint Conference on Artificial Intelligence, IJCAI 2001 - Seattle, WA, 米国|
継続期間: 8 4 2001 → 8 10 2001
All Science Journal Classification (ASJC) codes
- Artificial Intelligence