Alfio Giarlotta

  • Citations Per Year
Learn More
Passive and Active Compensability Multicriteria ANalysis (PACMAN) is a multiple criteria methodology based on a decision maker oriented notion of compensation, called compensability. An important feature of PACMAN is a possible asymmetry of the connected decision procedure, since compensability is determined for each ordered pair of criteria, distinguishing(More)
Given a finite configuration of points in a metric space, a Steiner center (respectively, a centroid) is the point of the space (respectively, of the configuration) that minimizes the sum of the distances from all its elements. Working on the k-dimensional real space endowed with the Manhattan distance, we study the approximate algorithm that takes a point(More)
A linear ordering is said to be representable if it can be order-embedded into the reals. Representable linear orderings have been characterized as those which are separable in the order topology and have at most countably many jumps. We use this characterization to study the representability of a lexicographic product of linear orderings. First we count(More)
A linear ordering (X,≺) is a Debreu chain (or has the Debreu property) if each subordering (Y,≺) of X can be embedded into X with an injective function that is both order-preserving and continuous with respect to the order topology on X and Y . The most typical example of a Debreu chain is the linearly ordered topological space (R, <, τ<) of real numbers(More)
Given a setU of alternatives, a choice (correspondence) onU is a contractive map c defined on a family Ω of nonempty subsets ofU . Semantically, a choice c associates to each menu A ∈ Ω a nonempty subset c(A) ⊆ A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty(More)
We study measure-preserving functions between Lebesgue measurable subsets of the real line. We use particular bijections of the interval [0, 1), called shifts, to approximate from below the set of measure-preserving maps on [0, 1). This construction is similar to the method used in ergodic theory to obtain special transformations by cutting and stacking. In(More)