Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Hypertree Decompositions for Combinatorial Auctions - Optimal Winner Determination

Hypertree Decompositions for Combinatorial Auctions - Optimal Winner Determination

Lebedeva, Ekaterina

Paperback

General Computers

ISBN10: 3639022319
ISBN13: 9783639022315
Publisher: Blues Kids Of Amer
Published: Aug 27 2008
Pages: 80
Weight: 0.26
Height: 0.17 Width: 6.00 Depth: 9.00
Language: English
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.

Also in

General Computers

View All