3 search results - page 1 / 1 » A comparison of two algorithms for multi-unit k-double aucti... |
ATAL
2008
Springer
14 years 1 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
ACMICEC
2003
ACM
14 years 4 months ago
2003
ACM
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared...