We study a mechanism design problem under the assumption that renegotiation cannot be prevented. We investigate what kind of equilibria of which mechanisms are renegotiation-proof under a variety of renegotiation procedures, and which social choice functions can be implemented in a way that is...

We study a problem of optimal auction design in the realistic case in which the players can collude both on the way they play in the auction and on their participation decisions. Despite the fact that the principal's opportunities for extracting payments from the agents in such a situation are...

We extend the 'no-haggling' result of Riley and Zeckhauser (1983) to the class of linear multiproduct monopoly problems when the buyer's valuations are smoothly distributed. In particular we show that there is no loss for the seller in optimizing over mechanisms such that all allocations belong...