Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods

Jella Pfeiffer

ISBN 10: 3836450062 / ISBN 13: 9783836450065

Editore: VDM Verlag Dr. Müller Jan 2008, 2008

Riguardo questo articolo

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.

Codice articolo 9783836450065

Dati bibliografici

• Titolo: Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods
• Editore: VDM Verlag Dr. Müller Jan 2008
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3836450062
• ISBN 13: 9783836450065
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 24 L x 0 A x 0 P centimetri 24 centimetri di larghezza per 0 centimetri di altezza per 0 centimetri di profondità
• Peso: 222 grammi

Descrizione articolo

Riassunto

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.