Consider an agent with fuzzy preferences. This agent, however, has to make
exact choices when faced with different feasible sets of alternatives. What
rule does he follow in making such choices? This paper provides an axiomat
ic characterization of a class of binary choice rules called the alpha sati
sfying rule. When alpha = 1, this rule is the Orlovsky choice rule. On the
other hand, for alpha less than or equal to 1/2, the rule coincides with th
e M-alpha, rule that has been extensively analyzed in the literature on fuz
zy preferences.