DocumentCode
2743750
Title
A Bidding Strategy in Combinatorial Auctions
Author
Sedeh, Sara Sharifi ; Nematbakhsh, Mohammad Ali ; Mofakham, Faria Nasiri
Author_Institution
Dept. of Comput. Eng., Univ. of Isfahan, Isfahan, Iran
fYear
2011
fDate
25-27 Jan. 2011
Firstpage
422
Lastpage
427
Abstract
Combinatorial auctions are auctions in which bidders bid on combinations of items, bundles, instead of on individual items. In these auctions, bidders always tend to construct and bid on the most beneficial bundles of items, while facing a substantial number of items. Since there are a huge number of items available in a combinatorial auction, deciding on which items to put in bundles is a challenge for bidders. In combinatorial auctions, bundling of items and bidding on the best possible bundles are of great importance and developing an efficient bidding strategy can increase quality of the auctions considerably. In this paper, we have proposed an efficient bidding strategy. Performance of the proposed strategy in various markets has been simulated and compared with the bidding strategies already available in the literature. The obtained results show that in comparison with the previously available bidding strategies, the proposed strategy is more beneficial to both bidders and auctioneer, especially in markets where there is a considerable difference between values of items.
Keywords
combinatorial mathematics; commerce; bidding strategy; bundling; combinatorial auctions; single-round auction; Computational modeling; Computers; Java; MATLAB; Mathematical model; Niobium; Resource management; bidding strategy; bundling; combinatorial auction; single-round auction;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems, Modelling and Simulation (ISMS), 2011 Second International Conference on
Conference_Location
Kuala Lumpur
Print_ISBN
978-1-4244-9809-3
Type
conf
DOI
10.1109/ISMS.2011.69
Filename
5730385
Link To Document