Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
Using lexicographic probability systems as representations of players’ beliefs, we define the solution procedure of directed lexicographic rationalizability. We show that the procedure characterizes the family of self-admissible sets (Brandenburger et al., 2008) in finite games. A corollary of this result is that comprehensive rationalizability (Heifetz et al., 2019) yields a self-admissible set.