<?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-14T05:34:59Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:10256/26378" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:10256/26378</identifier><datestamp>2025-02-12T19:59:19Z</datestamp><setSpec>com_2072_452955</setSpec><setSpec>com_2072_2054</setSpec><setSpec>col_2072_452964</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" 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>Weak pairwise justifiability as a common root of Arrow’s and the Gibbard–Satterthwaite theorems</dc:title>
   <dc:creator>Barberà, Salvador</dc:creator>
   <dc:creator>Berga, Dolors</dc:creator>
   <dc:creator>Moreno, Bernardo</dc:creator>
   <dc:creator>Nicolò, Antonio</dc:creator>
   <dc:subject>Gibbard-Satterthwaite, Teoria de</dc:subject>
   <dc:subject>Gibbard-Satterthwaite theory</dc:subject>
   <dc:subject>Arrow, Paradoxa de</dc:subject>
   <dc:subject>Arrow paradox</dc:subject>
   <dc:subject>Decisió multicriteri</dc:subject>
   <dc:subject>Multiple criteria decision making</dc:subject>
   <dcterms:abstract>We introduce a novel principle that we call weak pairwise justifiability, which applies to a large class of collective choice rules, including the social choice functions and the social welfare functions about which the Gibbard–Satterthwaite theorem and Arrow’s impossibility theorem are predicated, respectively. We prove that, under appropriate qualifications, our principle is a common root for these two classical results, when applied to rules defined over the full domain of weak preference orders (also for strict)</dcterms:abstract>
   <dcterms:abstract>Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature</dcterms:abstract>
   <dcterms:dateAccepted>2025-02-12T19:59:18Z</dcterms:dateAccepted>
   <dcterms:available>2025-02-12T19:59:18Z</dcterms:available>
   <dcterms:created>2025-02-12T19:59:18Z</dcterms:created>
   <dcterms:issued>2025-01-07</dcterms:issued>
   <dc:type>info:eu-repo/semantics/article</dc:type>
   <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
   <dc:type>peer-reviewed</dc:type>
   <dc:identifier>http://hdl.handle.net/10256/26378</dc:identifier>
   <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/s00355-024-01575-6</dc:relation>
   <dc:relation>info:eu-repo/semantics/altIdentifier/issn/0176-1714</dc:relation>
   <dc:relation>info:eu-repo/semantics/altIdentifier/eissn/1432-217X</dc:relation>
   <dc:rights>Attribution 4.0 International</dc:rights>
   <dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:publisher>Springer</dc:publisher>
   <dc:source>Social Choice and Welfare, 2025, vol. undefined, p. null</dc:source>
   <dc:source>Articles publicats (D-EC)</dc:source>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>