Vickrey Auction Allocation

Problem

A first-price sealed-bid auction (allocator picks the lowest bidder, pays them what they bid) gives agents an incentive to shade — bid higher than true cost. The winner makes more, but the allocator can't tell whether they paid the actual minimum cost. Worse, shading is itself uncertain, so agents waste cycles modelling each other's likely shading. The auction's clean economic property of allocating to the cheapest agent collapses under strategic behaviour.

Solution

The allocator broadcasts the task and a sealed bid window. Each candidate agent submits a sealed bid representing its true cost. The allocator picks the lowest bidder and pays the second-lowest bid. Vickrey's classical result: truthful bidding is the dominant strategy because bidding higher than true cost only loses opportunities while bidding lower lowers the payment without helping win. For multi-task generalisations, use Vickrey-Clarke-Groves (VCG) mechanisms. Distinct from contract-net (which doesn't specify the payment rule) and from first-price auctions (which incentivise shading).

When to use

• Self-interested agents have private costs and the allocator wants truthful reporting.
• Allocator can absorb the second-price premium in exchange for strategy-proofness.
• Single-task or VCG-tractable combinatorial allocation.