Player i has valuation vi and vi > vi+1 > 0. The set of actions for each player is a bid bi ∈ [0,∞]. The price paid for the item is p = maxi{bi} and the player of minimum index bidding this price wins. The payoff for player i is vi − p if i wins, 0 else. A Nash equilibrium is denoted b∗ = {bi }. If b∗ is a Nash equilibrium, then player 1 wins. Suppose I… (More)

@inproceedings{Rosenberg2005ACI,
title={A Course In Game Theory: solutions to exercises},
author={Burton Rosenberg},
year={2005}
}