The evolution of boundedly rational rules for playing normal form games is studied within stationary environments of stochastically changing games. Rules are viewed as algorithms prescribing strategies for the different normal form games that arise. It is shown that many of the folk results of...

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

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