Rationalizing Choice Functions By Multiple Rationales
提出一种用多个线性排序来理性化违反“无关选项独立性”公理的选择函数的方法，刻画了理性化任意选择函数所需的最少排序数的紧上界，并计算了几种具体选择程序的最小排序数。
The paper presents a notion of rationalizing choice functions that violate the “Independence of Irrelevant Alternatives” axiom. A collection of linear orderings is said to provide a rationalization by multiple rationales for a choice function if the choice from any choice set can be rationalized by one of the orderings. We characterize a tight upper bound on the minimal number of orderings that is required to rationalize arbitrary choice functions, and calculate the minimal number for several specific choice procedures.