We consider full implementation in complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a...

This paper studies the impact of a small probability event on strategic behavior in incomplete information games with non-common priors. It is shown that the global impact of a small probability event (i.e., its propensity to affect strategic behavior at all states in the state space) has an...

A set of networks G is pairwise farsightedly stable (i) if all possible farsighted pairwise deviations from any network g[set membership, variant] G to a network outside G are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improving path from...