相关论文: What majority decisions are possible

We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a…

We consider families F of sequences converging to +infinity that F satisfies the following condition (C): (C): if an open set U in the real line is unbounded above then there exists a sequence belonging to F, which has an infinite number of…

We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations. The method we use is based on an article of Brignall,…

To identify statistically significant conclusions, it is proposed to simultaneously test hypotheses and alternatives. It is shown that, under the condition of free combination of hypotheses and alternatives, the closure method leads to…

Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any…

We show that there is an effectively closed maximal eventually different family of functions in spaces of the form $\prod_n F(n)$ for $F\colon \mathbb{N} \to \mathbb{N}\cup\{\mathbb{N}\}$ and give an exact criterion for when there exists an…

We consider different choice procedures such as scoring rules, rules, using majority relation, value function and tournament matrix, which are used in social and multi-criteria choice problems. We focus on the study of the properties that…

We ask for a given system of polynomials f_1,...,f_n and f over the complex numbers when there exist continuous functions q_1,...,q_n such that q_1 f_1+...+q_n f_n = f. This condition defines the continuous closure of an ideal. We give…

Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they do not support function spaces, i.e. if X and Y are…

Let C be a non-empty finite set, and Gamma a subgroup of the symmetric group S(C). Given a bijection f:A cross C to B cross C, the problem of Gamma-equivariant division is to find a quotient bijection h:A to B respecting whatever symmetries…

We formulate the Hauptvermutung of Causal Set Theory in two mathematically well-defined but different ways one of which turns out to be wrong and the other one turns out to be true. A further result is that the Hauptvermutung is true if we…

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

We all have preferences when multiple choices are available. If we insist on satisfying our preferences only, we may suffer a loss due to conflicts with other people's identical selections. Such a case applies when the choice cannot be…

We show that for large classes of entire functions the Julia set and the escaping set have packing dimension two. For example, this is the case for entire functions which are bounded on a curve tending to infinity. More generally, we show…

The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…

We design two mechanisms that ensure that the majority preferred option wins in all equilibria. The first one is a simultaneous game where agents choose other agents to cooperate with on top of the vote for an alternative, thus overcoming…

Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…