Computational Complexity in Constraint-based Combinatorial Auctions
| dc.contributor.author | Egner, Michael Thomas | |
| dc.contributor.author | Hower, Walter | |
| dc.contributor.editor | Hegering, Heinz-Gerd | |
| dc.contributor.editor | Lehmann, Axel | |
| dc.contributor.editor | Ohlbach, Hans Jürgen | |
| dc.contributor.editor | Scheideler, Christian | |
| dc.date.accessioned | 2019-04-03T12:45:32Z | |
| dc.date.available | 2019-04-03T12:45:32Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | 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. | en |
| dc.identifier.isbn | 978-3-88579-228-4 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/21302 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e. V. | |
| dc.relation.ispartof | INFORMATIK 2008. Beherrschbare Systeme - dank Informatik. Band 2 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-134 | |
| dc.title | Computational Complexity in Constraint-based Combinatorial Auctions | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 545 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 541 | |
| gi.conference.date | 8.-13. September 2008 | |
| gi.conference.location | München | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1