15 resultados para Preference Relation

em Université de Montréal, Canada


Relevância:

60.00% 60.00%

Publicador:

Resumo:

We provide a characterization of selection correspondences in two-person exchange economies that can be core rationalized in the sense that there exists a preference profile with some standard properties that generates the observed choices as the set of core elements of the economy for any given initial endowment vector. The approach followed in this paper deviates from the standard rational choice model in that a rationalization in terms of a profile of individual orderings rather than in terms of a single individual or social preference relation is analyzed.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

We study markets with indivisible goods where monetary compensations are not possible. Each individual is endowed with an object and a preference relation over all objects. When preferences are strict, Gale's top trading cycle algorithm finds the unique core allocation. When preferences are not necessarily strict, we use an exogenous profile of tie-breakers to resolve any ties in individuals' preferences and apply Gale's top trading cycle algorithm for the resulting profile of strict preferences. We provide a foundation of these simple extensions of Gale's top trading cycle algorithm from strict preferences to weak preferences. We show that Gale's top trading cycle algorithm with fixed tie-breaking is characterized by individual rationality, strategy-proofness, weak efficiency, non-bossiness, and consistency. Our result supports the common practice in applications to break ties in weak preferences using some fixed exogenous criteria and then to use a 'good and simple' rule for the resulting strict preferences. This reinforces the market-based approach even in the presence of indifferences because always competitive allocations are chosen.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

Single-basined preferences generalize single-dipped preferences by allowing for multiple worst elements. These preferences have played an important role in areas such as voting, strategy-proofness and matching problems. We examine the notion of single-basinedness in a choice-theoretic setting. In conjunction with independence of irrelevant alternatives, single-basined choice implies a structure that conforms to the motivation underlying our definition. We also establish the consequenes of requiring single-basined choice correspondences to be upper semicontinuous, and of the revealed preference relation to be Suzumura consistent. Journal of Economic Literature.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategyproof if misreporting one’s preference never produces a social ordering that is strictly between the original ordering and one’s own preference. After describing a few examples of manipulable rules, we study in some detail three classes of strategy-proof rules: (i)rules based on a monotonic alteration of the majority relation generated by the preference profile; (ii)rules improving upon a fixed status-quo; and (iii) rules generalizing the Condorcet-Kemeny aggregation method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Rapport de recherche

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consistency of a binary relation requires any preference cycle to involve indifference only. As shown by Suzumura (1976b), consistency is necessary and sufficient for the existence of an ordering extension of a relation. Because of this important role of consistency, it is of interest to examine the rationalizability of choice functions by means of consistent relations. We describe the logical relationships between the different notions of rationalizability obtained if reflexivity or completeness are added to consistency, both for greatest-element rationalizability and for maximal-element rationalizability. All but one notion of consistent rationalizability are characterized for general domains, and all of them are characterized for domains that contain all two-element subsets of the universal set.