Popular Matchings Abstract: The problem of assigning heterogeneous objects to agents under one- sided preferences has received much attention in recent years. A matching M is said to be popular, if there is no matching N such that the majority of the agents prefer N over M. In this talk I'll review some of the literature on popular matchings.