On the threshold representation of partial orderings

Daniele Caliari and Davide Carpentiere

EconStor Open Access Articles and Book Chapters, 2026, vol. 140, No 102516, 7 pages

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.

Keywords: Incompleteness; Partial orderings; Numerical representation (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/337878/1/F ... -On-the-treshold.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:espost:337878

DOI: 10.1016/j.mathsocsci.2026.102516

Access Statistics for this article

More articles in EconStor Open Access Articles and Book Chapters from ZBW - Leibniz Information Centre for Economics Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().