A simplified model of multistage bidding between two differently informed agents (insider and uninformed participant) is described using repeated games with asymmetric information. The solutions for these games are obtained in the explicit form for the case of three possible bids. The game value (the maximal guaranteed insider’s payoff) and the optimal players’ strategies are expressed using a second-order recursive sequence.