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...

Predictions under common knowledge of payoffs may differ from those under arbitrarily, but finitely, many orders of mutual knowledge; Rubinstein's (1989)Email game is a seminal example. Weinstein and Yildiz (2007) showed that the discontinuity in the example generalizes: for all types with...

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

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...

The fixed rate tender is one of the main operational formats used by central banks in the implementation of their monetary policies. While academic research has largely dismissed the procedure for its tendency to encourage overbidding, central banks such as the ECB and the Bank of England have...

Colonel Blotto games with discrete strategy spaces effectively illustrate the intricate nature of multidimensional strategic reasoning. This paper studies the equilibrium set of such games where, in line with prior experimental work, the tie-breaking rule is allowed to be flexible. We begin by...

We consider two ascending auctions and show that many of the (unwanted) collusive or signaling equilibria studied in the literature in the framework of the SEAMO (simultaneous English auction for multiple objects) don't have a counterpart in the JAMO (Japanese auction for multiple objects). We...

Ranking algorithms are the information gatekeepers of the Internet era. We develop a stylized framework to study the effects of ranking algorithms on opinion dynamics. We consider rankings that depend on popularity and on personalization. We find that popularity driven rankings can enhance...