Hypertree Decompositions for Combinatorial Auctions : Optimal Winner Determination

Ekaterina Lebedeva

ISBN 10: 3639022319 / ISBN 13: 9783639022315

Published by VDM Verlag Dr. Müller, VDM Verlag Dr. Müller E.K., 2008

About this Item

Neuware - Combinatorial auctions are auctions in which each bidcan be placed on a set of items, as opposed tostandard auctions, in which each bid is placed on asingle item. The winner determination problem forcombinatorial auctions is known to be NP-complete.One of the approaches to cope with the hardness ofthe problem is to identify tractable classes ofcombinatorial auctions by means of hypertreedecompositions. The winner determination problem istractable on the class of instances withcorresponding dual hypergraphs having hypertree widthbounded by a fixed natural number. This bookdescribes an optimal algorithm, calledComputeSetPackingK, for solving the winnerdetermination problem based on these ideas. Thealgorithm was implemented, and experimental resultsare also presented.

Seller Inventory # 9783639022315

Bibliographic Details

• Title: Hypertree Decompositions for Combinatorial Auctions : Optimal Winner Determination
• Publisher: VDM Verlag Dr. Müller, VDM Verlag Dr. Müller E.K.
• Publication Date: 2008
• Language: English
• ISBN 10: 3639022319
• ISBN 13: 9783639022315
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 5D millimeters 220 millimeters width by 150 millimeters height by 5 millimeters depth
• Weight: 137 grams

About this title

Synopsis

Combinatorial auctions are auctions in which each bid can be placed on a set of items, as opposed to standard auctions, in which each bid is placed on a single item. The winner determination problem for combinatorial auctions is known to be NP-complete. One of the approaches to cope with the hardness of the problem is to identify tractable classes of combinatorial auctions by means of hypertree decompositions. The winner determination problem is tractable on the class of instances with corresponding dual hypergraphs having hypertree width bounded by a fixed natural number. This book describes an optimal algorithm, called ComputeSetPackingK, for solving the winner determination problem based on these ideas. The algorithm was implemented, and experimental results are also presented.