Related papers: A class of dissimilarity semimetrics for preferenc…
We construct a two-class asymmetric interacting particle system with $U_q(so_6)$ or $U_q(so_8)$ symmetry, in which up to two particles may occupy a site if the two particles have different class. The particles exhibit a drift, but there is…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric. We assume that these costs are unknown to…
The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…
We establish an equivalence between two seemingly different theories: one is the traditional axiomatisation of incomplete preferences on horse lotteries based on the mixture independence axiom; the other is the theory of desirable gambles…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on…
We consider general non-Euclidean distance measures between real world objects that need to be classified. It is assumed that objects are represented by distances to other objects only. Conditions for zero-error dissimilarity based…
This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…
This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…
We propose a theoretical framework under which preference profiles can be meaningfully compared. Specifically, given a finite set of feasible allocations and a preference profile, we first define a ranking vector of an allocation as the…
Reviewing the semiclassical theory for the parametric level density fluctuations, we show that for large parametric changes the density correlation function, after rescaling, becomes universal and coincides with the leading asymptotic term…
This paper investigates simultaneous preference and metric learning from a crowd of respondents. A set of items represented by $d$-dimensional feature vectors and paired comparisons of the form ``item $i$ is preferable to item $j$'' made by…
Diversities are an extension of the concept of a metric space which assign a non-negative value to every finite set of points, rather than just pairs. A general theory of diversities has been developed which exhibits many deep analogies to…
Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…
We consider an extension of the setting of label ranking, in which the learner is allowed to make predictions in the form of partial instead of total orders. Predictions of that kind are interpreted as a partial abstention: If the learner…
This paper is concerned with learning decision makers' preferences using data on observed choices from a finite set of risky alternatives. We propose a discrete choice model with unobserved heterogeneity in consideration sets and in…
This paper presents methods to compare high order networks, defined as weighted complete hypergraphs collecting relationship functions between elements of tuples. They can be considered as generalizations of conventional networks where only…
We formulate an alternative approach to describing Ehresmann semigroups by means of left and right \'etale actions of a meet semilattice on a category. We also characterize the Ehresmann semigroups that arise as the set of all subsets of a…
There is a growing need for discrete choice models that account for the complex nature of human choices, escaping traditional behavioral assumptions such as the transitivity of pairwise preferences. Recently, several parametric models of…