Two-player incentive compatible outcome functions are affine maximizers

Abstract

In mechanism design, for a given type space, there may be incentive compatible outcome functions which are not affine maximizers. We prove that for two-player games on a discrete type space, any given outcome function can be turned into an affine maximizer through a nontrivial perturbation of the type space. Furthermore, our theorems are the strongest possible in this setup.