Sentence examples for properties of preferences from inspiring English sources

The study of the structural properties of preferences can be traced back to Book III of Aristotle's Topics.

The parameter depth reflects the tuning properties of orientation preference or we can also interpret this as the range of orientation angles that we consider within the iso-orientation domain.

We derive conditions on the model parameters for risk aversion and loss aversion based on observed properties of preference.

The main contribution of the present paper is not to introduce new preference types; one of the goals is rather to derive the number and core properties of preference types from a small set of primitive assumptions on preferences.

In these models, in order to apply the median voter theorem either the single-peaked preferences or single-crossing property of preference profiles are assumed.

Moreover, single-crossing property of preference profiles, which is also sufficient for the existence of a majority voting equilibrium, is also violated.

There are two conditions frequently used in the literature for the median voter theorem: Single-peakedness condition on preferences, and single-crossing property

The objectives of the paper are: (i) to identify properties of agents' preferences that determine whether or not finiteness of contracts causes significant inefficiency; (ii) to evaluate the performance of finite contracts against the ideal optimal contract in a bilateral bargaining model.

The main goal of this paper is to determine which properties of the preference relations are sufficient to assure that the set of 'most-preferred' trees is the set of spanning trees verifying the optimality conditions.

Let us nonetheless proceed by first introducing basic candidate properties of (rational) preference over options and only afterwards turning to questions of interpretation.

Then, we identify general properties of the preference aggregation function, such as independence to irrelevant alternatives, which are sufficient for such sets to be computed in polynomial time.