We study the mechanism-design problem of guaranteeing desirable performances whenever agents are rational in the sense of not playing weakly dominated strategies. We first provide an upper bound for the best performance we can guarantee among all feasible mechanisms. We then prove the bound to...

We consider a class of mechanism games in which there are multiple principals and three or more agents. For a mechanism game in this class, a sort of folk theorem holds: there is a threshold value for each of the principals such that an allocation is achieved at a pure-strategy sequential...

This paper discusses some connections among several robustness concepts of mechanisms in terms of agents' behaviors. Specifically, under certain conditions such as private values and ``rich'' interdependent values, we show that implementation in (one-round or iterative) undominated strategies, a...