Having access to ideal quantum mechanical resources, the prisoners’ dilemma can be ceased. Here, we propose a distributed circuit allow spatially separated prisoners play game. Decomposing into controlled-Z and single-qubit gates only, design corresponding spin–photon-interaction-based physical setup within reach of current technology. In our setup, spins are considered players’ logical qubits,...

This paper seeks to make two contributions. First, we propose and analyze a tractable model of strategic play in which players behave as if their expectations about their opponents’ behavior vary with their own choices. We refer to this nonstandard updating as magical thinking. The model provides a unified view of documented behavior in a range of often-studied games, such as the Prisoners’ Dil...

This paper extends Kajii and Morris (1997)’s notion of robustness to incomplete information to repeated and more generally dynamic games. We argue that in dynamic games, the requirements of robustness should be strengthened to allow for small payoff deviations with large probability. Under this strengthening, we show that dynamically robust equilibria can be characterized by applying a one-shot...

We consider a collusive arrangement as an agreement by the players of a game to restrict their choices to certain subsets of their strategy sets. A (collusive) scheme is the Cartesian product of such strategy subsets. We require schemes to be closed under sequential rationality. Using this solution concept, we apply the global game approach (Carlsson and van Damme, 1993) to the infinitely repea...