This paper contributes to the theoretical literature on decision models where agents may encounter challenges in comparing alternatives. We introduce a characterization of countable Richter–Peleg multi-utility representations, both semicontinuous (upper and lower) and continuous, within preorders that may not be total. The proposed theorems provide a comprehensive mathematical framework, complementing previous results of Alcantud et al. and Bosi on countable multi-utility representations. Our characterizations establish necessary and sufficient conditions through topological properties and constructive methods via indicator functions. Furthermore, we introduce a topological framework aligned with the property of strong local non-satiation and provide a novel theorem containing sufficient conditions for the existence of countable upper semi-continuous multi-utility representations of a preorder. The results demonstrate that preference representations can be achieved using countably many functions rather than uncountable families, with implications for computational tractability and the identification of maximal elements in optimization contexts.
Characterization of countable and continuous Richter–Peleg multi-utility representations
Gianni Bosi
;
2025-01-01
Abstract
This paper contributes to the theoretical literature on decision models where agents may encounter challenges in comparing alternatives. We introduce a characterization of countable Richter–Peleg multi-utility representations, both semicontinuous (upper and lower) and continuous, within preorders that may not be total. The proposed theorems provide a comprehensive mathematical framework, complementing previous results of Alcantud et al. and Bosi on countable multi-utility representations. Our characterizations establish necessary and sufficient conditions through topological properties and constructive methods via indicator functions. Furthermore, we introduce a topological framework aligned with the property of strong local non-satiation and provide a novel theorem containing sufficient conditions for the existence of countable upper semi-continuous multi-utility representations of a preorder. The results demonstrate that preference representations can be achieved using countably many functions rather than uncountable families, with implications for computational tractability and the identification of maximal elements in optimization contexts.| File | Dimensione | Formato | |
|---|---|---|---|
|
Bosi et al. JMP 2025.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Documento in Versione Editoriale
Licenza:
Creative commons
Dimensione
755.15 kB
Formato
Adobe PDF
|
755.15 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


