Show simple item record

dc.contributor.authorEgner, Michael Thomas
dc.contributor.authorHower, Walter
dc.contributor.editorHegering, Heinz-Gerd
dc.contributor.editorLehmann, Axel
dc.contributor.editorOhlbach, Hans Jürgen
dc.contributor.editorScheideler, Christian
dc.date.accessioned2019-04-03T12:45:32Z
dc.date.available2019-04-03T12:45:32Z
dc.date.issued2008
dc.identifier.isbn978-3-88579-228-4
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/21302
dc.description.abstractThis 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.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e. V.
dc.relation.ispartofINFORMATIK 2008. Beherrschbare Systeme - dank Informatik. Band 2
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-134
dc.titleComputational Complexity in Constraint-based Combinatorial Auctionsen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages541-545
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationMünchen
mci.conference.date8.-13. September 2008


Files in this item

Thumbnail

Show simple item record