Estevan Muguerza, Asier

Loading...
Profile Picture

Email Address

Birth Date

Job Title

Last Name

Estevan Muguerza

First Name

Asier

person.page.departamento

Estadística, Informática y Matemáticas

person.page.instituteName

INARBE. Institute for Advanced Research in Business and Economics

person.page.observainves

person.page.upna

Name

Search Results

Now showing 1 - 2 of 2
  • PublicationOpen Access
    Partial representations of orderings
    (World Scientific, 2018) Bosi, Gianni; Estevan Muguerza, Asier; Zuanon, Magali; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
    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 represent the orderings in the simplest manner, avoiding any unnecessary information. For this purpose, the new concept of representability is developed by means of partial functions, so that other common definitions of representability (i.e. (Richter-Peleg) multi-utility, Scott-Suppes representability, … ) are now particular cases in which the partial functions are actually functions. The paper also presents a collection of examples and propositions showing the advantages of this kind of representations, particularly in the case of partial orders and semiorders, as well as some results showing the connections between distinct kinds of representations.
  • PublicationOpen Access
    Semiorders and continuous Scott–Suppes representations. Debreu’s Open Gap Lemma with a threshold
    (Elsevier, 2023) Estevan Muguerza, Asier; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Research in Business and Economics - INARBE; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, JIUPNA19-2022
    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 like Debreu’s Open Gap Lemma, but for semiorders, was found. In the present paper, we characterize semiorders that accept a continuous representation (in the sense of Scott–Suppes). Two weaker theorems are also proved, which provide a programmable approach to Open Gap Lemma, yield a Debreu’s Lemma for semiorders, and enable us to remove the open-closed and closed-open gaps of a set of reals while keeping the threshold.