Books > Computing & IT > General theory of computing
|
Buy Now
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods (Paperback)
Loot Price: R1,263
Discovery Miles 12 630
|
|
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods (Paperback)
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.