{ "item_title" : "Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods", "item_author" : [" Jella Pfeiffer "], "item_description" : "With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/83/645/006/3836450062_b.jpg", "price_data" : { "retail_price" : "52.92", "online_price" : "52.92", "our_price" : "52.92", "club_price" : "52.92", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details