The paper analyzes the seller's expected revenue in auctions with a large number of asymmetric players. We explicitly calculate the revenue in large asymmetric first-price, second-price, and optimal auctions to O(1/n^3) accuracy, where n is the number of players. These calculations show that the...

The paper analyzes the revenue of auctions with asymmetric bidders with a large, but finite number of players. We explicitly calculate the seller's expected revenue in large asymmetric first-price, second-price, and optimal auctions to O(1/n ³) accuracy, where n is the number of players. These...

The standard method for computing the equilibrium strategies of asymmetric first-price auctions is the backward-shooting method. In this study we show that the backward-shooting method is inherently unstable, and that this instability cannot be eliminated by changing the numerical methodology of...

We introduce a new approach for analysis and numerical simulations of asymmetric first-price auctions, which is based on dynamical systems. We apply this approach to asymmetric auctions in which players’ valuations are power-law distributed, i.e., Fi(v) = v^{α_i} , i = 1, · · · , n. We...

The standard method for computing the equilibrium strategies of asymmetric first-price auctions is the backward-shooting method. In this study we show that the backward-shooting method is inherently unstable, and that this instability cannot be eliminated by changing the numerical methodology of...