<?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.1111/itor.12565</dc:identifier><dc:language>eng</dc:language><dc:creator>Laliena, P.</dc:creator><dc:creator>Lopez, F.J.</dc:creator><dc:title>Fair draws for group rounds in sport tournaments</dc:title><dc:identifier>ART-2019-109068</dc:identifier><dc:description>We propose two draw systems for the group round of sport tournaments where there are some geographical and/or seeding restrictions. One of the systems, related to the equal-sum partition problem, is "perfect, " since it yields perfectly balanced groups. The other system, which uses the classical scheme of extracting teams from pots, is heuristic and gives results where the groups have very similar scores. We apply our results to Federation Internationale de Football Association (FIFA) Soccer World Cups and show that our proposals are much better than the FIFA system and also outperform other recently developed systems.</dc:description><dc:date>2019</dc:date><dc:source>http://zaguan.unizar.es/record/75965</dc:source><dc:doi>10.1111/itor.12565</dc:doi><dc:identifier>http://zaguan.unizar.es/record/75965</dc:identifier><dc:identifier>oai:zaguan.unizar.es:75965</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/MICINN/MTM2017-83812-P</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/MINECO/MTM2014-53340-P</dc:relation><dc:identifier.citation>INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 26, 2 (2019), 439-457</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>