<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-23T12:57:54Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/40516" metadataPrefix="mods">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/40516</identifier><datestamp>2021-06-23T10:07:25Z</datestamp><setSpec>com_10324_1146</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_1262</setSpec></header><metadata><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:namePart>García Lapresta, José Luis</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Pérez Román, David</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2020-02-21T13:37:16Z</mods:dateAvailable>
</mods:extension>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2020-02-21T13:37:16Z</mods:dateAccessioned>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2018</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">Applied Soft Computing, 2018, Volume 67,  Pages 652-657</mods:identifier>
<mods:identifier type="issn">1568-4946</mods:identifier>
<mods:identifier type="uri">http://uvadoc.uva.es/handle/10324/40516</mods:identifier>
<mods:identifier type="doi">10.1016/j.asoc.2017.05.064</mods:identifier>
<mods:identifier type="publicationfirstpage">652</mods:identifier>
<mods:identifier type="publicationlastpage">657</mods:identifier>
<mods:identifier type="publicationtitle">Applied Soft Computing</mods:identifier>
<mods:identifier type="publicationvolume">67</mods:identifier>
<mods:abstract>This paper introduces a new voting system in the setting of ordered qualitative scales. The process is conducted in a purely ordinal way by considering an ordinal proximity measure that assigns an ordinal degree of proximity to each pair of linguistic terms of the qualitative scale. Once the agents assess the alternatives through the qualitative scale, the alternatives are ranked according to the medians of the ordinal degrees of proximity between the obtained individual assessments and the highest linguistic term of the scale. Since some alternatives may share the same median, an appropriate tie-breaking procedure is introduced. Some properties of the proposed voting system have been provided.</mods:abstract>
<mods:language>
<mods:languageTerm>eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">info:eu-repo/semantics/openAccess</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">http://creativecommons.org/licenses/by-nc-nd/4.0/</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">© 2017 Elsevier</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">Attribution-NonCommercial-NoDerivatives 4.0 Internacional</mods:accessCondition>
<mods:titleInfo>
<mods:title>Aggregating opinions in non-uniform ordered qualitative scales</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/article</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>