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

The paper generalizes Kuhn's Theorem to extensive form games in which players condition their play on the realization of ambiguous randomization devices and use a maxmin decision rule to evaluate the consequences of their decisions. It proves that ambiguous behavioral and ambiguous mixed...

We consider a basic stochastic evolutionary model with rare mutation and a best-reply (or better-reply) selection mechanism. Following Young's papers, we call a state stochastically stable if its long-term relative frequency of occurrence is bounded away from zero as the mutation rate decreases...

We analyze a robust version of the Dynkin game over a set P of mutually singular probabilities. We first prove that conservative player's lower and upper value coincide (Let us denote the value by $V$). Such a result connects the robust Dynkin game with second-order doubly reflected backward...

In a tournament, agents form coalitions, and the coalition with largest power wins the tournament. We introduce a new solution concept for the tournaments, called no threat equilibrium (NTE). NTE is a partition of the agents, where prudent and farsighted agents have no incentive to deviate....

Previous experimental results on one-shot sequential two-player games show that group decisions are closer to the subgame-perfect Nash equilibrium than individual decisions. We extend the analysis of inter-group versus inter-individual decision making by running both one-shot and repeated...