<?xml version="1.0" encoding="UTF-8" ?>
<oai_dc:dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>A characterization of Kruskal sharing rules for minimum cost spanning tree problems</dc:title>
<dc:creator>Lorenzo Picado, Leticia</dc:creator>
<dc:creator>Lorenzo Freire, Silvia Maria</dc:creator>
<dc:subject>5399 Otras Especialidades económicas</dc:subject>
<dc:description>In Tijs et al. (Eur J Oper Res 175:121-134, 2006) a new family of cost allocation rules is introduced in the context of cost spanning tree problems. In this paper we provide the first characterization of this family by means of population monotonicity and a property of additivity.</dc:description>
<dc:description>Ministerio de Ciencia y Tecnología y FEDER | Ref. SEJ2005-07637-C02-01</dc:description>
<dc:description>Xunta de Galicia | Ref. PGIDIT06PXIB362390PR</dc:description>
<dc:description>Xunta de Galicia | Ref. PGIDIT06PXIC300184PN</dc:description>
<dc:publisher>International Journal of Game Theory</dc:publisher>
<dc:publisher>Estatística e investigación operativa</dc:publisher>
<dc:publisher>Research Group In Economic Analysis</dc:publisher>
<dc:date>2019-01-08T10:12:27Z</dc:date>
<dc:date>2019-01-08T10:12:27Z</dc:date>
<dc:date>2009-03</dc:date>
<dc:date>2019-01-08T10:04:23Z</dc:date>
<dc:type>article</dc:type>
<dc:identifier>International Journal of Game Theory, 38(1): 107-126 (2009)</dc:identifier>
<dc:identifier>00207276</dc:identifier>
<dc:identifier>14321270</dc:identifier>
<dc:identifier>http://hdl.handle.net/11093/1100</dc:identifier>
<dc:identifier>10.1007/s00182-008-0147-0</dc:identifier>
<dc:identifier>http://link.springer.com/10.1007/s00182-008-0147-0</dc:identifier>
<dc:language>eng</dc:language>
<dc:rights>openAccess</dc:rights>
</oai_dc:dc>
<?xml version="1.0" encoding="UTF-8" ?>
<atom:entry>
<atom:id>http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/1100/ore.xml</atom:id>
<atom:published>2019-01-09T03:36:41.609+01:00</atom:published>
<atom:updated>2019-01-09T03:36:41.609+01:00</atom:updated>
<atom:source>
<atom:generator uri="http://www.investigo.biblioteca.uvigo.es/oai">Investigo</atom:generator>
</atom:source>
<atom:title>A characterization of Kruskal sharing rules for minimum cost spanning tree problems</atom:title>
<atom:author>
<atom:name>Lorenzo Picado, Leticia</atom:name>
</atom:author>
<atom:author>
<atom:name>Lorenzo Freire, Silvia Maria</atom:name>
</atom:author>
<oreatom:triples>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/1100/ore.xml">
<dcterms:modified>2019-01-08T11:14:55.906+01:00</dcterms:modified>
</rdf:Description>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1100/sword.zip?sequence=3">
<dcterms:description>SWORD</dcterms:description>
</rdf:Description>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1100/license.txt?sequence=2">
<dcterms:description>LICENSE</dcterms:description>
</rdf:Description>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1100/obl_mon_add_IJGT5.pdf?sequence=1">
<dcterms:description>ORIGINAL</dcterms:description>
</rdf:Description>
</oreatom:triples>
</atom:entry>
<?xml version="1.0" encoding="UTF-8" ?>
<dcterms:dateAccepted lang="" schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd">2019-01-08T10:12:27Z</dcterms:dateAccepted>
<?xml version="1.0" encoding="UTF-8" ?>
<dcterms:dateAccepted lang="" schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd">2019-01-08T10:12:27Z</dcterms:dateAccepted>
<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF schemaLocation="http://www.w3.org/1999/02/22-rdf-syntax-ns# http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication about="oai:investigo.biblioteca.uvigo.es:11093/1100">
<dc:creator>Lorenzo Picado, Leticia</dc:creator>
<dc:creator>Lorenzo Freire, Silvia Maria</dc:creator>
<dc:date>2019-01-08T10:12:27Z</dc:date>
<dc:date>2009-03</dc:date>
<dc:identifier>International Journal of Game Theory, 38(1): 107-126 (2009)</dc:identifier>
<dc:identifier>00207276</dc:identifier>
<dc:identifier>14321270</dc:identifier>
<dc:identifier>http://hdl.handle.net/11093/1100</dc:identifier>
<dc:description>In Tijs et al. (Eur J Oper Res 175:121-134, 2006) a new family of cost allocation rules is introduced in the context of cost spanning tree problems. In this paper we provide the first characterization of this family by means of population monotonicity and a property of additivity.</dc:description>
<dc:description>Ministerio de Ciencia y Tecnología y FEDER | Ref. SEJ2005-07637-C02-01</dc:description>
<dc:description>Xunta de Galicia | Ref. PGIDIT06PXIB362390PR</dc:description>
<dc:description>Xunta de Galicia | Ref. PGIDIT06PXIC300184PN</dc:description>
<dc:language>eng</dc:language>
<dc:publisher>International Journal of Game Theory</dc:publisher>
<dc:title>A characterization of Kruskal sharing rules for minimum cost spanning tree problems</dc:title>
<dc:type>article</dc:type>
<dc:rights>openAccess</dc:rights>
<dc:identifier>10.1007/s00182-008-0147-0</dc:identifier>
<dc:identifier>http://link.springer.com/10.1007/s00182-008-0147-0</dc:identifier>
<dc:publisher>Estatística e investigación operativa</dc:publisher>
<dc:publisher>Research Group In Economic Analysis</dc:publisher>
<dc:subject>5399 Otras Especialidades económicas</dc:subject>
<dc:authorID>3720</dc:authorID>
<dc:authorID>4775</dc:authorID>
<dc:date>2019-01-08T10:04:23Z</dc:date>
<dc:numberID>5c34759df05f89.94164050</dc:numberID>
<dc:advertisements>Os dereitos do item foron comprobados polo sistema</dc:advertisements>
<dc:computerCitation>pub_title=International Journal of Game Theory|volume=38|journal_number=1|start_pag=107|end_pag=126</dc:computerCitation>
<dc:rights>Si</dc:rights>
<dc:source>Comunidad</dc:source>
<dc:source>Artículos</dc:source>
</ow:Publication>
</rdf:RDF>
<?xml version="1.0" encoding="UTF-8" ?>
<dcterms:dateAccepted lang="">2019-01-08T10:12:27Z</dcterms:dateAccepted>