<?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-14T07:45:55Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2445/144180" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2445/144180</identifier><datestamp>2025-11-20T11:05:52Z</datestamp><setSpec>com_2072_1057</setSpec><setSpec>col_2072_478917</setSpec><setSpec>col_2072_478919</setSpec><setSpec>col_2072_478940</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>Assortative multisided assignment games. The extreme core points [WP]</dc:title>
   <dc:creator>Martínez de Albéniz, F. Javier</dc:creator>
   <dc:creator>Rafels, Carles</dc:creator>
   <dc:creator>Ybern, Neus</dc:creator>
   <dc:subject>Teoria de jocs</dc:subject>
   <dc:subject>Matemàtica financera</dc:subject>
   <dc:subject>Models matemàtics</dc:subject>
   <dc:subject>Assignació de recursos</dc:subject>
   <dc:subject>Game theory</dc:subject>
   <dc:subject>Business mathematics</dc:subject>
   <dc:subject>Mathematical models</dc:subject>
   <dc:subject>Resource allocation</dc:subject>
   <dcterms:abstract>We analyze assortative multisided assignment games, following Sherstyuk (1999) and Martínez-de-Albéniz et al. (2019). In them players’ abilities are complementary across types (i.e. supermodular), and also the output of the essential coalitions is increasing depending on types. We study the extreme core points and show a simple mechanism to compute all of them. In this way we describe the whole core. This mechanism works from the original data array and the maximum number of extreme core points is obtained.</dcterms:abstract>
   <dcterms:issued>2019-11-08T11:20:02Z</dcterms:issued>
   <dcterms:issued>2019-11-08T11:20:02Z</dcterms:issued>
   <dcterms:issued>2019</dcterms:issued>
   <dc:type>info:eu-repo/semantics/workingPaper</dc:type>
   <dc:relation>UB Economics – Working Papers, 2019, E19/395</dc:relation>
   <dc:relation>[WP E-Eco19/395]</dc:relation>
   <dc:rights>cc-by-nc-nd, (c) Martínez de Albéniz al., 2019</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:publisher>Universitat de Barcelona. Facultat d'Economia i Empresa</dc:publisher>
   <dc:source>UB Economics – Working Papers [ERE]</dc:source>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>