Related papers: Single-crossing dominance: A preference lattice
In multi-criteria graph traversal, paths are compared via Pareto dominance, an ordering that identifies which paths are non-dominated, but says nothing about which path to expand next or when the search may stop. As a result, existing…
This paper introduces statistical order convergence and its pointwise variant for sequences of order bounded operators between Riesz spaces. We establish fundamental properties: uniqueness of the limit, stability under lattice operations,…
Actual individual preferences are neither complete (=total) nor antisymmetric in general, so that at least every quasi-order must be an admissible input to a satisfactory choice rule. It is argued that the traditional notion of…
We show that one-dimensional Euclidean preference profiles can not be characterized in terms of finitely many forbidden substructures. This result is in strong contrast to the case of single-peaked and single-crossing preference profiles,…
Convex combinations of i.i.d. random variables without a finite mean can behave in a strikingly different way from the finite-mean case: as the weight vector becomes more balanced, the resulting combination may become stochastically larger,…
We show that many bounded rationality patterns of choice can be alternatively represented as testable models of limited consideration, and we elicit the features of the associated unobserved consideration sets from the observed choice.…
The purpose of this paper is twofold. We explore higher property T as an abstract group-theoretic property. In particular, we provide new operator-algebraic characterizations of higher property T. Then we turn to lattices in semisimple Lie…
Level-1 Consensus is a property of a preference-profile. Intuitively, it means that there exists a preference relation which induces an ordering of all other preferences such that frequent preferences are those that are more similar to it.…
We propose a new approach to represent nonparametrically the linear dependence structure of a spatio-temporal process in terms of latent common factors. Though it is formally similar to the existing reduced rank approximation methods…
This paper explores a new class of incomplete preferences -- termed ``connected preferences'' -- in which maximal domains of comparability are topologically connected. We provide necessary and sufficient conditions for continuous…
In this paper, we study a famous discrete dynamical system, the Chip Firing Game, used as a model in physics, economics and computer science. We use order theory and show that the set of reachable states (i.e. the configuration space) of…
A review of investigations of running couplings using lattice techniques is given. This includes i) studies of the running of particular non-perturbatively defined renormalized couplings in pure gauge theories over a range of energies, and…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scoring procedures we examine whether or not they satisfy the…
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…
We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.
The classical Stable Roommates problem is to decide whether there exists a matching of an even number of agents such that no two agents which are not matched to each other would prefer to be with each other rather than with their…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
We give a sharp upper bound on the multiplicity of a fake weighted projective space with at worst canonical singularities. This is equivalent to giving a sharp upper bound on the index of the sublattice generated by the vertices of a…
In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is…