Summary: Partizan subtraction games are combinatorial games where two players, say Left and Right, alternately remove a number \(n\) of tokens from a heap of tokens, with \(n \in S_{\mathcal{L}}\) (resp. \(n \in S_{\mathcal{R}}\)) when it is Left’s (resp. Right’s) turn. The first player unable to move loses. These games were introduced by A. S. Fraenkel and A. Kotzig [Int. J. Game Theory 16, 145–154 (1987; Zbl 0662.90095)], where they introduced the notion of dominance, i.e., an asymptotic behavior of the outcome sequence where Left always wins if the heap is sufficiently large. In the current paper, we investigate the other kinds of behaviors for the outcome sequence. In addition to dominance, three other disjoint behaviors are defined, namely weak dominance, fairness and ultimate impartiality. We consider the problem of computing this behavior with respect to \(S_\mathcal{L}\) and \(S_\mathcal{R}\), which is connected to the well-known Frobenius coin problem. General results are given, together with arithmetic and geometric characterizations when the sets \(S_\mathcal{L}\) and \(S_\mathcal{R}\) have size at most 2.