My problem.
Consider the following auction for a single object. There are $n \geq 2$ bidders. They submit their bids simultaneously. The object is allocated to the player who submits the largest bid. If the winner's bid is $b$ he pays the amount $\alpha b$ where $\alpha$ is a positive number. The losers do not pay anything. Ties are broken randomly, with equal probabilities among all the players who submit the largest bid. The bidders' valuations for the object are private information. In particular, each player $i$ knows his own valuation $v_{i}$ which is distributed uniformly over the unit interval. The valuations are distributed independently across the players.
Construct the symmetric BNE of the game. (Assume that the bidding strategy $b :[0,1]$ $\rightarrow$ $\mathbb{R}$ is increasing).
Solution
Let $b :[0,1]$ $\rightarrow$ $\mathbb{R}$ R denote the equilibrium bidding strategy. Then for every $v \in [0, 1]$, we must have:
$v=arg$ $max_{w}((v-\alpha b(w))w^{n-1}$
We compute the first order conditions at $v$ and obtain:
$-\alpha b^{'}(v)v^{n-1}+(n-1)(v-\alpha b(v))v^{n-2}=0$
Which we can simplify as:
$-\alpha b^{'}(v)v+(n-1)(v-\alpha b(v))=0$
The solution to this differential equation is linear: $b (v) = Av$ where $A$ satisfies
$-\alpha Av+(n-1)(v-\alpha Av)=0$
Thus, the equilibrium bidding strategy is
$b(v)=\frac{n-1}{n \alpha}v$
Is there ant alternative way to calculate the BNE for the problem presented above