Related papers: Connected Incomplete Preferences
We study a public decision problem in which a finite society selects a public-good level from a closed interval. Agents either have single-peaked preferences or are completely indifferent over the interval; the latter capture abstention or…
We investigate the connectedness properties of the set $ I^{\!+\!}(f) $ of points where the iterates of an entire function $ f $ are unbounded. In particular, we show that $ I^{\!+\!}(f) $ is connected whenever iterates of the minimum…
We give a new proof of the Gibbard-Satterthwaite Theorem. We construct two topological spaces: one for the space of preference profiles and another for the space of outcomes. We show that social choice functions induce continuous mappings…
We consider the problem of extending an acyclic binary relation that is invariant under a given family of transformations into an invariant preference. We show that when a family of transformations is commutative, every acyclic invariant…
We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non algebraic structure, such as topological assumptions. We provide algebraic axioms of revealed preference that subsume previous, classical…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
This doctoral work focuses on three main problems related to social networks: (1) Orchestrating Network Formation: We consider the problem of orchestrating formation of a social network having a certain given topology that may be desirable…
In this paper, I propose a new framework for representing multidimensional incomplete preferences through zonotope-valued utilities, addressing the shortcomings of traditional scalar and vector-based models in decision theory. Traditional…
We focus on the majority model in a topology consisting of two coupled fully-connected networks, thereby mimicking the existence of communities in social networks. We show that a transition takes place at a value of the inter-connectivity…
The purpose of this article is to explore the properties of integrable, purely transmitting, defects placed at the junctions of several one-dimensional domains within a network. The defect sewing conditions turn out to be quite restrictive…
We introduce and study the property of orthogonal independence, a restricted additivity axiom applying when alternatives are orthogonal. The axiom requires that the preference for one marginal change over another should be maintained after…
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],…
In this paper, a new framework to study weighed networks is introduced. The idea behind this methodology is to consider that each node of the network is an agent that desires to satisfy his/her preferences in an economic sense. Moreover,…
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation focused on structured models that provide a factored…
Preferences play a key role in determining what goals/constraints to satisfy when not all constraints can be satisfied simultaneously. In this paper, we study how to synthesize preference satisfying plans in stochastic systems, modeled as…
We consider the task of collaborative preference completion: given a pool of items, a pool of users and a partially observed item-user rating matrix, the goal is to recover the \emph{personalized ranking} of each user over all of the items.…
In this paper, we investigate stable matching in structured networks. Consider case of matching in social networks where candidates are not fully connected. A candidate on one side of the market gets acquaintance with which one on the…
A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…
We extend well-known comparative results under expected utility to models of non-expected utility by providing novel conditions on local utility functions. We illustrate how our results parallel, and are distinct from, existing results for…
Similarity join, which can find similar objects (e.g., products, names, addresses) across different sources, is powerful in dealing with variety in big data, especially web data. Threshold-driven similarity join, which has been extensively…