Linear programming duality and more generally geometric duality in R^n have been an essential tool in the study of communication complexity, starting with Yao's famous minimax theorem (1983). Over the past decade, uses of duality have become increasingly diverse and frequent in the area. We will survey several representative applications of duality in communication complexity, including relations among communication complexity measures, communication lower bounds for concrete functions, and connections between communication complexity and learning theory.