Probabilistic normed PN spaces are real linear spaces in which the norm of each vector is an appropriate probability distribution function ลather than a number. Such spaces were first introduced by A. N. Serstnev w x in 1963 3 . w x In a recent paper 1 , we gave a new definition of PN spaces that วn
Continuity properties of preference relations
โ Scribed by Marian A. Baroni; Douglas S. Bridges
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 104 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
Various types of continuity for preference relations on a metric space are examined constructively. In particular, necessary and sufficient conditions are given for an orderโdense, strongly extensional preference relation on a complete metric space to be continuous. It is also shown, in the spirit of constructive reverse mathematics, that the continuity of sequentially continuous, orderโdense preference relations on complete, separable metric spaces is connected to Ishihara's principleBDโโ, and therefore is not provable within Bishopโstyle constructive mathematics alone. (ยฉ 2008 WILEYโVCH Verlag GmbH & Co. KGaA, Weinheim)
๐ SIMILAR VOLUMES
La nozione euleriana di funzione presenta un duplice aspetto: essa era, a un tempo, relazione funzionale tra quantitร e formula composta da simboli operazionali, da costanti, e da variabili. Queste ultime erano concepite come universali e pertanto godenti di particolari proprietร . Anche se il calcol
Preference relations as simple and efficient information description tools have been widely used in practical decision-making problems. Intuitionistic preference relation, which is often met in real problems, is usually utilized to provide the experts' vague or fuzzy opinions over objects under unce
The focus of this article is on the analysis of preferences in situations of individual and group decision making. We make use of a fuzzy relational analysis technique to construct and explore new relations that provide additional information on the decision maker's strict preference relations. We s
This paper is devoted to the study of techniques allowing one to rank order the elements of a finite set on the basis of a non-necessarily complete or transitive binary relation. In the area of MCDM, such a problem occurs with outranking methods. We review a number of theoretical results concerning