Abstract: The research on its principle and the character of the problem discussed shows that the game theory may be applied to the selection of repetitiveness transportation corridors. Through the mathematic description ofthe corridors’selecting, itsgame model is setup, and the algorithmforthismodel isgiven on the basis ofthe interated elimination of strictly dominated actions. In addition, the settingup ofthe players’ set, the number of the Nash equilibrium and the expansion of the model are analyzed. Finally, by comparingwith AHP, the possibility to expand this model to the Bayesian game model is discussed.