Fortunately, there is hope: randomized mechanisms are emerging that reconcile computational and economic constraints, yielding optimal approximate mechanisms for problems where deterministic mechanisms provably fail. In this talk, I will advocate randomized mechanism design by taking a tour through a sequence of our recent results. I will illustrate the power of randomized mechanisms by: (1) Overviewing recent positive results for paradigmatic problems such as multi-unit auctions and variants of combinatorial auctions, and (2) Showing how a black-box reduction can transforms any FPTAS for a social-welfare maximization problem into a truthful FPTAS , and (3) Arguing that, in the future, there is hope for more powerful black box reductions that would yield sweeping positive results for welfare-maximization problems in general.