This paper proposes an estimation method for a repeated auction game under the presence of capacity contraints. The estimation strategy is computationally simple as it does not require solving for the equilibrium of the game. It uses a two stage approach. In the first stage the distribution of...

This paper proposes an estimation method for a repeated auction game under the presence of capacity contraints. The estimation strategy is computationally simple as it does not require solving for the equilibrium of the game. It uses a two stage approach. In the first stage the distribution of...

This paper proposes an estimation method for a repeated auction game under the presence of capacity contraints. The estimation strategy is computationally simple as it does not require solving for the equilibrium of the game. It uses a two stage approach. In the first stage the distribution of...

Sequential sealed rst-price and open ascending bid auctions are studied. We examine which auction rule achieves the low procurement cost. We show that the answer to this policy question depends on whether the items are com- plements or substitutes. With substitutes, the rst-price auction is...

This paper proposes an estimation method for a repeated auction game under the presence of capacity contraints. The estimation strategy is computationally simple as it does not require solving for the equilibrium of the game. It uses a two stage approach. In the first stage the distribution of...