Unformatted text preview: A , which is the %-maximal from the nonoptimal alternatives. The second-best proce-dure does not satisfy condition ∗ : If A contains all the elements in B besides the %-maximal, then C ( B ) ∈ A ⊂ B but C ( A ) 6= C ( B ) . We will now show that condition ∗ is a sufFcient condition for a choice function to be formulated as if the decision maker is maxi-mizing some preference relation. Proposition: Assume that C is a choice function with a domain containing at least all subsets of X of size no greater than 3. If C satisFes ∗ , then there is a preference % on X so that C = C % ....
View Full Document
- Fall '10
- choice function, preference relation