loading...
Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids
National Center of Sciences, Tokyo, Japan July 23-July 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CEC-EEE.2007.76The 9th IEEE International Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Raghav Kumar Gautam, Indian Institute of Science Bangalore, India
N. Hemachandra, Indian Institute of Technology, Bombay Mumbai, India
Y. Narahari, Indian Institute of Science Bangalore, India
Hastagiri Prakash, Indian Institute of Science Bangalore, India
Our attention is focused on designing an optimal procurement mechanism which a buyer can use for procuring multiple units of a homogeneous item based on bids submitted by autonomous, rational, and intelligent suppliers. We design elegant optimal procurement mechanisms for two different situations. In the first situation, each supplier specifies the maximum quantity that can be supplied together with a per unit price. For this situation, we design an optimal mechanism S-OPT (Optimal with Simple bids). In the more generalized case, each supplier specifies discounts based on the volume of supply. In this case, we design an optimal mechanism VD-OPT (Optimal with Volume Discount bids). The VD-OPT mechanism uses the S-OPT mechanism as a building block. The proposed mechanisms minimize the cost to the buyer, satisfying at the same time, (a) Bayesian incentive compatibility and (b) interim individual rationality.
Citation:
Raghav Kumar Gautam, N. Hemachandra, Y. Narahari, Hastagiri Prakash, "Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids," cec-eee, pp.21-28, The 9th IEEE International Conference on E-Commerce Technology and The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (CEC-EEE 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.