Related papers: Probabilistic Fixed Ballot Rules and Hybrid Domain…
In this paper, I present a completely new type of upper and lower bounds on the right-tail probabilities of continuous random variables with unbounded support and with semi-bounded support from the left. The presented upper and lower…
We study the classical Election problem in anonymous net- works, where solutions can rely on the use of random bits, which may be either shared or unshared among nodes. We provide a complete char- acterization of the conditions under which…
We analyse two coupled ODE models of political competition on invariant probability simplices with a conserved electorate. The baseline three-group model tracks left-radical, centrist, and right-radical voter shares. We characterise the…
This paper is concerned with the homogenization of Dirichlet problem of elliptic systems in a bounded, smooth domain of finite type. Both the coefficients of the elliptic operator and the Dirichlet boundary data are assumed to be periodic…
We provide a general framework to study stochastic sequences related to individual learning in economics, learning automata in computer sciences, social learning in marketing, and other applications. More precisely, we study the asymptotic…
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion…
In this article we continue the study of properties of squeezing functions and geometry of bounded domains. The limit of squeezing functions of a sequence of bounded domains is studied. We give comparisons of intrinsic positive forms and…
A regular language $L$ is said to be prime, if it is not the product of two non-trivial languages. Martens et al. settled the exact complexity of deciding primality for deterministic finite automata in 2010. For finite languages, Mateescu…
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of unknown complexity that were introduced by…
The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…
It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset…
In the problem of allocating a single non-disposable commodity among agents whose preferences are single-peaked, we study a weakening of strategy-proofness called not obvious manipulability (NOM). If agents are cognitively limited, then NOM…
Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of…
We develop a non-negative polynomial minimum-norm likelihood ratio (PLR) of two distributions of which only moments are known. The sample PLR converges to the unknown population PLR under mild conditions. The methodology allows for…
May's classical theorem states that in a single-winner choose-one voting system with just two candidates, majority rule is the only social choice function satisfying anonimity, neutrality and positive responsiveness axiom. Anonimity and…
This paper introduces new parameterizations of equilibrium neural networks, i.e. networks defined by implicit equations. This model class includes standard multilayer and residual networks as special cases. The new parameterization admits a…
In this paper, we introduce and develop the concept of conditional quantization for Borel probability measures on $\mathbb{R}^k,$ considering both constrained and unconstrained frameworks. For each setting, we define the associated…
We introduce the notion of domains with uniform squeezing property, study various analytic and geometric properties of such domains and show that they cover many interesting examples, including Teichmuller spaces and Hermitian symmetric…
In the k-Kemeny problem, we are given an ordinal election, i.e., a collection of votes ranking the candidates from best to worst, and we seek the smallest number of swaps of adjacent candidates that ensure that the election has at most k…
This paper studies human preference learning based on partially revealed choice behavior and formulates the problem as a generalized Bradley-Terry-Luce (BTL) ranking model that accounts for heterogeneous preferences. Specifically, we assume…