Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
CS 6100 Program 4: Auctions (40 points) Possibly the best known multiunit sealedbid auction is the multiunit Vickrey auction. In this auction, each bidder
 

Summary: CS 6100 Program 4: Auctions (40 points)


Possibly the best known multiunit sealedbid auction is the multiunit Vickrey auction. In this auction, each bidder
submits a sealed bid which specifies how many units they are prepared to buy at every unit price. itemsi[price] indicates
how many items player i would buy if the items sold for 'price' dollars for each unit. We assume the bids for player i are
monotonic decreasing, e.g., itemsi[price] >= itemsi[price+1].

For example, if there are 30 items available, bidders 1, 2, and 3 might bid
price Items1[price] Items2[price] Items3[price]
1 30 30 15
2 30 30 15
3 25 20 15
4 16 14 15
5 10 7 14
6 5 6 13
7 0 3 12
8 0 1 10
9 0 1 9
10 0 1 8

  

Source: Allan, Vicki H. - Department of Computer Science, Utah State University

 

Collections: Computer Technologies and Information Sciences