Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding.
Viet Dung DangNicholas R. JenningsPublished in: ICEC (2003)
Keyphrases
- combinatorial auctions
- single item
- winner determination
- multi unit combinatorial auctions
- multi unit
- batch size
- resource allocation
- approximation algorithms
- joint replenishment
- mechanism design
- inventory systems
- multi item
- periodic review
- special case
- holding cost
- mathematical programming
- stochastic demand
- lot sizing
- worst case
- computational complexity
- dynamic programming
- np hard
- ordering cost