We prove that in a market where agents rank objects independently and uniformly at random, there exists an assignment of objects to agents with a constant average rank (i.e., an average rank independent of the market size). The proof builds on techniques from random graph theory and the FKG...

Lotteries are a common way to resolve ties in assignment mechanisms that ration resources. We consider a model with a continuum of agents and a finite set of re- sources with heterogeneous qualities, where the agents’ preferences are generated from a multinomial-logit (MNL) model based on the...

We prove that in a market where agents rank objects independently and uniformly at random, there exists an assignment of objects to agents with a constant average rank (i.e., an average rank independent of the market size). The proof builds on techniques from random graph theory and the FKG...

Waitlists are commonly used to allocate scarce resources such as organs. Waitlist policies attempt to ensure fairness toward agents who wait longer by assigning them priority points (`a la first-come first-served). We show that such point systems can lead to severe inequality across the...

We study matching policies in a dynamic exchange market with random compatibility, in which some agents are easier to match than others. In steady state this asymmetry creates an endogenous imbalance: hard-to-match agents wait for partners, while easy-to-match agents can match almost immediately...

Lotteries are a common way to resolve ties in assignment mechanisms that ration resources. We consider a model with a continuum of agents and a finite set of resources with heterogeneous qualities, where the agents' preferences are generated from a multinomial-logit (MNL) model based on the...