Noting that a full characterization of Nash-implementation is given using a canonical-mechanism and Maskin's theorem (Maskin, 1999) is shown using a mechanism with Saijo's type of strategy space reduction (Saijo, 1988), this paper fully characterizes the class of Nash-implementable social choice...

We compare communication about private information to communication about actions in a one-shot 2-person public good game with private information.The informed player, who knows the exact return from contributing and whose contribution is unobserved, can send a message about the return or her...

This paper investigates face-to-face lying and beliefs associated with it. In experiments in Sweden and Japan, subjects answer questions about personal characteristics, play a face-to-face sender-receiver game and participate in an elicitation of lie-detection beliefs. The previous finding of...

Networks can have an important effect on economic outcomes. Given the complexity of many of these networks, agents will generally not know their structure. We study the sensitivity of game-theoretic predictions to the specification of players' (common) prior on the network in a setting where...

We compare communication about private information to communication about actions in a one-shot 2-person public good game with private information. The informed player, who knows the exact return from contributing and whose contribution is unobserved, can send a message about the return or her...

We perform an experiment on a pure coordination game with uncertainty about the payoffs. Our game is closely related to models that have been used in many macroeconomic and financial applications to solve problems of equilibrium indeterminacy. In our experiment each subject receives a noisy...

We study equilibrium reporting behavior in Fischbacher and Föllmi-Heusi (2013)-type cheating games when agents have a fixed cost of lying and image concerns not to be perceived as a liar. We show that equilibria naturally arise in which agents with low costs of lying randomize among a set of...

The paper studies when efficient allocations are implementable via coalition-proof mechanisms. When ambiguous mechanisms are allowed and agents are maxmin expected utility maximizers, we prove that all efficient allocations are implementable via interim coalition incentive compatible mechanisms...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...