Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods

Jella Pfeiffer

ISBN 10: 3836450062 / ISBN 13: 9783836450065

Published by VDM Verlag Dr. Müller Jan 2008, 2008

About this Item

Neuware - 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.

Seller Inventory # 9783836450065

Bibliographic Details

• Title: Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods
• Publisher: VDM Verlag Dr. Müller Jan 2008
• Publication Date: 2008
• Language: English
• ISBN 10: 3836450062
• ISBN 13: 9783836450065
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 24W x 0H x 0D centimeters 24 centimeters width by 0 centimeters height by 0 centimeters depth
• Weight: 222 grams

About this title

Synopsis

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.

About the Author

Dipl.-Wirtschaftsinformatikerin, studied Computer Science and Business Administration at the University of Mannheim. Currently, she works as PhD student at the University of Mainz for the Department of Information Systems and Business Administration.