Abstract： 

We investigate revenue maximization in general allocation problems with
incomplete information, where we assume quasilinearity, private values, independent
type distributions, and singledimensionality of type spaces. We require a mechanism to
satisfy strategyproofness and expost individual rationality. We assume that each
player has a typeindependent preference ordering over deterministic allocations. We
show that the Myerson’s technique to solve the incentiveconstrained revenue
maximization problem in singleunit auctions can be applied to general allocation
problems, where the incentiveconstrained revenue maximization problem can be
reduced to the simple maximization problem of the sum of players’ marginal revenues
without imposing any incentive constraint. 