Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...

We study a sealed-bid auction between two bidders with asymmetric independent private values. The two bidders own asymmetric shares in a partnership. The higher bidder buys the lower bidderʼs shares at a per-unit price that is a convex combination of the two bids. The weight of the lower bid is...

We characterize the surplus-maximizing trading mechanism under two-sided incomplete information and interim individual rationality, when one party can make a value-enhancing specific investment. This mechanism exhibits a trade-off between providing investment incentives and inducing voluntary...

It has been suggested that players often produce simplified and/or misspecified mental representations of interactive decision problems (Kreps, 1990). We submit that the relational structure of players' preferences in a game induces cognitive complexity, and may be an important driver of such...

This paper develops a payoff equivalence theorem for mechanisms with ambiguity averse participants with preferences of the Maxmin Expected Utility (MEU) form (Gilboa and Schmeidler, 1989). We use our payoff equivalence result to explicitly characterize the revenue maximizing private value...

Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on...

A number of identical objects is allocated to a set of privately informed agents. Agents have linear utility in money. The designer wants to assign objects to agents that possess specific traits, but the allocation can only be conditioned on the willingness to pay and on observable...

We study the second best in a single unit sale to two bidders. This is the allocation that maximizes the expected social surplus subject to the biddersʼ incentive compatible constraints when the first best is not implementable. We prove that Maskinʼs (1992) result that any first best...

Prosper, today the second largest social lending marketplace with nearly 1.5 million members and $380 million in funded loans, employed an auction mechanism amongst lenders to finance each borrower's loan until 2010. Given that a basic premise of social lending is cheap loans for borrowers, how...

We study the problem of finding the profit-maximizing mechanism for a monopolistic provider of a single, non-excludable public good. Our model covers the most general setting, namely, we allow for correlation in the signal distribution as well as for informational externalities in the...