We study how a principal should optimally choose between implementing a new policy and maintaining the status quo when information relevant for the decision is privately held by agents. Agents are strategic in revealing their information; the principal cannot use monetary transfers to elicit...

We study how a principal should optimally choose between implementing a new policy and maintaining the status quo when information relevant for the decision is privately held by agents. Agents are strategic in revealing their information; the principal cannot use monetary transfers to elicit...

We study decision rules for committees that repeatedly take a binary decision. Committee members are privately informed about their payoffs and monetary transfers are not feasible. In static environments, the only strategy-proof mechanisms are voting rules which are criticized for being...

Which decision rule should we use to make a binary collective choice? While voting procedures are applied ubiquitously, they are criticized for being inefficient. Using monetary transfers, efficient choices can be made at the cost of a budget imbalance. Is it optimal to do so? And why are...

A time bank is a group of individuals and/or organizations in a local community that set up a common platform to trade services among themselves. There are several well-known problems associated with this type of banking, e.g., high overhead costs for record keeping and difficulties to identify...

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

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

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