Consider the following all-pay auction.
There is an object that is worth K to n bidders. Each bidder i submits a bid b(i). The highest
bidder wins the object while every bidder, not just the winner, pays his bid. ( In case of a tie, a winner is chosen randomly among those who submit the hightest bid with equal probability.)
Bidder i`s payoff is K-b(i) if he wins, and -b(i) otherwise.
Find a symmetric mixed strategy Nash equilibrium in which each bidder chooses his bid following a cdf F with support [0 , K].
求指导！
扫码加好友，拉您进群
全部版块
我的主页
收藏
