We examine the strategy-proof allocation of multiple divisible and indivisible resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. We find that any allocation mechanism obtained by maximizing a separably concave...

We examine the strategy-proof allocation of multiple divisible and indivisible resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. We find that any allocation mechanism obtained by maximizing a separably concave...

Consider a market for a resource under disequilibrium prices where suppliers and demanders are privately informed about their optimal supply and consumption levels. Strategy-proof market clearing mechanisms give suppliers and demanders dominant strategy incentives to truthfully reveal this...

We present a polynomial time method for identifying the maximal set in excess demand at a given payoff vector. This set can be used in "large" partnership formation problems to identify the minimum element in the set of individually rational payoff vectors at which there is no overdemanded set...

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multiitem auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey-English-Dutch auction and it contains the Vickrey-English...

This paper proposes an iterative sealed-bid auction for selling multiple heterogeneous items to bidders interested in buying at most one item. It generalizes the single item bisection auction (Grigorieva et al. Econ Theory, 30:107–118, <CitationRef CitationID="CR6">2007</CitationRef>) to the environment with multiple heterogeneous...</citationref>

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multi-item auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey–English–Dutch auction and it contains the...

This paper proposes an iterative sealed-bid auction for selling multiple heterogeneous items with unit-demand agents. It generalizes the single item bisection auction (Grigorieva Et. al, 2007) to the environment with multiple heterogeneous items. We show that it elicits a minimal amount of...