Combinatorial Auctions and Knapsack Problems: An analysis of optimization methods - Couverture souple
Synopsis
Revision with unchanged content. With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Combinatorial Auctions and Knapsack Problems: An analysis...
Image fournie par le vendeur
Combinatorial Auctions and Knapsack Problems
Edité par
AV Akademikerverlag Jun 2012, 2012
ISBN 10 : 3639428714
ISBN 13 : 9783639428711
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Revision with unchanged content. With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems. 128 pp. Englisch. N° de réf. du vendeur 9783639428711
Acheter neuf
EUR 59
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image d'archives
Combinatorial Auctions and Knapsack Problems: An analysis.
Edité par
AV Akademikerverlag, 2012
ISBN 10 : 3639428714
ISBN 13 : 9783639428711
Neuf
Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 26357478788
Acheter neuf
EUR 79,37
Frais de port :
EUR 3,43
Vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Combinatorial Auctions and Knapsack Problems: An analysis.
Edité par
AV Akademikerverlag, 2012
ISBN 10 : 3639428714
ISBN 13 : 9783639428711
Neuf
Couverture souple
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Print on Demand. N° de réf. du vendeur 356060763
Acheter neuf
EUR 82,44
Frais de port :
EUR 7,44
De Royaume-Uni vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Combinatorial Auctions and Knapsack Problems: An analysis.
Edité par
AV Akademikerverlag, 2012
ISBN 10 : 3639428714
ISBN 13 : 9783639428711
Neuf
Couverture souple
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18357478798
Acheter neuf
EUR 84,64
Frais de port :
EUR 9,95
De Allemagne vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Combinatorial Auctions and Knapsack Problems
Edité par
AV Akademikerverlag, 2012
ISBN 10 : 3639428714
ISBN 13 : 9783639428711
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Pfeiffer JellaDipl.-Wirtschaftsinformatikerin, studied Computer Science and Business Administration at the University of Mannheim. Currently, she works as PhD student at the University of Mainz for the Department of Information Syste. N° de réf. du vendeur 4987081
Acheter neuf
EUR 46,32
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Combinatorial Auctions and Knapsack Problems
Edité par
AV Akademikerverlag Jun 2012, 2012
ISBN 10 : 3639428714
ISBN 13 : 9783639428711
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Revision with unchanged content. With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 128 pp. Englisch. N° de réf. du vendeur 9783639428711
Acheter neuf
EUR 59
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Combinatorial Auctions and Knapsack Problems : An analysis of optimization methods
impression à la demandeVendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Revision with unchanged content. With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems. N° de réf. du vendeur 9783639428711
Acheter neuf
EUR 59
Frais de port :
EUR 61,05
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Combinatorial Auctions and Knapsack Problems | An analysis of optimization methods
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Combinatorial Auctions and Knapsack Problems | An analysis of optimization methods | Jella Pfeiffer | Taschenbuch | 128 S. | Englisch | 2012 | AV Akademikerverlag | EAN 9783639428711 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. N° de réf. du vendeur 106408159
Acheter neuf
EUR 51,05
Frais de port :
EUR 70
De Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)