David Gale was one of the mathematicians responsible for the modern form of the theory of duality in linear programming and the associated proof of the minimax theorem in the theory of games. He is a member of the National Academy of Sciences and is Professor Emeritus of Mathematics and Operations Research at the University of California at Berkeley. He is cited by John Nash as being partly responsible for the simplicity of the proof of the theorem for which Nash was awarded the Nobel Prize. In addition to doing research in pure geometry, game theory, and mathematical economics, Gale wrote a recreational math column in the "Mathematical Intelligencer" for some years. In this interview, he shares some thoughts on his education and career, his research in game theory and mathematical economics, and his relationship with Nash.