Profit Maximizing Prior-free Multi-unit Procurement Auctions with Capacitated Sellers
Arupratan Ray (1), Debmalya Mandal (2), Y. Narahari (1) ((1), Department of Computer Science, Automation, Indian Institute of Science,, Bangalore, India, (2) Harvard School of Engineering, Applied Sciences,, Cambridge, MA)

TL;DR
This paper develops and analyzes prior-free procurement auctions for multiple units from strategic sellers with capacities, providing tight bounds and new auction mechanisms for various informational settings.
Contribution
It introduces the first profit-maximizing prior-free multi-unit procurement auctions, including PEPA and PEPAC, with proven competitiveness and truthfulness across different seller capacity scenarios.
Findings
PEPA is 4-competitive for unit capacity sellers.
PEPAC is truthful and competitive for non-unit capacities.
Results extend to bi-dimensional private information cases.
Abstract
In this paper, we derive bounds for profit maximizing prior-free procurement auctions where a buyer wishes to procure multiple units of a homogeneous item from n sellers who are strategic about their per unit valuation. The buyer earns the profit by reselling these units in an external consumer market. The paper looks at three scenarios of increasing complexity. First, we look at unit capacity sellers where per unit valuation is private information of each seller and the revenue curve is concave. For this setting, we define two benchmarks. We show that no randomized prior free auction can be constant competitive against any of these two benchmarks. However, for a lightly constrained benchmark we design a prior-free auction PEPA (Profit Extracting Procurement Auction) which is 4-competitive and we show this bound is tight. Second, we study a setting where the sellers have non-unit…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Supply Chain and Inventory Management · Optimization and Search Problems
