We show that in a class of I‐agent mechanism design problems with evidence, commitment is unnecessary, randomization has no value, and robust incentive compatibility has no cost. In particular, for each agent i, we construct a simple disclosure game between the...

I characterize the implications of the common prior assumption for finite orders of beliefs about beliefs at a state and show that in finite models, the only such implications are those stemming from the weaker assumption of a common support. More precisely, given any finite N and any finite...

This paper reports a strategy study on a twenty-period supergame of a numerically specified asymmetric Cournot duopoly. The subjects were twenty-three participants of a student seminar. Three rounds of game playing were followed by three rounds of strategy programming with computer tournaments....