Rectangularity and Tightness: A Normal Form Characterization of Perfect Information Extensive Game Forms

We give an alternative proof of a theorem by Gurvich: A game form G is equivalent to a free extensive game form with perfect information if and only if G is rectangular and tight. It follows that any rectangular and tight game form is Nash solvable. We also present some basic properties of rectangular game forms.