{"product_id":"combinatorial-auctions-and-knapsack-problems-an-analysis-of-optimization-methods-paperback","title":"Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods - Paperback","description":"\u003cdiv\u003e\u003cp style=\"text-align: right;\"\u003e\u003ca href=\"https:\/\/reportcopyrightinfringement.com\/\" target=\"_blank\" rel=\"nofollow\"\u003e\u003cb\u003eReport copyright infringement\u003c\/b\u003e\u003c\/a\u003e\u003c\/p\u003e\u003c\/div\u003e\u003cp\u003eby \u003cb\u003eJella Pfeiffer\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003eWith 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.\u003c\/p\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 128\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.27 x 9.61 x 6.69 IN\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e December 20, 2007\u003c\/div\u003e\n            ","brand":"BooksCloud","offers":[{"title":"Default Title","offer_id":53376966197555,"sku":"9783836450065","price":83.21,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0300\/5595\/6612\/files\/I8TZPC0MwA9783836450065.webp?v=1779310568","url":"https:\/\/www.vysn.com\/products\/combinatorial-auctions-and-knapsack-problems-an-analysis-of-optimization-methods-paperback","provider":"VYSN","version":"1.0","type":"link"}