Related papers: The Complexity of Subelection Isomorphism Problems
We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…
Extensions of nuclear supersymmetry are discussed, together with a proposal for new, more stringent and precise tests that probe the susy classification and specific two-particle correlations among supersymmetric partners. The combination…
Nuclear supersymmetry is reviewed and some of its applications and extensions are discussed, together with a proposal for new, more stringent and precise tests to probe the supersymmetry classification, in particular, correlations between…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We study the k-median and k-center problems in probabilistic graphs. We analyze the hardness of these problems, and propose several algorithms with improved approximation ratios compared with the existing proposals.
We consider the problem of protecting and manipulating elections by recounting and changing ballots, respectively. Our setting involves a plurality-based election held across multiple districts, and the problem formulations are based on the…
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit…
Submodular optimization generalizes many classic problems in combinatorial optimization and has recently found a wide range of applications in machine learning (e.g., feature engineering and active learning). For many large-scale…
We give an introduction to the study of algebraic hypersurfaces, focusing on the problem of when two hypersurfaces are isomorphic or close to being isomorphic. Working with hypersurfaces and emphasizing examples makes it possible to discuss…
We analyze how numerical experiments regarding elections were conducted within the computational social choice literature (focusing on papers published in the IJCAI, AAAI, and AAMAS conferences). We analyze the sizes of the studied…
This paper gives an overview on and summarizes existing complexity and algorithmic results of some variants of the Stable Marriage and the Stable Roommates problems. The last section defines a list of stable matching problems mentioned in…
The class of the hypercomplex pseudo-Hermitian manifolds is considered. The flatness of the considered manifolds with the 3 parallel complex structures is proved. Conformal transformations of the metrics are introduced. The conformal…
New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…
In this work, we Extend Pawlak approximation spaces by topological spaces. Also, Rough Membership, equality and inclusion relations are extended using topological near open sets. In addition, new extended measures of accuracy and quality of…
Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…
In this master's thesis, we introduce expansion systems as a general framework to describe a large variety of approximation algorithms, such as Taylor approximation, decimal expansion and continued fraction. We consider some basic…
Sub-sampling is a common and often effective method to deal with the computational challenges of large datasets. However, for most statistical models, there is no well-motivated approach for drawing a non-uniform subsample. We show that the…
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…
We present a generalization of the maximal inequalities that upper bound the expectation of the maximum of $n$ jointly distributed random variables. We control the expectation of a randomly selected random variable from $n$ jointly…
Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomorphism problem with running time O(n^2.373) for any pair of…