Individuals and two-person teams play a hidden - action trust game with pre - play communication. We replicate previous results for individuals that non-binding promises increase cooperation rates. But this does not extend to teams. Wh ile teams make non-binding promises to cooperate at the same...

We design a laboratory experiment to identify whether a preference for randomization defines a stable type across different choice environments. In games and individual decisions, subjects face twenty simultaneous repetitions of the same choice. Subjects can randomize by making different choices...

A social choice rule (SCR) $F$ maps preference profiles to lotteries over some finite set of outcomes. $F$ is virtually implementable in (pure and mixed) Nash equilibria provided that for all $\epsilon 0$, there exists a mechanism such that for each preference profile $\theta$, its set of Nash...

A social choice correspondence (SCC) F is implementable in rationalizable strategies provided that there exists a mechanism such that for each state θ, the support of its set of rationalizable outcomes is equal to the socially desirable set F(θ). We find that r -monotonicity is a necessary...