Auction Algorithm
Auction Algorithm
net/publication/2807578
CITATIONS READS
145 222
3 authors, including:
Kevin Leyton-Brown
University of British Columbia
226 PUBLICATIONS 14,246 CITATIONS
SEE PROFILE
All content following this page was uploaded by Kevin Leyton-Brown on 22 November 2012.
Time (s)
case for our pruning technique, much harder than drawing 10
vidual goods. However, this would be an easier case for our 25 units (10 goods) 30 units (12 goods) 35 units (14 goods) 40 units (16 goods)
Time (s)
1
utes, and problems with 25 objects (10 goods) and 1500 bids
in about a second. Because the lines in this graph are sub- 0.01
0 500 1000 1500 2000 2500