Extreme Copulas and the Comparison of Ordered Lists

Theory and Decision 62 (3):195-217 (2007)
  Copy   BIBTEX

Abstract

We introduce two extreme methods to pairwisely compare ordered lists of the same length, viz. the comonotonic and the countermonotonic comparison method, and show that these methods are, respectively, related to the copula T M (the minimum operator) and the Ł ukasiewicz copula T L used to join marginal cumulative distribution functions into bivariate cumulative distribution functions. Given a collection of ordered lists of the same length, we generate by means of T M and T L two probabilistic relations Q M and Q L and identify their type of transitivity. Finally, it is shown that any probabilistic relation with rational elements on a 3-dimensional space of alternatives which possesses one of these types of transitivity, can be generated by three ordered lists and at least one of the two extreme comparison methods

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Semi-Bounded Relations in Ordered Modules.Oleg Belegradek - 2004 - Journal of Symbolic Logic 69 (2):499 - 517.
A weaker condition for transitivity in probabilistic support.William A. Roche - 2012 - European Journal for Philosophy of Science 2 (1):111-118.
Soft ordered semigroups.Young Bae Jun, Kyoung Ja Lee & Asghar Khan - 2010 - Mathematical Logic Quarterly 56 (1):42-50.
Ordered sets R and Q as bases of Kripke models.Mitio Takano - 1987 - Studia Logica 46 (2):137 - 148.

Analytics

Added to PP
2013-12-01

Downloads
69 (#237,875)

6 months
12 (#219,036)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Triangular Norms.Erich Peter Klement, Radko Mesiar & Endre Pap - 2000 - Dordrecht, Netherland: Springer.

Add more references