Crowding Games with Incomplete Information

Abstract

We study static games in which simultaneous English auctions take place at several separate markets, and each market has multiple identical objects to sell. A bidder who knows her own private valuation of the good and the valuation probability distribution over other bidders has to select one market to participate and each bidder needs at most one unit of the good. We analyze the bidders' mixed-strategy Bayesian Nash equilibrium and develop an algorithm to solve the equilibrium of these games with finite types and finite markets. The uniqueness of symmetric equilibrium has been also proven. ?