A graph G is said to be \emph{d-distinguishable} if there exists a not-necessarily proper coloring with d colors such that only the trivial automorphism preserves the color classes. For a 2-distinguishing labeling, the \emph{ cost of 2-distinguishing}, denoted ρ(G), is defined as the minimum size of a color class over all 2-distinguishing colorings of G. Our work also utilizes \emph{determining sets} of G, sets of vertices S⊆G such that every automorphism of G is uniquely determined by its action on S. The \emph{determining number} of a graph is the size of a smallest determining set. We investigate the cost of 2-distinguishing families of Kneser graphs Kn:k by using optimal determining sets of those families. We show the determining number of \kntwo is equal to ⌈32n−2⌉and give linear bounds on \rho(\kntwo) when n is sufficiently sized