<?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-05-30T05:54:11Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/38831" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/38831</identifier><datestamp>2026-02-03T11:30:51Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Eliciting the deserving winner in the presence of enemies</dc:title>
   <dc:creator>Amorós-González, Pablo</dc:creator>
   <dc:subject>Juegos, Teoría de</dc:subject>
   <dc:subject>Jurado</dc:subject>
   <dc:subject>Prejuicios</dc:subject>
   <dc:subject>Votación</dc:subject>
   <dc:subject>Elección social</dc:subject>
   <dcterms:abstract>We analyze the problem of a jury that has to select the deserving winner from a group of candidates when (i) the identity of the deserving winner is known to all jurors but not verifiable, (ii) each juror identifies with a different candidate whom they want to favor, and (iii) some jurors may have enemies among the candidates whom they want to harm. We introduce a necessary condition relating to the jurors’ enemies for implementing the deserving winner, called minimal impartiality. The mechanisms proposed in the literature to implement the deserving winner via backward induction fail when jurors have enemies, even though minimal impartiality is satisfied. We propose a simple sequential mechanism that successfully implements the deserving winner via backward induction, whether the jurors have enemies or not, as long as minimal impartiality is satisfied.</dcterms:abstract>
   <dcterms:dateAccepted>2025-06-04T06:35:32Z</dcterms:dateAccepted>
   <dcterms:available>2025-06-04T06:35:32Z</dcterms:available>
   <dcterms:created>2025-06-04T06:35:32Z</dcterms:created>
   <dcterms:issued>2025-04-14</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>Amorós, P. Eliciting the deserving winner in the presence of enemies. Soc Choice Welf (2025).</dc:identifier>
   <dc:identifier>0176-1714</dc:identifier>
   <dc:identifier>https://hdl.handle.net/10630/38831</dc:identifier>
   <dc:identifier>10.1007/s00355-025-01600-2</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
   <dc:rights>open access</dc:rights>
   <dc:rights>Atribución 4.0 Internacional</dc:rights>
   <dc:publisher>Springer Nature</dc:publisher>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>