Hypertree Decompositions for Combinatorial Auctions - Optimal Winner Determination

0 durchschnittliche Bewertung
( 0 Bewertungen bei Goodreads )
 
9783639022315: Hypertree Decompositions for Combinatorial Auctions - Optimal Winner Determination
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
 
 
Reseña del editor:

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gebraucht kaufen Angebot ansehen

Versand: EUR 24,00
Von Deutschland nach USA

Versandziele, Kosten & Dauer

In den Warenkorb

Beste Suchergebnisse beim ZVAB

1.

LEBEDEVA EKATERINA
Verlag: Vdm Verlag (2008)
ISBN 10: 3639022319 ISBN 13: 9783639022315
Gebraucht Taschenbuch Anzahl: 1
Anbieter
sparbuchladen
(Göttingen, Deutschland)
Bewertung
[?]

Buchbeschreibung Vdm Verlag, 2008. Taschenbuch. Zustand: Gebraucht. Gebraucht - Wie neu Titel auf Lager, leichte Lagerpsuren, Versand am selben Werktag der Bestellung bis 16 Uhr, - 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. 80 pp. Englisch. Artikel-Nr. INF1000032312

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Gebraucht kaufen
EUR 19,90
Währung umrechnen

In den Warenkorb

Versand: EUR 24,00
Von Deutschland nach USA
Versandziele, Kosten & Dauer