We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it has (1) a product structure, is (2) upper semi-continuous, (3) always includes a best reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...

We call a correspondence, defined on the set of mixed strategy pro les, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy pro le, and (4) is convex- and closed-valued. For each...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it has (1) a product structure, is (2) upper semi-continuous, (3) always includes a best reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...

We call a correspondence, defined on the set of mixed strategy profiles, a generalized best-reply correspondence if it has (1) a product structure, is (2) upper hemi--continuous, (3) always includes a best-reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...

We study games with almost perfect information and an infinite time horizon. In such games, at each stage, the players simultaneously choose actions from finite action sets, knowing the actions chosen at all previous stages. The payoff of each player is a function of all actions chosen during...

We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it has (1) a product structure, is (2) upper semi-continuous, (3) always includes a best reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...

Harris, Reny, and Robson (Econometrica, 1995) add a public randomization device to dynamic games with almost perfect information to ensure existence of subgame perfect equilibria (SPE). We show that when nature's moves are atomless in the original game, SPE obtained via this channel can be...

Fixed points of the (most) refined best reply correspondence, introduced in Balkenborg, Hofbauer, and Kuzmics (2013), in the agent normal form of extensive form games with perfect recall have a remarkable property. They induce fixed points of the same correspondence in the agent normal form of...

This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by various selection theories. We present all...