<?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-14T17:48:20Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/79452" metadataPrefix="rdf">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/79452</identifier><datestamp>2025-11-07T20:00:45Z</datestamp><setSpec>com_10324_32197</setSpec><setSpec>com_10324_952</setSpec><setSpec>com_10324_894</setSpec><setSpec>com_10324_1146</setSpec><setSpec>com_10324_931</setSpec><setSpec>col_10324_32199</setSpec><setSpec>col_10324_1262</setSpec></header><metadata><rdf:RDF xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication rdf:about="oai:uvadoc.uva.es:10324/79452">
<dc:title>Characterizing competition ranks within a comprehensive family of position operators</dc:title>
<dc:creator>Martínez Panero, Miguel</dc:creator>
<dc:creator>García Lapresta, José Luis</dc:creator>
<dc:description>Producción Científica</dc:description>
<dc:description>There is only one way to assign positions to objects arranged in linear orders: following the sequence of natural&#xd;
numbers (1, 2, 3, 4, …). However, in weak orders, where ties arise, there are different possibilities to assign&#xd;
positions to tied objects. In this paper, we focus mainly on three relevant cases: the standard, modified, and&#xd;
fractional ranks. They are differentiated by the spaces that appear after, before, or on either side of the position&#xd;
values corresponding to the objects that are in a tie. For instance, if two objects are tied and are located immedi-&#xd;
ately below the top object, these ranks assign the positions (1, 2, 2, 4, …), (1, 3, 3, 4, …), and (1, 2.5, 2.5, 4, …),&#xd;
respectively. Collectively, and because of the common properties shown here, we call them “competition ranks”.&#xd;
In this paper, we characterize a parameterized family of position operators which includes the competition ranks.&#xd;
We also provide specific axiomatizations of each of them, taking into account the spaces in the sequence of as-&#xd;
signed position numbers. It is shown why the dense rank (1, 2, 2, 3, …), another position operator where gaps&#xd;
do not appear, is an essentially different approach. Furthermore, interesting duality relationships are revealed&#xd;
between the competition ranks and between the properties introduced to characterize them, which allow us&#xd;
to understand their internal logic and connections. Different examples, mainly from sports, bibliometrics, etc.,&#xd;
illustrate the introduced concepts</dc:description>
<dc:date>2025-11-07T13:22:28Z</dc:date>
<dc:date>2025-11-07T13:22:28Z</dc:date>
<dc:date>2025</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>European Journal of Operational Research, 2025.</dc:identifier>
<dc:identifier>0377-2217</dc:identifier>
<dc:identifier>https://uvadoc.uva.es/handle/10324/79452</dc:identifier>
<dc:identifier>10.1016/j.ejor.2025.10.030</dc:identifier>
<dc:identifier>European Journal of Operational Research</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>https://www.sciencedirect.com/science/article/pii/S0377221725008501</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by-nc/4.0/</dc:rights>
<dc:rights>© 2025 The Author(s)</dc:rights>
<dc:rights>Atribución-NoComercial 4.0 Internacional</dc:rights>
<dc:publisher>Elsevier</dc:publisher>
<dc:peerreviewed>SI</dc:peerreviewed>
</ow:Publication>
</rdf:RDF></metadata></record></GetRecord></OAI-PMH>