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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020185214
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9783639022315
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9783639022315
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9783639022315
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783639022315_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783639022315
Quantité disponible : 10 disponible(s)
Vendeur : moluna, Greven, Allemagne
Kartoniert / Broschiert. Etat : 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. N° de réf. du vendeur 4950163
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783639022315
Quantité disponible : 2 disponible(s)