This article proposes an efficient and incentive compatible dynamic auction for selling multiple complementary goods. The seller has reserve prices. The auctioneer announces a current price for every bundle of goods and a supply set of goods, every bidder responds with a set of goods demanded at...

We propose a new Walrasian tatonnement process called a double-track procedure for efficiently allocating multiple heterogeneous indivisible items in two distinct sets to many buyers who view items in the same set as substitutes but items across the two sets as complements. In each round of the...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...

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

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