Clustering U.S. 2016 presidential candidates through linguistic appraisals

Producción CientíficaThe main purpose of this paper is to cluster the United States (U.S.) 2016 presidential candidates taking the linguistic appraisals made by a random representative sample of adults living in the U.S. as our starting point. To do this, we have used the concept of ordinal proximity measure (see García-Lapresta and Pérez-Román), which allows to determine the degree of consensus in a group of agents when a set of alternatives is evaluated through non-necessarily qualitative scales.Ministerio de Economía, Industria y Competitividad (project ECO2016-77900-P

No stratification without representation

Sortition is an alternative approach to democracy, in which representatives are not elected but randomly selected from the population. Most electoral democracies fail to accurately represent even a handful of protected groups. By contrast, sortition guarantees that every subset of the population will in expectation fill their fair share of the available positions. This fairness property remains satisfied when the sample is stratified based on known features. Moreover, stratification can greatly reduce the variance in the number of positions filled by any unknown group, as long as this group correlates with the strata. Our main result is that stratification cannot increase this variance by more than a negligible factor, even in the presence of indivisibilities and rounding. When the unknown group is unevenly spread across strata, we give a guarantee on the reduction in variance with respect to uniform sampling. We also contextualize stratification and uniform sampling in the space of fair sampling algorithms. Finally, we apply our insights to an empirical case study.Accepted manuscrip

A continuous rating method for preferential voting. The complete case

A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair of options. The proposed method is proved to have certain desirable properties, which include: the continuity of the rates with respect to the data, a decomposition property that characterizes certain situations opposite to a tie, the Condorcet-Smith principle, and a property of clone consistency. One can view this rating method as a complement for the ranking method introduced in 1997 by Markus Schulze. It is also related to certain methods of one-dimensional scaling or cluster analysis.Comment: This is part one of a revised version of arxiv:0810.2263. Version 3 is the result of certain modifications, both in the statement of the problem and in the concluding remarks, that enhance the results of the paper; the results themselves remain unchange

Polytopality and Cartesian products of graphs

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we show that products of simple polytopes are the only simple polytopes whose graph is a product. On the other hand, we provide a general method to construct (non-simple) polytopal products whose factors are not polytopal.Comment: 21 pages, 10 figure

An ordinal multi-criteria decision-making procedure in the context of uniform qualitative scales

Producción CientíficaIn this contribution, we propose a multi-criteria decision-making procedure that has been devised in a purely ordinal way. Agents evaluate the alternatives regarding several criteria by assigning one or two consecutive terms of a uniform ordered qualitative scale to each alternative in each criterion. Weights assigned to criteria are managed through replications of the corresponding ratings, and alternatives are ranked according to the medians of their ratings after the replications

On vertex adjacencies in the polytope of pyramidal tours with step-backs

We consider the traveling salesperson problem in a directed graph. The pyramidal tours with step-backs are a special class of Hamiltonian cycles for which the traveling salesperson problem is solved by dynamic programming in polynomial time. The polytope of pyramidal tours with step-backs $PSB (n)$ is defined as the convex hull of the characteristic vectors of all possible pyramidal tours with step-backs in a complete directed graph. The skeleton of $PSB (n)$ is the graph whose vertex set is the vertex set of $PSB (n)$ and the edge set is the set of geometric edges or one-dimensional faces of $PSB (n)$. The main result of the paper is a necessary and sufficient condition for vertex adjacencies in the skeleton of the polytope $PSB (n)$ that can be verified in polynomial time.Comment: in Englis

New and simple algorithms for stable flow problems

Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in which vertices express their preferences over their incident edges. A network flow is stable if there is no group of vertices that all could benefit from rerouting the flow along a walk. Fleiner established that a stable flow always exists by reducing it to the stable allocation problem. We present an augmenting-path algorithm for computing a stable flow, the first algorithm that achieves polynomial running time for this problem without using stable allocation as a black-box subroutine. We further consider the problem of finding a stable flow such that the flow value on every edge is within a given interval. For this problem, we present an elegant graph transformation and based on this, we devise a simple and fast algorithm, which also can be used to find a solution to the stable marriage problem with forced and forbidden edges. Finally, we study the stable multicommodity flow model introduced by Kir\'{a}ly and Pap. The original model is highly involved and allows for commodity-dependent preference lists at the vertices and commodity-specific edge capacities. We present several graph-based reductions that show equivalence to a significantly simpler model. We further show that it is NP-complete to decide whether an integral solution exists

Weakly-nonlocal Symplectic Structures, Whitham method, and weakly-nonlocal Symplectic Structures of Hydrodynamic Type

We consider the special type of the field-theoretical Symplectic structures called weakly nonlocal. The structures of this type are in particular very common for the integrable systems like KdV or NLS. We introduce here the special class of the weakly nonlocal Symplectic structures which we call the weakly nonlocal Symplectic structures of Hydrodynamic Type. We investigate then the connection of such structures with the Whitham averaging method and propose the procedure of "averaging" of the weakly nonlocal Symplectic structures. The averaging procedure gives the weakly nonlocal Symplectic Structure of Hydrodynamic Type for the corresponding Whitham system. The procedure gives also the "action variables" corresponding to the wave numbers of $m$-phase solutions of initial system which give the additional conservation laws for the Whitham system.Comment: 64 pages, Late

An update on the Hirsch conjecture

The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most fundamental, basic and old problems in polytope theory, what we know is quite scarce. Most notably, no polynomial upper bound is known for the diameters that are conjectured to be linear. In contrast, very few polytopes are known where the bound $n-d$ is attained. This paper collects known results and remarks both on the positive and on the negative side of the conjecture. Some proofs are included, but only those that we hope are accessible to a general mathematical audience without introducing too many technicalities.Comment: 28 pages, 6 figures. Many proofs have been taken out from version 2 and put into the appendix arXiv:0912.423