Random extensive form games

We consider two-player random extensive form games where the payoffs at the leaves are independently drawn at random from a given feasible set C. We study the asymptotic distribution of the subgame perfect equilibrium outcome for binary-trees with increasing depth in various random (or deterministic) assignments of players to nodes. We characterize the assignments under which the asymptotic distribution concentrates around a point. Our analysis provides a novel way with a solid strategic justification to implement a Pareto efficient outcome for two-player implementation problems.