Choice rules with fuzzy preferences: Some characterizations

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 axiomatic characterization of a class of binary choice rules called the satisfying rule. When =1, this rule is the Orlovsky choice rule. On the other hand, for \leq1/2, the rule coincides with the M rule that has been extensively analyzed in the literature on fuzzy preferences.