In this chapter we look at this simultaneous game with randomness, and we discuss connections to games with nonperfect and incomplete information. This is a continuation of Chapter 10, where we saw that knowing in advance the maximum number of moves results in a disappointing optimal solution, where the player who will not have the last move will not even start bidding. What happens if the number of bidding rounds is finite but unknown? Or if the number of rounds is finite, but after every move the game could randomly end?

In SHUBIK AUCTION, the player with the last move

EP - 175 ET - 1 PB - Mathematical Association of America PY - 2014 SN - null SP - 169 T1 - Shubik Auction II T2 - Game Theory Through Examples UR - http://www.jstor.org/stable/10.4169/j.ctt6wpwgj.26 Y2 - 2020/09/21/ ER -