Bayesian incentive compatibility via matchings

The construction is based on a maximum weight matching in the type space of each agent that be calculated quickly when the type spaces are reasonably sized. Furthermore, the computation can be performed independently for each agent and, therefore, scales well with the number of agents. A similar construction was previously given by Hartline and Lucier (2010) for agents with single-dimensional types; ours allows multi-dimensional types.