We consider envy-free and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In finite economies, we identify under classical preferences each agent’s maximal gain from manipulation. Using this...

This paper investigates an allocation rule that fairly assigns at most one indivisible object and a monetary compensation to each agent, under the restriction that the monetary compensations do not exceed some exogenously given upper bound. A few properties of this allocation rule are stated and...