{"product_id":"9783836450065","title":"Combinatorial Auctions and Knapsack Problems - an Analysis of Optimization Methods","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\u003cbr\u003e(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.","brand":"VDM Verlag Dr. Mueller E.K.","offers":[{"title":"Default Title","offer_id":47048939929840,"sku":"9783836450065","price":64.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9783836450065_p0.jpg?v=1763687968","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9783836450065","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}