Sciweavers

Share
IJCAI
2001

Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids

10 years 4 months ago
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
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 d...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where IJCAI
Authors Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
Comments (0)
books