相关论文: What majority decisions are possible

Given a set of conflicting arguments, there can exist multiple plausible opinions about which arguments should be accepted, rejected, or deemed undecided. We study the problem of how multiple such judgments can be aggregated. We define the…

The multiple extension problem arises frequently in diagnostic and default inference. That is, we can often use any of a number of sets of defaults or possible hypotheses to explain observations or make Predictions. In default inference,…

In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…

In this article we prove that equation $\phi(x)=n$, for a fixed $n$, admits a finite number of solutions, we find the general form of these solutions, and we show that: if $x_0$ is a unique solution of this equation then $x_0$ is a product…

We study a model of a population making a binary decision based on information spreading within the population, which is fully connected or covering a square grid. We assume that a fraction of the population wants to make the choice of the…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules.

In the paper we study choice functions on posets satisfying the conditions of heredity and outcast. For every well-ordered sequence of elements of poset, we define the corresponding `elementary' choice function. Every such a choice function…

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\mathcal{O}(K^2)$-algorithm that finds the $K$ smallest/largest of these sums by evading the…

A majority digraph is a finite simple digraph $G=(V,\to)$ such that there exist finite sets $A_v$ for the vertices $v\in V$ with the following property: $u\to v$ if and only if "more than half of the $A_u$ are $A_v$". That is, $u\to v$ if…

Sample size criteria are often expressed in terms of the concentration of the posterior density, as controlled by some sort of error bound. Since this is done pre-experimentally, one can regard the posterior density as a function of the…

We present an optimization problem in infinite dimensions which satisfies the usual second-order sufficient condition but for which perturbed problems fail to possess solutions.

Let $m$ be a positive integer and let $\Omega$ be a finite set. The $m$-closure of $G\leq\operatorname{Sym}(\Omega)$ is the largest permutation group on $\Omega$ having the same orbits as $G$ in its induced action on the Cartesian product…

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

We generalize Condorcet's jury theorem (CJT) to socially connected populations in which agents revise discrete choices on a network in the presence of zealots. Free agents receive privately informative signals about the correct alternative…

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. We present an axiomatic approach for the universal ranking problem with arbitrary preference intensities, incomplete and…

We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…

Let $(X, d)$ be a semimetric space. A permutation $\Phi$ of the set $X$ is a combinatorial self similarity of $(X, d)$ if there is a bijective function $f \colon d(X^2) \to d(X^2)$ such that $$ d(x, y) = f(d(\Phi(x), \Phi(y))) $$ for all…