Partial representations of orderings
In the present paper a new concept of representability is introduced, which can be applied to
not total and also to intransitive relations (semiorders in particular). This idea tries to …
not total and also to intransitive relations (semiorders in particular). This idea tries to …
A new approach on distributed systems: orderings and representability
AE Muguerza - arXiv preprint arXiv:2306.16888, 2023 - arxiv.org
In the present paper we propose a new approach ondistributed systems': the processes are
represented through total orders and the communications are characterized by means of …
represented through total orders and the communications are characterized by means of …
An Approach to Distributed Systems from Orderings and Representability
A Estevan - Bulletin of the Iranian Mathematical Society, 2024 - Springer
In the present paper, we propose a new approach on 'distributed systems': the processes
are represented through total orders and the communications are characterized by means of …
are represented through total orders and the communications are characterized by means of …
Interval orders, semiorders and ordered groups
We prove that the order of an ordered group is an interval order if and only if it is a
semiorder. Next, we prove that every semiorder is isomorphic to a collection J of intervals of …
semiorder. Next, we prove that every semiorder is isomorphic to a collection J of intervals of …
OWA operators based on admissible permutations
D Paternain, LS Jin, R Mesiar… - … on Fuzzy Systems …, 2019 - ieeexplore.ieee.org
In this work we propose a new OWA operator defined on bounded convex posets of a vector-
lattice. In order to overcome the non-existence of a total order, which is necessary to obtain a …
lattice. In order to overcome the non-existence of a total order, which is necessary to obtain a …
[HTML][HTML] Semiorders and continuous Scott–Suppes representations. Debreu's Open Gap Lemma with a threshold
A Estevan - Journal of Mathematical Psychology, 2023 - Elsevier
The problem of finding a utility function for a semiorder has been studied since 1956, when
the notion of semiorder was introduced by Luce. But few results on continuity and no result …
the notion of semiorder was introduced by Luce. But few results on continuity and no result …
Entropy conservation for comparison-based algorithms
MP Schellekens - Topology and its Applications, 2022 - Elsevier
Abstract Comparison-based algorithms are algorithms for which the execution of each
operation is solely based on the outcome of a series of comparisons between elements [5] …
operation is solely based on the outcome of a series of comparisons between elements [5] …
[引用][C] Semiorders and continuous Scott–Suppes representations. Debreu's Open Gap Lemma with a threshold
A Estevan Muguerza - Journal of Mathematical Psychology 113 (2023) …, 2023 - Elsevier