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

A principal allocates an object to one of I agents. Each agent values receiving the object and has private information regarding the value to the principal of giving it to him. There are no monetary transfers, but the principal can check an agent's information at a cost. A favored-agent...

Game-theoretic analysis often leads to consideration of an infinite hierarchy of beliefs for each player. Harsanyi suggested that such a hierarchy of beliefs could be summarized in a single entity, called the player's type. This chapter provides an elementary construction, complementary to the...

Two properties of preferences and representations for choice under uncertainty which play an important role in decision theory are: (i) admissibility, the requirement that weakly dominated actions should not be chosen; and (ii) the existence of well defined conditional probabilities, that is,...

We discuss the unity between the two standard approaches to noncooperative solution concepts for games. The decision-theoretic approach starts from the assumption that the rationality of the players is common knowledge. This leads to the notion of correlated rationalizability. It is shown that...