In a multi-stage contest known as a two-player race, players display two fundamental behaviors: (1) the laggard will make a last stand in order to avoid the cost of losing; and (2) the player who is ahead will defend his lead if it is threatened. Last stand behavior, in particular, contrasts...

Donations in-kind can be a mixed blessing for charities, who are often more adept at solicitation than resale. Many organizations rely on raffles to turn donations into cash, but auctions are also common. Theory predicts that all-pay mechanisms should produce more revenue than winner-pay...

We study all-pay auctions with multiple prizes. The players have the same value for all the certain prizes except for one uncertain prize for which each player has a private value. We characterize the equilibrium strategy and show that, independent of the ranking of the uncertain prize, if the...

We study multi-object auctions in the presence of post-auction trade opportunities among bidders who have either single- or multi-object demand. We focus on two formats: Vickrey auctions where package bidding is possible and simultaneous second-price auctions. We show that, under...

A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.

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

A contract auction establishes a contract between a center and one of the bidders. As contracts may describe many terms, preferences over contracts typically display indifferences. The Qualitative Vickrey Auction (QVA) selects the best contract for the winner that is at least as good for the...

We develop a Bayes–Nash analysis of the generalized second-price (GSP) auction, the multi-unit auction used by search engines to sell sponsored advertising positions. Our main result characterizes the efficient Bayes–Nash equilibrium of the GSP and provides a necessary and sufficient...

We consider a market for indivisible items with m buyers and m sellers. Traders privately know their values/costs, which are statistically dependent. Two mechanisms are considered. The buyer's bid double auction collects bids and asks from traders and determines the allocation by selecting a...

We study the problem of allocating m identical items among nm agents with unit demand and private value for consuming the good. We allow payments and focus on dominant-strategy implementation. In the absence of an auctioneer who can absorb payments collected from the agents, the payments must be...