We define some variations of the Scott rank for countable models and obtain some inequalities involving the ranks. For mono-unary algebras we prove that the game rank of any subtree does not exceed the game rank of the whole model. However, similar questions about linear orders remain unresolved.