We show that the P−Glivenko property of classes of functions F1, . . . ,Fk is preserved by a continuous function φ from R to R in the sense that the new class of functions x → φ(f1(x), . . . , fk(x)), fi ∈ Fi, i = 1, . . . , k is again a Glivenko-Cantelli class of functions if it has an integrable envelope. We also prove an analogous result for preservation of the uniform Glivenko-Cantelli prop...

In group decision making situations, there may be cases in which experts do not have an in-depth knowledge of the problem to be solved and, as a result, they may present incomplete information. In this paper, we present a new selection process to deal with incomplete fuzzy linguistic information. As part of it, we use an iterative procedure to estimate the missing information. This procedure is...

This paper examines the problem of testing consistency of sets of topological relations which are instances of the RCC-8 relation set (Randell, Cui and Cohn 1992). Representations of these relations as constraints within a number of logical frameworks are considered. It is shown that, if the arguments of the relations are interpreted as non-empty open sets within an arbitrary topological space,...

For classical marriage markets with equal numbers of men and women and where all men find all women acceptable and all women find all men acceptable, Sasaki and Toda (1992) characterized the core by same-side anonymity for marriage markets, Pareto optimality, consistency, and converse consistency. Nizamogullari and Özkal-Sanver (2014) generalized this result to the domain of classical marriage ...

Display-camera communication has become a promising direction in both computer vision and wireless communication communities. However, the consistency of the channel measurement is an open issue since precise calibration of the experimental setting has not been fully studied in the literatures. This paper focuses on establishing a scheme for precise calibration of the display-camera channel per...

We explore the implications of consistency in sequencing problems. We first identify all rules satisfying Pareto indifference, individual rationality, and consistency. Next, we ask whether there is a rule satisfying the three axioms together with either one of two additional own-time monotonicity requirements: an agent should lose (or gain) as a result of changes in his service time. As it turn...

We extend arc consistency algorithms proposed in the literature in order to deal with not necessarily invertible semirings. As a result, consistency algorithms can now be used as a preprocessing procedure in soft CSPs defined over a larger class of semirings: either partially ordered, or with non idempotent ×, or not closed ÷ operator, or constructed as cartesian product or Hoare power sets of ...

In multi-criteria decision problems the relative importance of alternatives is computed from preference matrices, which come from experience and can possibly be inconsistent. Two consistency types of preferences are studied in the paper. The ordinal consistency preserves the order in which the alternatives are arranged, and it does not allow cycles. The term ‘cyclic consistency’ is also used fo...

Techniques such as replication and caching of objects that implement distributed services lead to consistency problems that must be addressed. We explore new consistency protocols based on the notion of object value lifetimes. By keeping track of the lifetimes of the values stored in shared objects (i.e., the time interval that goes from the writing of a value until the latest time when this va...

We study the “airport problem”, which is concerned with sharing the cost of an airstrip among agents who need airstrips of different lengths. We address whether different formulations of consistency and converse consistency axioms provide strategic justifications for different rules. We propose Right-endpoint Subtraction (RS) bilateral consistency and RS converse consistency in the airport prob...