PP-2008-12: Uckelman, Joel and Endriss, Ulle (2008) Winner Determination in Combinatorial Auctions with Logic-based Bidding Languages. [Report]
Preview |
Text (Full Text)
PP-2008-12.text.pdf Download (354kB) | Preview |
Text (Abstract)
PP-2008-12.abstract.txt Download (679B) |
Abstract
We propose the use of logic-based preference representation
languages based on weighted propositional formulas for specifying
bids in a combinatorial auction. We then develop several
heuristics for a branch-and-bound search algorithm for
determining the winning bids in this framework and report
on their empirical performance. The logic-based approach
is attractive due to its high degree of
flexibility in designing
a range of different bidding languages within a single
conceptual framework.
Item Type: | Report |
---|---|
Report Nr: | PP-2008-12 |
Series Name: | Prepublication (PP) Series |
Year: | 2008 |
Uncontrolled Keywords: | combinatorial auctions; preference representation |
Depositing User: | Ulle Endriss |
Date Deposited: | 12 Oct 2016 14:36 |
Last Modified: | 12 Oct 2016 14:36 |
URI: | https://eprints.illc.uva.nl/id/eprint/286 |
Actions (login required)
View Item |