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

A technique to determine closed-loop Nash equilibria of n-player differential games is developed when their dynamic state-control system is composed of decoupled ODEs. In particular, the theory of Lie point symmetries is exploited to achieve first integrals of such systems.

Counterfactual policy evaluation often requires computation of game‐theoretic equilibria. We provide new algorithms for computing pure‐strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that...

We consider multi-stage games, where at each stage, players receive private signals about past and current states, past actions and past signals, and choose actions. We fully characterize the distributions over actions, states, and signals that obtain in any (sequential) communication...

We study a class of games featuring payoff functions being parabolic cylinders where best reply functions are orthogonal and therefore the pure-strategy non-cooperative solution is attained as a Nash equilibrium in dominant strategies. We prove that the resulting threshold of the discount factor...

I investigate the interaction between a country that imports a commodity whose production contributes to a stock pollution, such as electricity, from a country that produces that commodity. If the transboundary externality is priced improperly, the application of a feed-in tariff or border tax...

We observe that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for...

We give a mechanism fully implementing envy-free divisions such that: strategy spaces are symmetric, the set of Nash equilibria is a global attractor for the best-reply dynamics. As a byproduct, undesired mixed-strategy equilibria are weeded out by the adjustment process

We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We give a precise description of the dynamics induced by...

Is civil and criminal litigation a search for truth, like science or philosophy, or a game of skill and luck, like the game of poker? Although the process of litigation has been modeled as a Prisoner’s Dilemma, as a War of Attrition, as a Game of Chicken, and even as a simple coin toss, no one...