Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is k...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahrood University of Technology
2017-07-01
|
| Series: | Journal of Artificial Intelligence and Data Mining |
| Subjects: | |
| Online Access: | http://jad.shahroodut.ac.ir/article_880_fa4a4182279cdf654e64ae5d275c387b.pdf |