On the information about individual utilities used in social choice

This paper investigates the consequences of the requirement tha a social choice method should convey as much information as possible about the individuals' values. It is first shown that if interpersonal comparisons of utilities are excluded, then the only information about individual values that can be used in the context of social choice is ordinal information. It is then argued that Arrow's independence condition demands that only a part of the information about the individual preferences be used in the social choice. Finally, it is shown that the requirement of maximal information gives strong support to Smith's (1973) ‘separability’ condition. In combination with Smith's result this shows that the choice methods that convey the most information about individual preferences are the ‘generalized point systems’ (also called ‘scoring functions’ or ‘ranking systems’).     

Where do we stand on measures of uncertainty,ambiguity, fuzziness,and the like?

It is argued in this paper that the theory of fuzzy sets involves at least four fundamentally different types of uncertainty. Each of these types requires a measure by which the degree of uncertainty of that type can be determined.Two main categories of uncertainty are connected with the terms ‘vagueness’ (or ‘fuzziness’) and ‘ambiguity’. In general, vagueness is associated with the difficulty of making sharp or precise distinctions in the world. Ambiguity, on the other hand, is associated with one-to-many relations, i.e., situations with two or more alternatives that are left unspecified. While the concept of a fuzzy set represents a basic mathematical framework for dealing with vagueness, the concept of a fuzzy measure is a general framework for dealing with ambiguity.Several classes of measures of vagueness, usually referred to as measures of fuzziness, have been proposed in the literature. Each class is based on some underlying conception of the degree of fuzziness. A general set of requirements for measures of fuzziness is formulated, followed by an overview of the measures proposed in the literature.Measures of ambiguity are discussed within the framework of plausibility and belief measures. Although it does not cover all fuzzy measures, this framework is sufficiently broad for most practical purposes, and represents a generalization of both probability theory and possibility theory.It is argued that three complementary measures of ambiguity should be employed. One of them is obtained by generalizing the Hartley measure of uncertainty; it measures the degree of nonspecificity in individual situations described by the various belief and plausibility measures. The other two are obtained by generalizing the well known Shannon measure of uncertainty; they measure the degree of dissonance and the degree of confusion in evidence, respectively. Basic mathematical properties of these measures are overviewed.It is also argued that each of the four types of uncertainty measures, which are fundamentally different from each other, can be used for measuring structural (syntactic) information in the same sense as the Hartley and Shannon measures have been used in this respect. As such, these measures are potentially powerful tools for dealing with systems problems such as systems modelling, analysis, simplification, or design.     

An IO–Modification of Potential Method

In this paper we are performing some modification of Potential Method so that it can be recognized as an Input-Output method. This approach is tested on the ‘Japan City Banks’ example taken from Cooper and all. [Seiford L. M. Cooper, W. W. and K. Tone. Data Envelopment Analysis. Kluwer, 2002]. where authors are using Data Envelop Analysis technique. It is known that DEA is not capable to distinguish ‘efficient’ Decision Making Units among themselves. In our approach this is not the case — we obtain the ranking od all units in consideration.     

A proposal for a variation on the axioms of classical geometry

A set of axioms for classical absolute geometry is proposed that is accessible to students new to axioms. The metric axioms adopted are the ruler axiom, triangle inequality and the bisector axiom. Angle measure is derived from distance, and all properties needed to establish a consistent system are derived. In particular, the SAS congruence theorem is proved. The proofs are broken into many small steps suitable for the target audience. Some explorations with geometry drawing programmes are shown.     

Soft with a hard centre: discrete-event simulation in facilitation

Discrete event simulation is normally described as a ‘hard’ OR technique. This may not, however, always be the case. An example of a simulation of a user support helpline is described which, it is argued, has many of the traits of a ‘soft’ OR intervention. In particular, the study involved a facilitated discussion around a simulation model about possible improvements to a problem situation. The nature of the intervention is considered from both a methodological and paradigmatic perspective, and conclusions are drawn about where the intervention lies on a ‘hard’ to ‘soft’ continuum. It is argued that ‘soft’ issues need to be subsumed into the prescribed methodology for discrete-event simulation.     

An Old Solution to the Problem of Mixed Atomics

This paper examines a difficulty for various forms of truth pluralism, known in the literature as the problem of ‘mixed atomics’. It is argued that two prominent attempts to respond to the difficulty—those of Jeremy Wyatt and Gila Sher—fail. In their place, an alternative is offered based on parts of Crispin Wright’s Truth and Objectivity programme. It is argued that the Wrightian approach works because it substitutes traditional conceptions of truth-relevant properties, for example correspondence and coherence, for criteria of objectivity pertaining to discursive practices. This allows us to give expression to the nuanced way in which the pluralist wants to treat mixed atomics.     

Completeness theorems for continuous functions and product topologies

In this paper we formulate a first order theory of continuous functions on product topologies via generalized quantifiers. We present an axiom system for continuous functions on product topologies and prove a completeness theorem for them with respect to topological models. We also show that if a theory has a topological model which satisfies the Hausdorff separation axiom, then it has a 0-dimensional, normal topological model. We conclude by obtaining an axiomatization for topological algebraic structures, e.g. topological groups, proving a completeness theorem for the analogue with countable conjunctions and disjunctions, and presenting counterexamples to interpolation and definability.     

Finite axiomatizability of local set theory

The need for modifying axiomatic set theories was caused, in particular, by the development of category theory. The ZF and NBG axiomatic theories turned out to be unsuitable for defining the notion of a model of category theory. The point is that there are constructions such as the category of categories in naïve category theory, while constructions like the set of sets are strongly restricted in the ZF and NBG axiomatic theories. Thus, it was required, on the one hand, to restrict constructions similar to the category of categories and, on the other hand, adapt axiomatic set theory in order to give a definition of a category which survives restricted construction similar to the category of categories. This task was accomplished by promptly inventing the axiom of universality (AU) asserting that each set is an element of a universal set closed under all NBG constructions. Unfortunately, in the theories ZF + AU and NBG + AU, there are toomany universal sets (as many as the number of all ordinals), whereas to solve the problem stated above, a countable collection of universal sets would suffice. For this reason, in 2005, the first-named author introduced local-minimal set theory, which preserves the axiom AU of universality and has an at most countable collection of universal sets. This was achieved at the expense of rejecting the global replacement axiom and using the local replacement axiom for each universal class instead. Local-minimal set theory has 14 axioms and one axiom scheme (of comprehension). It is shown that this axiom scheme can be replaced by finitely many axioms that are special cases of the comprehension scheme. The proof follows Bernays’ scheme with significant modifications required by the presence of the restricted predicativity condition on the formula in the comprehension axiom scheme.     

Arithmetic returns for investment performance measurement

This paper introduces new money-weighted metrics for investment performance analysis, based on arithmetic means of holding period rates weighted by the investment’s market values. This approach generates rates of return which measure a fund’s or portfolio’s performance and a fund manager’s performance. It also enables to show that the Internal Rate of Return (IRR) is a weighted mean of holding period rates associated with interim values which differ from market values, so that value additivity is violated. The manager’s Arithmetic Internal Rate of Return (AIRR) is shown to be the true period equivalent of the cumulative Time Weighted Rate of Return (TWRR), whereas the period TWRR (a geometric return) provides a different ranking. The method is easily generalized for coping with varying benchmark rates. We also cope with the practical problem of estimating interim values whenever they are not available.     

Optimal approximations with Rough Sets and similarities in measure spaces

When arbitrary sets are approximated by more structured sets, it may not be possible to obtain an exact approximation that is equivalent to a given set. Presented here, is a new proposal for a ‘metric’ approach to Rough Sets. We assume some finite measure space is defined on a given universe, and then use it to define various similarity indexes. A set of axioms and the concept of consistency for similarity indexes are also proposed. The core of the paper is a definition of the ‘optimal’ or ‘best’ approximation with respect to any particular similarity index, and an algorithm to find this optimal approximation by using the Marczewski–Steinhaus Index. This algorithm is also shown to hold for a class of similarity indexes that are consistent with the Marczewski–Steinhaus Index.     

Continuity,completeness, betweenness and cone-monotonicity

A non-trivial, transitive and reflexive binary relation on the set of lotteries satisfying independence that also satisfies any two of the following three axioms satisfies the third: completeness, Archimedean and mixture continuity (Dubra, 2011). This paper generalizes Dubra’s result in two ways: First, by replacing independence with a weaker betweenness axiom. Second, by replacing independence with a weaker cone-monotonicity axiom. The latter is related to betweenness and, in the case in which outcomes correspond to real numbers, is implied by monotonicity with respect to first-order stochastic dominance.     

Axioms for a theory of semantic equivalence

Gödel-type semantic completeness theorems are established for a formal theory of semantic equivalence based on L.A. Zadeh's concept of a linguistic variable. The linguistics that is employed allows for the expression of propositions such as “it is not the case that ‘young’ is semantically equivalent with ‘not old’”, or, in symbols (young(x) ≅ ∼old(x)).The result is a two-leveled semantics which, at the lower level, is a multivalent interpretation of fuzzy assertions (e.g., ∼old(x)) in terms of fuzzy subsets of a given universe and, at the upper level, is a two-valued (classical) interpretation based on the fact that two closed fuzzy assertions either do or do not have the same truth value. The main proof is of the Henkin variety, employing adaptations of the algebraic methods found in Rasiowa [9] and Rasiowa and Sikorski [10].     

A characterization of fuzzy subgroups

An ordinary subgroup of a group G is (1) a subset of G, (2) closed under the group operation. In a fuzzy subgroup it is precisely these two notions that lose their deterministic character. A fuzzy subgroup μ of a group (G,·) associates with each group element a number, the larger the number the more certainly that element belongs to the fuzzy subgroup. The closure property is captured by the inequality μ(x · y)?T(μ(x), μ(y)). In A. Rosenfeld's original definition, T was the function ‘minimum’. However, any t-norm T provides a meaningful generalization of the closure property. Two classes of fuzzy subgroups are investigated. The fuzzy subgroups in one class are subgroup generated, those in the other are function generated. Each fuzzy subgroup in these classes satisfies the above inequality with T given by T(a, b) = max(a + b ?1, 0). While the two classes look different, each fuzzy subgroup in either is isomorphic to one in the other. It is shown that a fuzzy subgroup satisfies the above inequality with $\text{T =}\text{‘minimum’}$ if and only if it is subgroup generated of a very special type. Finally, these notions are applied to some abstract pattern recognition problems.     

The theorem of the means for cardinal and ordinal numbers

The theorem that the arithmetic mean is greater than or equal to the geometric mean is investigated for cardinal and ordinal numbers. It is shown that whereas the theorem of the means can be proved for n pairwise comparable cardinal numbers without the axiom of choice, the inequality a² + b² ≥ 2ab is equivalent to the axiom of choice. For ordinal numbers, the inequality α² + β² ≥ 2αβ is established and the conditions for equality are derived; stronger inequalities are obtained for finite and infinite sequences of ordinals under suitable monotonicity hypotheses. MSC: 03E10, 04A10, 03E25, 04A25.     

On evaluating the performance of GSS: Furthering the debate

Following criticism from proponents of workstation group support systems about the lack of validity of ‘wide-band’ group support systems (GSS), a recent article argued that it was inappropriate to attempt to establish the level of experimental validity for such GSS that is demanded by researchers working with 'narrow-band' GSS. It was argued that ‘wide-band’ and workstation GSS are very different and this means that it is unlikely that the same measures of success would be appropriate. This paper agrees with this view but not with its extension, that the overall validation requirement is different; theoretical validity is a necessary feature of a full evaluation but it is not sufficient by itself - experimental validity must also be sought. This paper argues against the view that since experimental validity cannot be obtained, theoretical validity will suffice. A twin-track research approach involving theoretical and experimental validity is proposed that can unite researchers investigating (almost) all forms of GSS, modelled on the PIMS programme and supported by one of the research frameworks that already exist.     

On the cardinality of n-Urysohn and n-Hausdorff spaces

Two variations of Arhangelskii’s inequality $\left| X \right| \leqslant 2^{\chi (X) - L(X)}$ for Hausdorff X [Arhangel’skii A.V., The power of bicompacta with first axiom of countability, Dokl. Akad. Nauk SSSR, 1969, 187, 967–970 (in Russian)] given in [Stavrova D.N., Separation pseudocharacter and the cardinality of topological spaces, Topology Proc., 2000, 25(Summer), 333–343] are extended to the classes with finite Urysohn number or finite Hausdorff number.     

Mathematics,Science of Possibility ‐‐ A Critical Review

This paper supports the view that search for the applicative standpoint in mathematical education has yet to be sufficiently exploited. Mathematical propositions are considered to have both an ‘internal’ and ‘external’ role and thus a system of ‘potential models’ is evolved. Despite the stress on the applicative nature of the subject it is argued in conclusion that the position in the body of the paper is compatible with the synthetic apriority of mathematics.

     

Characterization of Carleson measures by the Hausdorff-Young property

It is shown that the Laplace transform of an L ^p (1 < p ≤ 2) function defined on the positive semiaxis satisfies the Hausdorff-Young type inequality with a positive weight in the right complex half-plane if and only if the weight is a Carleson measure. In addition, Carleson’s weighted L ^p inequality for the harmonic extension is given with a numeric constant.     

Using dynamic programming to determine an optimal strategy in a contract bridge tournament

One form of contract bridge tournament comprises several rounds of matches in which players compete as pairs for ‘masterpoints’ awarded for each match won or drawn and for being highly placed at the end of the tournament. In the second and subsequent rounds, pairs are matched against other pairs that have been approximately equally successful so far. There has been vague discussion among bridge players of the possible advantages of ‘throwing’, that is, deliberately losing a match in round r so as to obtain a lower ranking and face an easier opponent in round r+1. This paper uses dynamic programming and data from one tournament to identify an optimal strategy (either ‘throw’ or ‘play to win’). The optimal strategy is a function of a pair's ability, its placing after each round, the relative rewards for winning a match and finishing high, the opponent's skill, and the round. For example, we find that a very weak pair should ‘throw’ and ‘play to win’ in alternate rounds.