We propose a class of decisive collective choice rules that rely on a linear ordering to partition the majority relation into two acyclic relations. The first of these relations is used to pare down the set of the feasible alternatives into a shortlist while the second is used to make a final...

Ranking by rating consists in evaluating the performances of items using exogenous rating functions and ranking these items according to their performance ratings. Any such method is separable: the ordering of two items does not depend on the performances of the remaining items. When...

We analyze infinite-horizon choice functions within the setting of a simple linear technology. Time consistency and efficiency are characterized by stationary consumption and inheritance functions, as well as a transversality condition. In addition, we consider the equity axioms Suppes-Sen,...

We reconsider the following cost-sharing problem: agent i = 1, ...,n demands a quantity xi of good i; the corresponding total cost C(x1, ..., xn) must be shared among the n agents. The Aumann-Shapley prices (p1, ..., pn) are given by the Shapley value of the game where each unit of each good is...

We examine the maximal-element rationalizability of choice functions with arbitrary domains. While rationality formulated in terms of the choice of greatest elements according to a rationalizing relation has been analyzed relatively thoroughly in the earlier literature, this is not the case for...