Transitive closure, proximity and intransitivities

Nick Baigent and Christian Klamler

Economic Theory, 2003, vol. 23, issue 1, 175-181

Abstract: Assignments of weak orders to complete binary relations are considered. Firstly, it is shown that assigning the transitive closure of a complete binary relation does not always assign the closest weak order according to any reasonable metric on complete binary relations. It is then shown that the assignment of a weak order to a complete binary relation assigns its transitive closure if and only if it assigns the closest weak order according to a particular distance function that is not a metric. This permits more direct comparisons between the Transitive Closure Rule and other rules such as the Slater Rule. Copyright Springer-Verlag Berlin/Heidelberg 2003

Keywords: Distance functions; Transitive closure; Voting paradox. (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00199-003-0362-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joecth:v:23:y:2003:i:1:p:175-181

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2

DOI: 10.1007/s00199-003-0362-7

Access Statistics for this article

Economic Theory is currently edited by Nichoals Yanneils

More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().