Computational Complexity in Constraint-based Combinatorial Auctions

Zusammenfassung
This paper analyzes the dynamic programming construction of bundles within the framework of the Winner Determination Problem in Combinatorial Auctions, based on constraint processing. We discuss different approaches to its representation and highlight the corresponding complexity, employing suitable combinatorics from Discrete Mathematics. Our view may enlighten us about the exponential search space—and incidentally pointing to appropriate techniques to cope with this challenge.
  • Vollständige Referenz
  • BibTeX
Egner, M. T. & Hower, W., (2008). Computational Complexity in Constraint-based Combinatorial Auctions. In: Hegering, H.-G., Lehmann, A., Ohlbach, H. J. & Scheideler, C. (Hrsg.), INFORMATIK 2008. Beherrschbare Systeme - dank Informatik. Band 2. Bonn: Gesellschaft für Informatik e. V.. (S. 541-545).
@inproceedings{mci/Egner2008,
author = {Egner, Michael Thomas AND Hower, Walter},
title = {Computational Complexity in Constraint-based Combinatorial Auctions},
booktitle = {INFORMATIK 2008. Beherrschbare Systeme - dank Informatik. Band 2},
year = {2008},
editor = {Hegering, Heinz-Gerd AND Lehmann, Axel AND Ohlbach, Hans Jürgen AND Scheideler, Christian} ,
pages = { 541-545 },
publisher = {Gesellschaft für Informatik e. V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
541.pdf207.4Kb PDF Öffnen

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken

Mehr Information

ISBN: 978-3-88579-228-4
ISSN: 1617-5468
Datum: 2008
Sprache: en (en)
Typ: Text/Conference Paper
Sammlungen

Zur Langanzeige