Related papers: Intergenerational Preferences and Continuity: Reco…
We say a model is continuous in utilities (resp., preferences) if small perturbations of utility functions (resp., preferences) generate small changes in the model's outputs. While similar, these two questions are different. They are only…
Preference cycles are prevalent in problems of decision-making, and are contradictory when preferences are assumed to be transitive. This contradiction underlies Condorcet's Paradox, a pioneering result of Social Choice Theory, wherein…
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…
We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…
Preference orderings are orderings of a set of items according to the preferences (of judges). Such orderings arise in a variety of domains, including group decision making, consumer marketing, voting and machine learning. Measuring the…
We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…
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 consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We propose a class of semimetrics for preference relations any one of which is an alternative to the classical Kemeny-Snell-Bogart metric. (We take a fairly general viewpoint about what constitutes a preference relation, allowing for any…
We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show…
In the present paper we study necessary and sufficient conditions for the existence of a semicontinuous and finite Richter-Peleg multi-utility for a preorder. It is well know that, given a preorder on a topological space, if there is a…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
In 1987, I. Labuda proved a general representation theorem that, as a special case, shows that the topology of local convergence in measure is the minimal topology on Orlicz spaces and $L_{\infty}$. Minimal topologies connect with the…
We establish that every second countable completely regularly preordered space (E,T,\leq) is quasi-pseudo-metrizable, in the sense that there is a quasi-pseudo-metric p on E for which the pseudo-metric p\veep^-1 induces T and the graph of…
Models of conformity and anti-conformity have typically focused on cultural traits with nominal (unordered) variants, such as baby names, strategies (cooperate/defect), or the presence/absence of an innovation. There have been fewer studies…
A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…
In this paper, we construct and compare algorithmic approaches to solve the Preference Consistency Problem for preference statements based on hierarchical models. Instances of this problem contain a set of preference statements that are…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
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…