Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination - Softcover

Lebedeva, Ekaterina

Softcover

ISBN 10: 3639022319 ISBN 13: 9783639022315

Publisher: VDM Verlag, 2008

Synopsis

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 for combinatorial auctions is known to be NP-complete.One of the approaches to cope with the hardness ofthe problem is to identify tractable classes of combinatorial 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.

About this title

About the Author

Ekaterina Lebedeva obtained her double M.Sc. degree in Computational Logic at the Free University of Bolzano, Italy, andat Vienna University of Technology, Austria. She currently worksas a research assistant in the Calligramme team in the InstitutNational de Recherche en Informatique et en Automatique inLorraine (INRIA - Grand Est), France.

Edition details

• Publisher: VDM Verlag
• Publication date: 2008
• ISBN 10: 3639022319
• ISBN 13: 9783639022315
• Binding: Paperback
• Language: English
• Number of pages: 80