We study the problem of how to allocate a set of indivisible objects like jobs or houses and an amount of money among a group of people as fairly and as efficiently as possible. A particular constraint for such an allocation is that every person should be assigned with the same number of objects...

This paper studies the problem of how to distribute a set of indivisible objects with an amount M of money among a number of agents in a fair way. We allow any number of agents and objects. Objects can be desirable or undesirable and the amount of money can be negative as well. In case M is...

One set of n objects of type I, another set of n objects of type II, and an amount M of money is to be completely allocated among n agents in such a way that each agent gets one object of each type with some amount of money. We propose a new solution concept to this problem called a perfectly...