Items related to Hypertree Decompositions for Combinatorial Auctions...
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.
"synopsis" may belong to another edition of this title.
Search results for Hypertree Decompositions for Combinatorial Auctions...
Stock Image
Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783639022315_new
Quantity: Over 20 available
Stock Image
Hypertree Decompositions for Combinatorial Auctions - Optimal Winner Determination
Published by
VDM Verlag Dr. Mueller e.K. 2008-08-27, 2008
ISBN 10: 3639022319
ISBN 13: 9783639022315
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783639022315
Quantity: 10 available
Stock Image
Hypertree Decompositions for Combinatorial Auctions Optimal Winner Determination
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783639022315
Quantity: Over 20 available
Stock Image
Hypertree Decompositions for Combinatorial Auctions Optimal Winner Determination
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783639022315
Quantity: Over 20 available
Stock Image
Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783639022315
Quantity: Over 20 available
Stock Image
Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9783639022315
Quantity: 2 available
Seller Image
Hypertree Decompositions for Combinatorial Auctions
Published by
VDM Verlag Dr. Müller|VDM Verlag Dr. Müller e.K., 2008
ISBN 10: 3639022319
ISBN 13: 9783639022315
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Kartoniert / Broschiert. Condition: New. 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 t. Seller Inventory # 4950163
Quantity: Over 20 available
Seller Image
Hypertree Decompositions for Combinatorial Auctions : Optimal Winner Determination
Published by
VDM Verlag Dr. Müller, VDM Verlag Dr. Müller E.K., 2008
ISBN 10: 3639022319
ISBN 13: 9783639022315
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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
Quantity: 2 available
Stock Image
Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020185214
Quantity: Over 20 available