In this note we study the allocation and exchange of discrete resources in environ- ments in which monetary transfers are not allowed. We allow each discrete resource to be represented by several copies, extend onto this environment the trading cycles mechanisms of Pycia and Ünver [2009], and...

Allocation and exchange of discrete resources such as kidneys, school seats, and many other resources for which agents have single-unit demand is conducted via direct mechanisms without monetary transfers. Incentive compatibility and efficiency are primary concerns in designing such mechanisms....

Ordinal random mechanisms have been used in real-life situations for reasons such as sustaining fairness or preventing collusion. Two examples of such domains are voting and matching. We investigate whether desirable properties of a random mechanism survive decomposition as a lottery over...

A group of agents exchange discrete resources on a network without recourse to monetary transfers. Allowing for an arbitrary network structure, we show that there is a unique core outcome in the exchange problem. This unique outcome may be implemented via a natural extension of Gale's Top...

Pay-as-bid is the most popular auction format for selling treasury securities. We prove the uniqueness of pure-strategy Bayesian-Nash equilibria in pay-as-bid auctions where symmetrically-informed bidders face uncertain supply, and we establish a tight sufficient condition for the existence of...

We address some open issues regarding the characterization of double auctions. Our model is a two-sided commodity market with either finitely or infinitely many traders. We first unify existing formulations for both finite and infinite markets and generalize the characterization of market...

Fees are omnipresent in markets but, with few exceptions, are omitted in economic models-such as Double Auctions-of these markets. Allowing for general fee structures, we show that their impact on incentives and efficiency in large Double Auctions hinges on whether the fees are homogeneous (as,...

We introduce a general class of simplicity concepts that vary the foresight abilities required of agents in extensive-form games, and use it to provide characterizations of simple mechanisms in social choice environments with and without transfers. We show that obvious strategy-proofness—an...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...