This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

Considered are imperfectly discriminating contests in which players may possess private information about the primitives of the game, such as the contest technology, valuations of the prize, cost functions, and budget constraints. We find general conditions under which a given contest of...