<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.1016/j.jmp.2023.102806</dc:identifier><dc:language>eng</dc:language><dc:creator>Candeal, Juan C.</dc:creator><dc:title>A characterization of two-agent Pareto representable orderings</dc:title><dc:identifier>ART-2023-135603</dc:identifier><dc:description>Partial orders defined on a nonempty set X admitting a two-agent Pareto representation are characterized. The characterization is based upon the fulfillment of two axioms. The first one entails the existence, for any point x € X, of a very particular decomposition of the points which are incomparable to x. The second one encodes a separability condition. Our approach is then applied to show that if the cardinality of X is, at most, 5, then a two-agent Pareto representation always exists whereas this need not be the case otherwise. The connection with the concept of the dimension of a poset is also discussed. Certain examples are also presented that illustrate the scope of our tools.</dc:description><dc:date>2023</dc:date><dc:source>http://zaguan.unizar.es/record/128227</dc:source><dc:doi>10.1016/j.jmp.2023.102806</dc:doi><dc:identifier>http://zaguan.unizar.es/record/128227</dc:identifier><dc:identifier>oai:zaguan.unizar.es:128227</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/MICINN/PID2019-108348RA-I00</dc:relation><dc:identifier.citation>JOURNAL OF MATHEMATICAL PSYCHOLOGY 116 (2023), 102806 [6 pp.]</dc:identifier.citation><dc:rights>by-nc-nd</dc:rights><dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>