PP-2010-10: Witzel, Andreas and Endriss, Ulle (2010) Time Constraints in Mixed Multi-unit Combinatorial Auctions. [Report]
Preview |
Text (Full Text)
PP-2010-10.text.pdf Download (190kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2010-10.abstract.txt Download (998B) |
Abstract
We extend the framework of mixed multi-unit combinatorial auctions to
include time constraints, present an expressive bidding language, and
show how to solve the winner determination problem for such auctions
using integer programming. Mixed multi-unit combinatorial auctions are
auctions where bidders can offer combinations of transformations of
goods rather than just simple goods. This model has great potential
for applications in the context of supply chain formation, which is
further enhanced by the integration of time constraints. We consider
different kinds of time constraints: they may be based on either time
points or intervals, they may determine a relative ordering of
transformations, they may relate transformations to absolute time
points, and they may constrain the duration of transformations.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2010-10 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2010 |
| Uncontrolled Keywords: | combinatorial auctions; temporal reasoning; supply-chain management |
| Depositing User: | Ulle Endriss |
| Date Deposited: | 12 Oct 2016 14:37 |
| Last Modified: | 12 Oct 2016 14:37 |
| URI: | https://eprints.illc.uva.nl/id/eprint/389 |
Actions (login required)
 |
View Item |
