Theoretical approaches to lowest unique bid auctions

In this paper, we analyze a game called the lowest unique bid auction (LUBA). It is known that there is no closed form solution for the symmetric mixed strategy equilibria in LUBA. We propose two alternative approaches. We use weak dominance to identify upper bounds for players' bids. Under symmetry, we provide a method to compute a mixed strategy equilibrium by utilizing the recursive structure of the winning chances of the bids under one assumption.