Continuous Representations of Preferences by Means of Two Continuous Functions
Let $\precsim$ be a reflexive binary relation on a topological space $(X, \tau )$. A pair $(u,v)$ of continuous real-valued functions on $(X, \tau )$ is said to be a {\em continuous representation} of $\precsim$ if, for all $x,y \in X$, [$(x \precsim y \Leftrightarrow u(x) \leq v(y))$]. In this paper we provide a characterization of the existence of a continuous representation of this kind in the general case when neither the functions $u$ and $v$ nor the topological space $(X,\tau )$ are required to satisfy any particular assumptions. Such characterization is based on a suitable continuity assumption of the binary relation $\precsim$, called {\em weak continuity}. In this way, we generalize all the previous results on the continuous representability of interval orders, and also of total preorders, as particular cases.
Code (0)
등록된 구현이 없습니다.
Tasks
RelationSimilar Papers 제목 키워드 기반
Final Topology for Preference Spaces
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 differ…
Function Approximation with Randomly Initialized Neural Networks for Approximate Model Reference Adaptive Control
Classical results in neural network approximation theory show how arbitrary continuous functions can be approximated by networks with a single hidden layer, under mild assumptions on the activation function. However, the…
Facility Location Games with Scaling Effects
We take the classic facility location problem and consider a variation, in which each agent's individual cost function is equal to their distance from the facility multiplied by a scaling factor which is determined by th…
Generalizing Analogical Inference from Boolean to Continuous Domains
Analogical reasoning is a powerful inductive mechanism, widely used in human cognition and increasingly applied in artificial intelligence. Formal frameworks for analogical inference have been developed for Boolean domai…
Asymptotic convergence rates for averaging strategies
Parallel black box optimization consists in estimating the optimum of a function using $\lambda$ parallel evaluations of $f$. Averaging the $\mu$ best individuals among the $\lambda$ evaluations is known to provide bette…