We consider a problem of allocating multiple identical objects to a group of agents and collecting payments. Each agent may receive several objects and has quasi-linear preferences with a submodular valuation function. It is known thatWalrasian mechanisms are manipulable. We investigate the...

Consider the problem of allocating objects to agents and how much they should pay. Each agent has a preference relation over pairs of a set of objects and a payment. Preferences are not necessarily quasi-linear. Non-quasi-linear preferences describe environments where payments influence agents'...

We consider the problem of allocating multiple units of an indivisible object among agents and collecting payments. Each agent can receive multiple units of the object, and his (consumption) bundle is a pair of the units he receives and his payment. An agent's preference over bundles may be...

A seller is selling multiple objects to a set of agents. Each agent can buy at most one object and his utility over consumption bundles (i.e., (object,transfer) pairs) need not be quasilinear. The seller considers the following desiderata for her mechanism, which she terms desirable: (1)...

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model, (1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...