On the threshold representation of partial orderings
Year: 2026
Type: article
Abstract: In this paper, we provide a constructive proof for threshold representations of partial orderings in a finite setting and extend the construction to arbitrary sets. This contributes to a long-standing open problem posed in Nakamura (2002) and Aleskerov et al. (2007). We identify and discuss aspects of our proof that do not directly generalize to an infinite setting and, for each, provide intuitive sufficient conditions.
Source: Mathematical Social Sciences
Authors: Daniele Caliari, Davide Carpentiere
Institutions: WZB Berlin Social Science Center, University of Catania
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: hybrid
Estimated APC paid: $2,850
OpenAlex ID: W7129657390