Numerical Solution of Asymmetric Auctions

We propose the backward indifference derivation (BID) algorithm, a new method to numerically approximate the pure strategy Nash equilibrium (PSNE) bidding functions in asymmetric first-price auctions. The BID algorithm constructs a sequence of finite-action PSNE that converges to the continuum-action PSNE by finding where bidders are indifferent between actions. Consequently, our approach differs from prevailing numerical methods that consider a system of poorly behaved differential equations. After proving convergence (conditional on knowing the maximum bid), we evaluate the numerical performance of the BID algorithm on four examples, two of which have not been previously addressed.

Duke Scholars

Author David L. Banks Statistical Science