ScholarLens Back to search
2005•EconomicaOpen access

Consistent Rationalizability

Walter Bossert, Yves Sprumont, Kotaro Suzumura

Open full text 39 citations

Abstract

Consistency of a binary relation requires any preference cycle to involve indifference only. It has been shown that consistency is necessary and sufficient for the existence of an ordering extension of a binary relation. It is therefore 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. All but one such notion are characterized for general domains, and all are characterized for domains that contain all two‐element subsets of the universal set.

Open-access reader

About this research paper

What this paper is about

Consistency of a binary relation requires any preference cycle to involve indifference only. It has been shown that consistency is necessary and sufficient for the existence of an ordering extension of a binary relation. It is therefore 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. All but one such notion are characterized for general domains, and all are characterized for domains that contain all two‐element subsets of the universal set.

Why it matters

OpenAlex reports 39 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Consistency of a binary relation requires any preference cycle to involve indifference only. It has been shown that consistency is necessary and sufficient for the existence of an ordering extension of a binary relation. It is therefore 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. All but one such notion are characterized for general domains, and all are characterized for domains that contain all two‐element subsets of the universal set.

Key concepts: Rationalizability, Binary relation, Mathematics, Consistency (knowledge bases), Extension (predicate logic), Completeness (order theory), Preference relation, Element (criminal law)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Consistent Rationalizability — Research Paper | ScholarLens