Ramón Pino Pérez

Ramón Pino Pérez

Auto-generated profile, based on publicly available information

Ramón Pino Pérez

Departamento de Matemáticas Facultad de Ciencias Universidad de Los Andes Mérida Venezuela

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 March 2011 in Journal of Philosophical Logic
Verified
Journal Article
Closed access
PDF file
SKSébastien Konieczny
Sébastien Konieczny
RPRamón Pino Pérez
Ramón Pino Pérez

31 March 2006 in Information Fusion
Verified
Journal Article
Closed access
JCJosé Luis Chacón
José Luis Chacón
RPRamón Pino Pérez
Ramón Pino Pérez

3 April 2013 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
SKSébastien Konieczny
Sébastien Konieczny
RPRamon Pino Pérez
Ramon Pino Pérez

1 July 2017 in Revista Colombiana de Matemáticas
Verified
Journal Article
Open access
PDF file
JLJahn Franklin Leal
Jahn Franklin Leal
RPRamón Pino Pérez
Ramón Pino Pérez
Lifting preferences over candidates to preferences over sets of candidates allows us to give a very natural notion of manipulability for social choice functions. In particular, we give simple conditions over the liftings entailing the manipulability of reasonable social choice functions. Our result is a weak version of Barberà and Kelly's Theorem, indeed it can be obtained from this last Theorem. However, we give a direct and very natural proof of our manipulability Theorem which is informative about the nature of the liftings allowing manipulability.

2 June 2021 in Mathematical Social Sciences
Verified
Journal Article
Closed access
FCFranklin Camacho
Franklin Camacho
RPRamón Pino Pérez
Ramón Pino Pérez

30 October 2019 in arXiv
Verified
Preprint
Open access
PDF file
NBNerio Borges
Nerio Borges
RPRamón Pino Pérez
Ramón Pino Pérez
In most classical models of belief change, epistemic states are represented by theories (AGM) or formulas (Katsuno-Mendelzon) and the new pieces of information by formulas. The Representation Theorem for revision operators says that operators are represented by total preorders. This important representation is exploited by Darwiche and Pearl to shift the notion of epistemic state to a more abstract one, where the paradigm of epistemic state is indeed that of a total preorder over interpretations. In this work, we introduce a 3-valued logic where the formulas can be identified with a generalisation of total preorders of three levels: a ranking function mapping interpretations into the truth values. Then we analyse some sort of changes in this kind of structures and give syntactical characterizations of them.