For a number of differing auction settings, we consider the sale of a single item amongst fixed number of auction participants. It is interesting that under a certain game-theoretic construction all these auctions can be seen to be equivalent.

The auction model which we describe below is called the *symmetric independent private values model* (SIPV).

- An auctioneer has a single, indivisible item for sale. bidders wish to bid for the item.
- Each bidder believes the items
*value*is euros, where . - We assume each value is random variable which is independent of all other values, has cumulative distribution and has a continuous probability density function , i.e. values are
*symmetric*and*independent*. - We assume each bidder knows his value and the density function . We assume the bidder does not explicitly know the other bidders values for , i.e. values are
*private*. - Each bidder chooses a bid as a function and .
- From the vector bidders bids , the auctioneer chooses the
*outcome*of the auction: who wins the item and how much each bidder pays. - Given bids , the function gives the
*decision*of the auctioneer. Here where , the th unit vector in , signifies that bidder has won the item. - Given bids , the vector gives the payment given by each bidder.
- We call a vector of decisions and payments, , an
*outcome*. The function , which map bids to outcomes, is the*auction mechanism*. - We assume the mechanism auction is
*symmetric*, namely, permuting the entries of the bid vector will correspondingly permute of the entries of and . So, there is not inherent bias towards any bidder. - Given the vectors of valuations and bids , the
*payoff*to bidder is

Here , take value in its th component and zero in all other components.

Two popular forms of auctions are the *English auction*, where bidders sequential increase the current highest bid until one bidder remains, and the *Dutch auction*, where the price of the item is lowered incrementally until one bidder agrees to pay the current price. We will not focus on the dynamics of such auctions. Instead, we simply consider *sealed bid auctions*. Here bidders to write down their bid and then pass this on to the auctioneer without any communication with other bidders. The sealed bid analogue of the English auction and Dutch auction are the second-price sealed bid auction^{1}, where highest bid wins the item and pays the price of the second highest bid, and the first-price sealed bid auction, where the highest bid wins the item and pays a price equal to that winning bid. Because the biggest value is, of course, bigger than the second biggest, it is tempting to assert that a first-price auction would generate more revenue that a second price auction. However, this does not account for how bidders will alter their bids to gain a good payoff, and as we see shortly this intuition can be seen to be incorrect. Once again, the notion of equilibrium for our SIPV auction.

A *Bayes-Nash Equilibrium* is a set of bidding strategies such that, given their value, each bidder maximizes their expected payoff

- Here is the vector with the th component removed.
- The above equilibrium assumes that bidders are
*risk neutral*, that is they are concerned only with maximizing their expected payoff and are not worried with the random variation in that payoff. - For a Nash equilibrium each player was explicitly aware of who she was playing, their strategies and the games payoffs. In this auction setting, each player is not aware of the type of their opponents, in particular, the amount each opponent values the item is unknown. We view this unknown parameter as a random variable (i.e. Bayesian) and then players look for a strategy/bid with the best expected reward. This is a Bayes-Nash Equilibrium.

The following next will aid our analysis of a Bayes-Nash Equilibrium.

**Theorem** [The Envelope Theorem] For a function , , we define

We suppose that

Then

**Proof:** Because, for any and , and , we have

Letting the first inequality and letting in the second inequality respectively gives^{2}

Integrating this continuous function gives .

We consider the expected payoff of bidder , with fixed value and bid , and then observe the best expected payoff:

From now on, we assume that the conditions of the Envelope Theorem are satisfied by .

**Thrm** [Myerson’s Payoff Equivalence Theorem] For a symmetric independent private values auction at Bayes-Nash equilibrium , expected payoffs satisfy,

where and, consequently, the expected payments are given by

- The crucial point here is that the Bayes-Nash expected payoff is a function of players ’s chance of winning given his valuation. The function need not depend on the payment structure of the auction. So for all auctions for which is the same, the payoffs for remain the same.

**Proof:** By assumption the Envelope Theorem applies to and . Thus

Now, recalling , for fixed and for independent random variables , we observe

Thus at Bayes-Nash equilibrium, if bidder has value then she will bid . So

In the second inequality above, we note equals if wins the auction and equals zero otherwise. Thus, the expected value of is , the probability that bidder wins the item. Substituting, into gives

Observing that , from the above equality the equation immediately follows.

Now we can prove one of the most famous results in auction theory: the Revenue Equivalence Theorem. In very loose terms, the Revenues Equivalence Theorem states that the expected revenue to the auctioneer – that is the expected payments collected from all bidders – is the same for many SIPV auctions. More precisely:

**Thrm** [Revenue Equivalence Theorem] Consider a symmetric independent private values auction with bidders where the conditions of the Envelope Theorem are satisfied. The expected revenue of the auctioneer is equal for all auctions where a bidder with value makes a zero payment and where, at a Bayes-Nash Equilibrium, the item is always awarded to the bidder with the highest valuation.

- Numerous assumptions are made in the statement of this result: SIPV, risk-neutral bids, constant number of bidders. Even so, it is striking that a large array of auctions can be seen to be equivalent.

**Proof** If a bidder with value makes no payment then . If the bidder with the highest value wins then

Applying this to equation , we see that , the expected revenue of the auction, is