# Symmetric nash equilibrium

I was reading this paper on position auctions for web ads. Basically, there are N slots each with an expected number of clicks (in a particular time period) $x$. Each agent makes a bid $B_i$ of how much they are willing to pay per click. The bids are put in decreasing order and agent who makes the $i^\text{th}$ highest bid receives receives the slot with the $i^\text{th}$ highest click through rate for a price $P_i$ equal to $B_{i+1}$ (except for the last agent who pays nothing).

To obtain the least price to win the $i^\text{th}$ slot, we note that we have to beat the $i^\text{th}$ agent's bid if we are moving up, but that we only have to beat the $i^\text{th}$ agents price if we are moving down. We easily obtain the following equations for Nash Equilibria:

$(v_s-p_s)x_s\ge(v_s-p_t)x_t$ for $t>s$

$(v_s-p_s)x_s\ge(v_s-P_{t-1})x_t$ for $t < s$

The paper then defines the symmetric Nash equilibrium to be a set of prices with:

$(v_s-p_s)x_s\ge(v_s-p_t)x_t$ for all $t$ and $s$

Basically, instead of having the second part of the previous conditions, the first part of the previous equations is valid anywhere.

Is the symmetric Nash equilibrium defined more generally? In particular, is it the same as the symmetric equilibrium in this Wikipedia article

• I don't know how to write the subscript B_(i+1) yet :-( Aug 3, 2010 at 11:02
• $B_{i+1}$. Note braces. Aug 3, 2010 at 11:34