A sender wishes to transmit a secret to a receiver through a communication network, where some nodes are controlled by an adversary. We characterize the directed networks for which there exist ε-secret and ε-strongly secure communication protocols (∀ε0): if all nodes are obedient the...

This paper explores how the ability to commit in games affect equilibrium payoffs. More precisely, we consider two-stage games, called commitment games, in which players can commit to some of their strategies in the first stage, and play the game induced by their commitment in the second stage....

This Note studies the problem of implementing social choice correspondences in environments where individuals have doubts about the rationality of their opponents. We postulate the concept of [epsilon]-minimax regret as our solution concept and show that social choice correspondences that are...