The received characterizations of feasible interim allocations are mostly in the spirit of Border (1991): Fix a family of sets, each containing some player-types, and test the interim allocation under consideration against all these sets. In the published literature, such Border-like...

We study optimal bidder collusion at first-price auctions when the collusive mechanism only relies on signals about bidders' valuations. We build on Fang and Morris (2006) when two bidders have low or high private valuation of a single object and additionally each receives a private noisy signal...

We study optimal contest design in situations where the designer can reward high performance agents with positive prizes and punish low performance agents with negative prizes. We link the optimal prize structure to the curvature of distribution of abilities in the population. In particular, we...

It is well-known that the ability of the Vickrey-Clarke-Groves (VCG) mechanism to implement efficient outcomes for private value choice problems does not extend to interdependent value problems. When an agent's type affects other agents' utilities, it may not be incentive compatible for him to...

We discuss bundle auctions within the framework of an integer allocation problem. We show that for multi-unit auctions, of which bundle auctions are a special case, market equilibrium and constrained market equilibrium are equivalent concepts. This equivalence, allows us to obtain a computable...

We justify risk neutral equilibrium bidding in commonly known fair division games with incompleteinformation by an evolutionary setup postulating (i) minimal common knowledge, (ii) optimal responses to conjectural beliefs how others behave and (iii) evolutionary selection of conjectural beliefs...

Contestants often need to incur an opportunity cost to participate in the competition. In this paper, we accommodate costly entry and study the effort-maximizing prize allocation rule in a contest environment of all-pay auction with incomplete information as in Moldovanu and Sela (2001). As...

Competition for a prize frequently takes the form of dedicating time toward winning a contest. Those who spend the most time become more likely to obtain the prize. We model this competition as an all-pay auction under incomplete information, and report an experiment in which expenditures and...

We study the design of profit-maximizing mechanisms in environments with interdependent values. A single unit of a good is for sale. There is a known joint distribution of the bidders' ex post values for the good. Two programs are considered:(i) Maximize over mechanisms the minimum over...

We examine the properties of all-pay contests in the spirit of Moldovanu and Sela (2001) as the number of entrants grows large under organizer objectives of expected and expected maximum outcomes. Unlike the case with a small number of entrants, with a large number of entrants a single prize...