Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination

Книги на иностранных языках → На английском → Компьютеры и ИТ → Разное
Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination
Автор
 
Год
 
Страниц
 
80
ISBN
 
3639022319
Издатель
 
Springer
Категория
 
Разное

Описание:

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.

Похожие книги

Chestnut-Crowned BecardChestnut-Crowned Becard
Год: 2011
Trading and exchangesTrading and exchanges
Автор: Harris L.
Год: 2003
Experience DesignExperience Design
Год: 2011
Managing the Franc Poincare: Economic Understanding and Politcal Constraint in French Monetary Policy, 1928-1936 (Studies on Monetary and Financial History)Managing the Franc Poincare: Economic Understanding and Politcal Constraint in French Monetary Policy, 1928-1936 (Studies on Monetary and Financial History)
Автор: Kenneth Moure
Год: 2003
OrbitsOrbits
Автор: Guochang Xu
Год: 2008
NMR of Proteins and Nucleic Acids (Baker Lecture Series)NMR of Proteins and Nucleic Acids (Baker Lecture Series)
Автор: Kurt Wüthrich
Год: 1986