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

We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k1 objects are sold in the first round and k2 in the second round, with and without revelation of the first-round winning bids. We demonstrate that...

We study auctions of a single asset among symmetric bidders with affiliated values. We show that the second-price auction minimizes revenue among all efficient auction mechanisms in which only the winner pays, and the price only depends on the losers' bids. In particular, we show that the kth...