There is a widespread hope that, in the near future, algorithms become so sophisticated that ``solutions" to most problems are found by machines. In this note, we throw some doubts on this expectation by showing the following impossibility result: given a set of finite-memory, finite-iteration...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes....

We prove that, in all finite generic extensive-form games of perfect information, a continuous-time best response dynamic always converges to a Nash equilibrium component. We show the robustness of convergence by an approximate best response dynamic: whatever the initial state and an allowed...

This paper studies strongly symmetric equilibria (SSE) in continuous-time games of strategic experimentation with Poisson bandits. SSE payoffs can be studied via two functional equations similar to the HJB equation used for Markov equilibria. This is valuable for three reasons. First, these...

This paper develops a theoretical model based on theories of equilibrium selection in order to predict success rates in threshold public goods games, i.e., the probability with which a group of players provides enough contribution in sum to exceed a predefined threshold value. For this purpose,...

In a coordination game such as the Battle of the Sexes, agents can condition their plays on external signals that can, in theory, lead to a Correlated Equilibrium that can improve the overall payoffs of the agents. Here we explore whether boundedly rational, adaptive agents can learn to...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

Convergence to the Nash equilibrium in a Cournot oligopoly is a question that recurrently arises as a subject of controversy in economics. The development of evolutionary game theory has provided an equilibrium concept more directly connected with adjustment dynamics, and the evolutionary...

Consider an infinitely repeated game where each player is characterized by a "type" which may be unknown to the other players in the game. Suppose further that each player's belief about others is independent of that player's type. Impose an absolute continuity condition on the ex ante beliefs...