This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by Sönmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In particular,...

This paper studies allocation correspondences in the house allocation problems with collective initial endowments. We examine the implications of two axioms, namely 'consistency' and 'unanimity.' Consistency requires the allocation correspondence be invariant under reductions of population....

We consider allocation problems with indivisible goods when agents' preferences are single-peaked. We propose natural rules (called up methods) to solve such a class of problems. We analyzed the properties those methods satisfy and we provide a characterization of them. We also prove that these...

We consider allocation problems with indivisible goods when agents' preferences are single-peaked. In this paper we identify the family of efficient, fair and non-manipulable solutions. We refer to such a family as M-temporary satisfaction methods. Besides, we provide arguments to defend these...

We consider allocation problems with indivisible goods when agents’ preferences are single-peaked. Two natural procedures (up methods and temporary satisfaction methods) are proposed to solve these problems. They are constructed by using priority methods on the cartesian product of agents and...

The Continuous Convex Separable Quadratic Knapsack problem (CQKnP) is an easy but useful model that has very many different applications. Although the problem can be solved quickly, it must typically be solved very many times within approaches to (much) more difficult models; hence an efficient...