We study a college admissions problem in which colleges accept students by ranking students’ efforts in entrance exams. Students’ ability levels affect the cost of their efforts. We solve and compare the equilibria of “centralized college admissions” (CCA) where students apply to all...

In unrestricted combinatorial auctions, we put forward a mechanism that guarantees a meaningful revenue benchmark based on the possibilistic beliefs that the players have about each other’s valuations. In essence, the mechanism guarantees, within a factor of two, the maximum revenue that the...

We propose a dynamic auction mechanism for efficiently allocating multiple heterogeneous indivisible goods. These goods can be split into two distinct sets so that items in each set are substitutes but complementary to items in the other set. The seller has a reserve value for each bundle of...

This paper studies a contest in which players with unobservable types may form an alliance in a pre-stage of the game to join their forces and compete for a prize. We characterize the pure strategy equilibria of this game of incomplete information. We show that if the formation of an alliance is...