Related papers: What majority decisions are possible
The main purpose of this work is to provide the general solutions of a class of linear functional equations. Let $n\geq 2$ be an arbitrarily fixed integer, let further $X$ and $Y$ be linear spaces over the field $\mathbb{K}$ and let…
We consider the problem of characterizing solutions in $(x, y)$ to the equation ${x \choose y}={{x-a} \choose {y+b}}$ in terms of $a$ and $b$. We obtain one simple result which allows the determination of a ratio in terms of $a$ and $b$…
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given.…
The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…
The article considers one of the possible generalizations of constraint satisfaction problems where relations are replaced by multivalued membership functions. In this case operations of disjunction and conjunction are replaced by maximum…
Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…
We introduce the quasiminimal subshifts, subshifts having only finitely many subsystems. With $\mathbb{N}$-actions, their theory essentially reduces to the theory of minimal systems, but with $\mathbb{Z}$-actions, the class is much larger.…
We study a model of voting with two alternatives in a symmetric environment. We characterize the interim allocation probabilities that can be implemented by a symmetric voting rule. We show that every such interim allocation probabilities…
We study conditions for the existence of stable and group-strategy-proof mechanisms in a many-to-one matching model with contracts if students' preferences are monotone in contract terms. We show that "equivalence", properly defined, to a…
We investigate the class of bisymmetric and quasitrivial binary operations on a given set $X$ and provide various characterizations of this class as well as the subclass of bisymmetric, quasitrivial, and order-preserving binary operations.…
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the…
Under a mild condition we give closed-form expressions for copulas of systems that consist of maxima and of minima of subvectors of a given random vector $X$ with continuous marginals. Said expressions appear explicit in the copula of $X$…
It is consistent that for every function f:R x R-> R there is an uncountable set A subseteq R and two continuous functions f_0,f_1:D(A)-> R such that f(alpha, beta) in {f_0(alpha, beta),f_1(alpha, beta)} for every (alpha, beta) in A^2,…
We prove the Existential Closedness conjecture for the differential equation of the $j$-function and its derivatives. It states that in a differentially closed field certain equations involving the differential equation of the $j$-function…
A permutation sequence is said to be convergent if the density of occurrences of every fixed permutation in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue…
Many results have been established that show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper is to show several results about solvability concerning the…
We show how the necessary and sufficient conditions for the NFL to apply can be reduced to the single requirement of the set of objective functions under consideration being closed under permutation, and quantify the extent to which a set…
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…