Logo des Repositoriums
 
Konferenzbeitrag

Computational Complexity in Constraint-based Combinatorial Auctions

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2008

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e. V.

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.

Beschreibung

Egner, Michael Thomas; Hower, Walter (2008): Computational Complexity in Constraint-based Combinatorial Auctions. INFORMATIK 2008. Beherrschbare Systeme - dank Informatik. Band 2. Bonn: Gesellschaft für Informatik e. V.. PISSN: 1617-5468. ISBN: 978-3-88579-228-4. pp. 541-545. Regular Research Papers. München. 8.-13. September 2008

Schlagwörter

Zitierform

DOI

Tags