We construct an uncoupled randomized strategy of repeated play such that, if every player follows such a strategy, then the joint mixed strategy profiles converge, almost surely, to a Nash equilibrium of the one-shot game. The procedure requires very little in terms of players' information about...

We extend Kohlberg and Mertens' (1986) structure theorem on the Nash correspondence to show that its graph is not only homeomorphic to the underlying space of games, but that the homeomorphism extends to the ambient space of games times strategies, thus implying the graph is unknotted. This has...

By identifying types whose low-order beliefs - up to level li - about the state of nature coincide, we obtain quotient type spaces that are typically smaller than the original ones, preserve basic topological properties, and allow standard equilibrium analysis even under bounded reasoning. Our...

This paper shows a fundamental property of vector fields representing dynamics on spaces of mixed strategies of normal form games whose zeros coincide with the Nash equilibria of the underlying games. The property shown is that the indices of components of zeros of any vector field in this class...

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

Social media are at the center of countless debates on polarization, misinformation, and even the state of democracy in various parts of the world. An essential feature of social media is the ranking algorithm that determines how content is presented to the users. This paper studies the dynamic...

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

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

Ranking algorithms are the information gatekeepers of the Internet era. We develop a stylized model to study the interplay between a ranking algorithm and individual clicking behavior. We consider a search engine that uses an algorithm based on popularity and on personalization. The analysis...

This paper provides a simple theoretical framework to evaluate the effect of key parameters of ranking algorithms, namely popularity and personalization parameters, on measures of platform engagement, misinformation and polarization. The results show that an increase in the weight assigned to...