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...

It is evident that linear programming model remains the most potent mathematical tool for the efficient allocation of scarce operational resources of an organization. Whilst projecting the graphical method as the easiest solution approach to linear programming where only two constraining factors...

Expected consumer's surplus rarely represents preferences over price lotteries. Still, I give sufficient conditions for policies which maximize aggregate expected surplus to be interim Pareto Optimal. Besides two standard partial equilibrium conditions, I assume that feasible prices satisfy a...

We allocate objects to agents as exemplified primarily by school choice. Welfare judgments of the object-allocating agency are encoded as edge weights in the acceptability graph. The welfare of an allocation is the sum of its edge weights. We introduce the constrained welfare-maximizing...

In ordinal (probabilistic) assignment problems, each agent reports his preference rankings over objects and receives a lottery defined over those objects. A common efficiency notion, sd-efficiency, is obtained by extending the preference rankings to preferences over lotteries by means of...