Related papers: Connected Incomplete Preferences
We study future-blind preferences, which are preferences that heavily discount the future, within the space of infinite consumption streams. We give two definitions: $N$-blindness, where agents ignore periods beyond a fixed date $N$, and…
This paper describes the structure of optimal policies for infinite-state Markov Decision Processes with setwise continuous transition probabilities. The action sets may be noncompact. The objective criteria are either the expected total…
In spite of its relevance to the origin of complex networks, the interplay between form and function and its role during network formation remains largely unexplored. While recent studies introduce dynamics by considering rewiring processes…
Ontologies have been used for the purpose of bringing system and consistency to subject and knowledge areas. We present a criticism of the present mathematical structure of ontologies and indicate that they are not sufficient in their…
In this article we presented a brief study of the main network models with growth and preferential attachment. Such models are interesting because they present several characteristics of real systems. We started with the classical model…
Recommender systems have emerged as a new weapon to help online firms to realize many of their strategic goals (e.g., to improve sales, revenue, customer experience etc.). However, many existing techniques commonly approach these goals by…
The entanglement-sharing properties of an infinite spin-chain are studied when the state of the chain is a pure, translation-invariant state with a matrix-product structure. We study the entanglement properties of such states by means of…
We study the problem of eliciting the preferences of a decision-maker through a moderate number of pairwise comparison queries to make them a high quality recommendation for a specific problem. We are motivated by applications in high…
In this work, we reformulate the problem of existence of maximal elements for preference relations as a variational inequality problem in the sense of Stampacchia. Similarly, we establish the uniqueness of maximal elements using a…
The connected door space is an enigmatic topological space in which every proper nonempty subset is either open or closed, but not both. This paper provides an elementary proof of the classification theorem of connected door spaces. More…
Using the similar formulas of the preference relation and the utility function, we propose the confidence relations and the corresponding influence functions that represent various interacting strengths of different families, cliques and…
In the literature, various types of points and meager sets whose complements are connected have been studied, such as colocally connected points, non-weak cut points/sets, non-block points/sets, shore points/sets, etc. We extend that study,…
Complex networks topologies present interesting and surprising properties, such as community structures, which can be exploited to optimize communication, to find new efficient and context-aware routing algorithms or simply to understand…
This paper introduces the axiom of Negative Dominance, stating that if a lottery $f$ is strictly preferred to a lottery $g$, then some outcome in the support of $f$ is strictly preferred to some outcome in the support of $g$. It is shown…
The Assignment problem is a fundamental and well-studied problem in the intersection of Social Choice, Computational Economics and Discrete Allocation. In the Assignment problem, a group of agents expresses preferences over a set of items,…
We study the testable implications of models of dynamically inconsistent choices when planned choices are unobservable, and thus only "on path" data is available. First, we discuss the approach in Blow, Browning and Crawford (2021), who…
Preferences are a pivotal component in practical reasoning, especially in tasks that involve decision-making over different options or courses of action that could be pursued. In this work, we focus on repairing and querying inconsistent…
Connectedness, path connectedness, and uniform connectedness are well-known concepts. In the traditional presentation of these concepts there is a substantial difference between connectedness and the other two notions, namely connectedness…
Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…
The aim of this paper is to study the topological properties of some classes of subsemimodules endowed with a subbasis closed-set topology. We show that such spaces are $T_0$. When the semimodule is finitely generated, those spaces are…