Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods - Tapa blanda

Pfeiffer, Jella

 
9783836450065: Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods

Sinopsis

With the rapid diffusion of the internet, different kinds of market designs fore-commerce have emerged. Among these, combinatorial auctions (CAs) havegained increased interest as they permit bidders to express their valuationsmore easily. For applying a CA in real world scenarios, fast algorithms areneeded to compute the optimal allocation of the offered goods. Althoughmuch research has dealt with this so-called Winner Determination Problem(WDP), only recently has its equivalence to the well-studied multi-dimensionalknapsack problem (MDKP) been noticed. Therefore, there is a lack of researchwhich compares approaches for solving MDKP and WDP problems. With thiswork, the author, Jella Pfeiffer, provides the missing integrative step, aimingat a more intense understanding and a mutual inspiration of both researchareas. She examines structural differences of test instances from bothdomains, compares the performance of different algorithms, and alludes to asuccessful search behavior of non-exact but fast algorithms. The bookaddresses readers interested in electronic market design and algorithmssolving complex combinatorial optimization problems.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9783639428711: Combinatorial Auctions and Knapsack Problems: An analysis of optimization methods

Edición Destacada

ISBN 10:  3639428714 ISBN 13:  9783639428711
Editorial: AV Akademikerverlag, 2012
Tapa blanda