We present a new and simple mechanism for repeated public good environments. In the Conditional Contribution Mechanism (CCM), agents send two message of the form, "I am willing to contribute x units to the public good if in total y units are contributed." This mechanism offers agents risk-free...

Online and offline gaming has become a multi-billion dollar industry.However, games of chance are prohibited or tightly regulated in many jurisdictions. Thus, the question whether a game predominantly depends on skill or chance has important legal and regulatory implications. In this paper, we...

Two partners try to dissolve a partnership that owns an asset of ambiguous value, where the value is determined ex post by a draw from an Ellsberg urn. In a within-subject experiment, subjects make decisions in three different bargaining mechanisms: unstructured bargaining, the Texas shoot-out,...

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class of simple imitation rules that includes tit-for-tat but...

We show that in symmetric two-player exact potential games, the simple decision rule imitate-if-better cannot be beaten by any strategy in a repeated game by more than the maximal payoff difference of the one-period game. Our results apply to many interesting games including examples like 2x2...

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 show that for many classes of symmetric two-player games, the simple decision rule 'imitate-if-better' can hardly be beaten by any strategy. We provide necessary and sufficient conditions for imitation to be unbeatable in the sense that there is no strategy that can exploit imitation as a...

Internet experiments are a new and convenient way for reaching a large subject pool. Yet, providing incentives to subjects can be a tricky design issue. One cost effective and simple method is the publication of a high score (as in computer games). We test whether a high score provides adequate...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

In John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous- time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a plausible...