Related papers: Connected Incomplete Preferences
Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that appear in imprecise-probabilistic decision…
This paper uncovers tight bounds on the number of preferences permissible in identified random utility models. We show that as the number of alternatives in a discrete choice model becomes large, the fraction of preferences admissible in an…
In real life situations often paired comparisons involving alternatives of either full or partial profiles to mitigate cognitive burden are presented. For this situation the problem of finding optimal designs is considered in the presence…
A new family of graphs, {\it entangled networks}, with optimal properties in many respects, is introduced. By definition, their topology is such that optimizes synchronizability for many dynamical processes. These networks are shown to have…
We introduce a novel choice dataset, called joint choice, in which options and menus are multidimensional. In this general setting, we define a notion of choice separability, which requires that selections from some dimensions are never…
We begin the study of completeness of affine connections, especially those on statistical manifolds as well as on affine hypersurfaces. We collect basic facts, prove new theorems and provide examples with remarkable properties.
Complexity of the problem of choosing among uncertain acts is a salient feature of many of the environments in which departures from expected utility theory are observed. I propose and axiomatize a model of choice under uncertainty in which…
In many domains it is desirable to assess the preferences of users in a qualitative rather than quantitative way. Such representations of qualitative preference orderings form an importnat component of automated decision tools. We propose a…
Reciprocity characterizes the information exchange between users in a network, and some empirical studies have revealed that social networks have a high proportion of reciprocal edges. Classical directed preferential attachment (PA) models,…
We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…
Simple growth mechanisms have been proposed to explain the emergence of seemingly universal network structures. The widely-studied model of preferential attachment assumes that new nodes are more likely to connect to highly connected nodes.…
This paper identifies a new class of shape invariant models. These models are based on extensions of conventional quantum mechanics that satisfy a string-motivated minimal length uncertainty relation. An important feature of our…
We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to…
We investigate the possibility of replacing the topology of convergence in probability with convergence in $L^1$. A characterization of continuous linear functionals on the space of measurable functions is also obtained.
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…
Incorporating graph side information into recommender systems has been widely used to better predict ratings, but relatively few works have focused on theoretical guarantees. Ahn et al. (2018) firstly characterized the optimal sample…
Complex applications such as big data analytics involve different forms of coupling relationships that reflect interactions between factors related to technical, business (domain-specific) and environmental (including socio-cultural and…
In this paper we present a framework for the extension of the preferential attachment (PA) model to heterogeneous complex networks. We define a class of heterogeneous PA models, where node properties are described by fixed states in an…
We consider a logic used to describe sets of configurations of distributed systems, whose network topologies can be changed at runtime, by reconfiguration programs. The logic uses inductive definitions to describe networks with an unbounded…