<?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: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>
<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>
</oai_dc:dc>
<?xml version="1.0" encoding="UTF-8" ?>
<d:DIDL schemaLocation="urn:mpeg:mpeg21:2002:02-DIDL-NS http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/did/didl.xsd">
<d:DIDLInfo>
<dcterms:created schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/dcterms.xsd">2019-01-08T10:12:27Z</dcterms:created>
</d:DIDLInfo>
<d:Item id="hdl_11093_1100">
<d:Descriptor>
<d:Statement mimeType="application/xml; charset=utf-8">
<dii:Identifier schemaLocation="urn:mpeg:mpeg21:2002:01-DII-NS http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/dii/dii.xsd">urn:hdl:11093/1100</dii:Identifier>
</d:Statement>
</d:Descriptor>
<d:Descriptor>
<d:Statement mimeType="application/xml; charset=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: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: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>
<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>
</oai_dc:dc>
</d:Statement>
</d:Descriptor>
<d:Component id="11093_1100_1">
</d:Component>
</d:Item>
</d:DIDL>
<?xml version="1.0" encoding="UTF-8" ?>
<dim:dim schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
<dim:field authority="3720" confidence="500" element="contributor" mdschema="dc" qualifier="author">Lorenzo Picado, Leticia</dim:field>
<dim:field authority="4775" confidence="500" element="contributor" mdschema="dc" qualifier="author">Lorenzo Freire, Silvia Maria</dim:field>
<dim:field element="date" mdschema="dc" qualifier="accessioned">2019-01-08T10:12:27Z</dim:field>
<dim:field element="date" mdschema="dc" qualifier="available">2019-01-08T10:12:27Z</dim:field>
<dim:field element="date" mdschema="dc" qualifier="issued">2009-03</dim:field>
<dim:field element="date" mdschema="dc" qualifier="updated">2019-01-08T10:04:23Z</dim:field>
<dim:field element="identifier" lang="spa" mdschema="dc" qualifier="citation">International Journal of Game Theory, 38(1): 107-126 (2009)</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="issn">00207276</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="issn">14321270</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="uri">http://hdl.handle.net/11093/1100</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="doi">10.1007/s00182-008-0147-0</dim:field>
<dim:field element="identifier" lang="spa" mdschema="dc" qualifier="editor">http://link.springer.com/10.1007/s00182-008-0147-0</dim:field>
<dim:field element="description" lang="spa" mdschema="dc" qualifier="abstract">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.</dim:field>
<dim:field element="description" lang="spa" mdschema="dc" qualifier="sponsorship">Ministerio de Ciencia y Tecnología y FEDER | Ref. SEJ2005-07637-C02-01</dim:field>
<dim:field element="description" lang="spa" mdschema="dc" qualifier="sponsorship">Xunta de Galicia | Ref. PGIDIT06PXIB362390PR</dim:field>
<dim:field element="description" lang="spa" mdschema="dc" qualifier="sponsorship">Xunta de Galicia | Ref. PGIDIT06PXIC300184PN</dim:field>
<dim:field element="language" lang="spa" mdschema="dc" qualifier="iso">eng</dim:field>
<dim:field element="publisher" lang="spa" mdschema="dc">International Journal of Game Theory</dim:field>
<dim:field element="publisher" lang="spa" mdschema="dc" qualifier="departamento">Estatística e investigación operativa</dim:field>
<dim:field element="publisher" lang="spa" mdschema="dc" qualifier="grupoinvestigacion">Research Group In Economic Analysis</dim:field>
<dim:field element="title" lang="spa" mdschema="dc">A characterization of Kruskal sharing rules for minimum cost spanning tree problems</dim:field>
<dim:field element="type" lang="spa" mdschema="dc">article</dim:field>
<dim:field element="rights" lang="spa" mdschema="dc" qualifier="accessRights">openAccess</dim:field>
<dim:field element="subject" lang="spa" mdschema="dc" qualifier="unesco">5399 Otras Especialidades económicas</dim:field>
<dim:field element="computerCitation" lang="spa" mdschema="dc">pub_title=International Journal of Game Theory|volume=38|journal_number=1|start_pag=107|end_pag=126</dim:field>
</dim:dim>
<?xml version="1.0" encoding="UTF-8" ?>
<thesis schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>A characterization of Kruskal sharing rules for minimum cost spanning tree problems</title>
<creator>Lorenzo Picado, Leticia</creator>
<creator>Lorenzo Freire, Silvia Maria</creator>
<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.</description>
<date>2019-01-08</date>
<date>2019-01-08</date>
<date>2009-03</date>
<date>2019-01-08</date>
<type>article</type>
<identifier>International Journal of Game Theory, 38(1): 107-126 (2009)</identifier>
<identifier>00207276</identifier>
<identifier>14321270</identifier>
<identifier>http://hdl.handle.net/11093/1100</identifier>
<identifier>10.1007/s00182-008-0147-0</identifier>
<identifier>http://link.springer.com/10.1007/s00182-008-0147-0</identifier>
<language>eng</language>
<rights>openAccess</rights>
<publisher>International Journal of Game Theory</publisher>
<publisher>Estatística e investigación operativa</publisher>
<publisher>Research Group In Economic Analysis</publisher>
</thesis>
<?xml version="1.0" encoding="UTF-8" ?>
<record schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
<leader>00925njm 22002777a 4500</leader>
<datafield ind1=" " ind2=" " tag="042">
<subfield code="a">dc</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Lorenzo Picado, Leticia</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Lorenzo Freire, Silvia Maria</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="260">
<subfield code="c">2009-03</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="520">
<subfield code="a">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.</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">International Journal of Game Theory, 38(1): 107-126 (2009)</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">00207276</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">14321270</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">http://hdl.handle.net/11093/1100</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">10.1007/s00182-008-0147-0</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">http://link.springer.com/10.1007/s00182-008-0147-0</subfield>
</datafield>
<datafield ind1="0" ind2="0" tag="245">
<subfield code="a">A characterization of Kruskal sharing rules for minimum cost spanning tree problems</subfield>
</datafield>
</record>
<?xml version="1.0" encoding="UTF-8" ?>
<mets ID=" DSpace_ITEM_11093-1100" OBJID=" hdl:11093/1100" PROFILE="DSpace METS SIP Profile 1.0" TYPE="DSpace ITEM" schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd">
<metsHdr CREATEDATE="2023-04-16T19:11:21Z">
<agent ROLE="CUSTODIAN" TYPE="ORGANIZATION">
<name>Investigo</name>
</agent>
</metsHdr>
<dmdSec ID="DMD_11093_1100">
<mdWrap MDTYPE="MODS">
<xmlData schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:mods schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Lorenzo Picado, Leticia</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Lorenzo Freire, Silvia Maria</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2019-01-08T10:12:27Z</mods:dateAccessioned>
</mods:extension>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2019-01-08T10:12:27Z</mods:dateAvailable>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2009-03</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">International Journal of Game Theory, 38(1): 107-126 (2009)</mods:identifier>
<mods:identifier type="issn">0020727614321270</mods:identifier>
<mods:identifier type="uri">http://hdl.handle.net/11093/1100</mods:identifier>
<mods:identifier type="doi">10.1007/s00182-008-0147-0</mods:identifier>
<mods:identifier type="editor">http://link.springer.com/10.1007/s00182-008-0147-0</mods:identifier>
<mods:abstract>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.</mods:abstract>
<mods:language>
<mods:languageTerm authority="rfc3066">eng</mods:languageTerm>
</mods:language>
<mods:titleInfo>
<mods:title>A characterization of Kruskal sharing rules for minimum cost spanning tree problems</mods:title>
</mods:titleInfo>
<mods:genre>article</mods:genre>
</mods:mods>
</xmlData>
</mdWrap>
</dmdSec>
<amdSec ID="TMD_11093_1100">
<rightsMD ID="RIG_11093_1100">
<mdWrap MDTYPE="OTHER" MIMETYPE="text/plain" OTHERMDTYPE="DSpaceDepositLicense">
<binData>TElDRU5DSUEgSU5WRVNUSUdPCgpDb24gb2JqZXRvIGRlIHF1ZSBJbnZlc3RpZ28gcHVlZGEgYXJjaGl2YXIgeSBkaWZ1bmRpciBsb3MgZG9jdW1lbnRvcyBxdWUgc2UgZGVwb3NpdGFuIGVuIMOpbCwgc2UgbmVjZXNpdGEgbGEgYXV0b3JpemFjacOzbiBkZSBsYS9zIGF1dG9yYS9zIG8gYXV0b3IvZXMgZGUgbG9zIGRvY3VtZW50b3MgbWVkaWFudGUgbGEgcHJlc2VudGUgbGljZW5jaWEgZGUgZGlzdHJpYnVjacOzbiBubyBleGNsdXNpdmEgKOKAnExpY2VuY2lhIEludmVzdGlnb+KAnSkuIAoKQWwgb3RvcmdhciBlc3RhIGxpY2VuY2lhLCBsYS9zIGF1dG9yYS9zIG8gYXV0b3IvZXMgZGUgbG9zIGRvY3VtZW50b3MgbWFudGllbmVuIGVuIHN1IHBvZGVyIGxhIHRvdGFsaWRhZCBkZSBsb3MgZGVyZWNob3MgZGUgYXV0b3IsIHB1ZGllbmRvLCBwb3IgdGFudG8sIGhhY2VyIHVzbyBkZWwgdHJhYmFqbyBkZXBvc2l0YWRvIGVuIGxhIGZvcm1hIGVuIHF1ZSBlc3RpbWVuIG9wb3J0dW5vIChkZXBvc2l0YXJsbyBlbiBvdHJvcyByZXBvc2l0b3Jpb3MsIHB1YmxpY2FybG8gZW4gbWVkaW9zIGNvbWVyY2lhbGVzLCBkaWZ1bmRpw6luZG9sbyBlbiBzdSBww6FnaW5hIHdlYiwgZXRjLikuIAoKUG9yIGZhdm9yLCBsZWEgYXRlbnRhbWVudGUgbG9zIHTDqXJtaW5vcyBxdWUgYSBjb250aW51YWNpw7NuIHNlIHNlw7FhbGFuLCBlbiBsb3MgY3VhbGVzIHVzdGVkIHBlcm1pdGUgbyBhdXRvcml6YSBlbCBkZXDDs3NpdG8geSBkaWZ1c2nDs24gZGUgc3UgZG9jdW1lbnRvIGVuIEludmVzdGlnbzoKCkVuIHN1IGNvbmRpY2nDs24gZGUgYXV0b3IvYSBvIHByb3BpZXRhcmlvL2EgZGUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCB1c3RlZDoKCjEuLSBPdG9yZ2EgYSBsYSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBlbCBkZXJlY2hvIG5vIGV4Y2x1c2l2byBhIGFyY2hpdmFyLCByZXByb2R1Y2lyLCBjb252ZXJ0aXIgZW4gbGEgZm9ybWEgcXVlIG3DoXMgYWJham8gc2UgZGVzY3JpYmUsIGNvbXVuaWNhciBvIGRpc3RyaWJ1aXIgdW5pdmVyc2FsbWVudGUgZWwgZG9jdW1lbnRvIGVuIGZvcm1hdG8gZWxlY3Ryw7NuaWNvOwoKMi4tIEF1dG9yaXphIGEgbGEgVW5pdmVyc2lkYWRlIGRlIFZpZ28gYSBjb25zZXJ2YXIgbcOhcyBkZSB1bmEgY29waWEgZGUgc3UgZG9jdW1lbnRvIHkgYSBxdWUsIHNpbiBhbHRlcmFyIHN1IGNvbnRlbmlkbywgbG8gcHVlZGEgY29udmVydGlyIGEgY3VhbHF1aWVyIG90cm8gZm9ybWF0byBkZSBmaWNoZXJvLCBtZWRpbyBvIHNvcG9ydGUsIGNvbiBwcm9ww7NzaXRvcyBkZSBzZWd1cmlkYWQsIHByZXNlcnZhY2nDs24geSBhY2Nlc287IAoKMy4tIE1hbmlmaWVzdGEgcXVlIGVsIGRvY3VtZW50byBkZXBvc2l0YWRvIGVzIHVuIHRyYWJham8gb3JpZ2luYWwgc3V5byB5IHF1ZSBlc3TDoSBsZWdpdGltYWRvIHBhcmEgb3RvcmdhciBsb3MgZGVyZWNob3MgY29udGVuaWRvcyBlbiBsYSBwcmVzZW50ZSBsaWNlbmNpYSBkZSBkaXN0cmlidWNpw7NuLiBEZSBsYSBtaXNtYSBmb3JtYSBkZWNsYXJhIHF1ZSwgZW4gbGEgbWVkaWRhIGRlIGxvIHF1ZSBsZSByZXN1bHRhIHBvc2libGUgY29ub2Nlciwgc3UgZG9jdW1lbnRvIG5vIGluZnJpbmdlIGxvcyBkZXJlY2hvcyBkZSBhdXRvciwgZGUgbmluZ3VuYSBvdHJhIHBlcnNvbmEgbyBlbnRpZGFkOwoKNC4tIEFmaXJtYSBxdWUsIGVuIGVsIGNhc28gZGUgcXVlIHNlIHRyYXRlIGRlIHVuYSBvYnJhIGNvbiBtw6FzIGRlIHVuYSBhdXRvcsOtYSwgbGEgZGVwb3NpdGEgZW4gbm9tYnJlIHkgY29uIGVsIGNvbnNlbnRpbWllbnRvIGRlbCByZXN0byBkZSBjb2F1dG9yZXMgZSBjb2F1dG9yYXM7IAoKNS4tIERlY2xhcmEgcXVlLCBlbiBlbCBjYXNvIGRlIHF1ZSBlbCBkb2N1bWVudG8gY29udGVuZ2EgbWF0ZXJpYWwgZGVsIHF1ZSBubyBwb3NlZSBsb3MgZGVyZWNob3MgZGUgYXV0b3IsIGhhIG9idGVuaWRvIGVsIHBlcm1pc28gZGUgbGEgcGVyc29uYSBwcm9waWV0YXJpYSBkZSB0YWxlcyBkZXJlY2hvcyBwYXJhIG90b3JnYXIgYSBsYSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBsb3MgZGVyZWNob3MgcmVxdWVyaWRvcyBwb3IgZXN0YSBsaWNlbmNpYSwgYXPDrSBjb21vIHF1ZSBlc2UgbWF0ZXJpYWwgY3V5b3MgZGVyZWNob3MgY29ycmVzcG9uZGVuIGEgdGVyY2VyYXMgcGVyc29uYXMgZXN0w6EgY2xhcmFtZW50ZSBpZGVudGlmaWNhZG8geSByZWNvbm9jaWRvIGVuIGVsIHRleHRvIG8gY29udGVuaWRvIGRlbCBkb2N1bWVudG8gZGVwb3NpdGFkbzsgCgo2Li0gUmVjb25vY2UgcXVlIHNpIGVsIGRvY3VtZW50byBzZSBiYXNhIGVuIHRyYWJham9zIHBhdHJvY2luYWRvcyBvIGZpbmFuY2lhZG9zIHBvciB1bmEgb3JnYW5pemFjacOzbiBvIGluc3RpdHVjacOzbiBkaWZlcmVudGUgZGUgbGEgVW5pdmVyc2lkYWRlIGRlIFZpZ28sIGhhIGN1bXBsaWRvIGNvbiBjdWFscXVpZXIgZGVyZWNobyB1IG9ibGlnYWNpw7NuIGVzdGFibGVjaWRhIHBvciBlbCBjb3JyZXNwb25kaWVudGUgY29udHJhdG8gbyBhY3VlcmRvIGNvbiBkaWNoYSBvcmdhbml6YWNpw7NuLgoKCkVuIHZpcnR1ZCBkZSBsYSBwcmVzZW50ZSBsaWNlbmNpYSwgbGEgVW5pdmVyc2lkYWRlIGRlIFZpZ28gc2UgY29tcHJvbWV0ZSBhIGlkZW50aWZpY2FyIGNsYXJhbWVudGUgZWwgbm9tYnJlIGRlIGxhL3MgYXV0b3JhL3MgbyBhdXRvci9lcyBjb21vIHByb3BpZXRhcmlhcy9vcyBkZSBsb3MgZGVyZWNob3MgZGVsIGRvY3VtZW50byBkZXBvc2l0YWRvLCBzaW4gcmVhbGl6YXIgYWx0ZXJhY2nDs24gYWxndW5hIGRlbCBtaXNtbyBleGNlcHRvIGxhcyBwZXJtaXRpZGFzIHBvciBlc3RhIGxpY2VuY2lhLgoKCkxJQ0VOWkEgSU5WRVNUSUdPCgpDbyBvYnhlY3RvIGRlIHF1ZSBJbnZlc3RpZ28gcG9pZGEgYXJxdWl2YXIgZSBkaWZ1bmRpciBvcyBkb2N1bWVudG9zIHF1ZSBzZSBkZXBvc2l0YW4gbmVsLCBuZWNlc8OtdGFzZSBhIGF1dG9yaXphY2nDs24gZGFzIGF1dG9yYXMgb3UgYXV0b3JlcyBkb3MgZG9jdW1lbnRvcyBtZWRpYW50ZSBhIHByZXNlbnRlIGxpY2VuemEgZGUgZGlzdHJpYnVjacOzbiBub24gZXhjbHVzaXZhICjCq0xpY2VuemEgSW52ZXN0aWdvwrspLgoKQW8gb3V0b3JnYXIgZXN0YSBsaWNlbnphLCBhcyBhdXRvcmFzIG91IGF1dG9yZXMgZG9zIGRvY3VtZW50b3MgbWFudGXDsWVuIG5vIHNldSBwb2RlciBhIHRvdGFsaWRhZGUgZG9zIGRlcmVpdG9zIGRlIGF1dG9yIGUgcG9kZW4sIHBvbG8gdGFudG8sIGZhY2VyIHVzbyBkbyB0cmFiYWxsbyBkZXBvc2l0YWRvIG5hIGZvcm1hIGVuIHF1ZSBlc3RpbWUgb3BvcnR1bm8gKGRlcG9zaXRhbG8gbm91dHJvcyByZXBvc2l0b3Jpb3MsIHB1YmxpY2FsbyBlbiBtZWRpb3MgY29tZXJjaWFpcywgZGlmdW5kaWxvIGEgdHJhdsOpcyBkYSBzw7phIHDDoXhpbmEgd2ViLCBldGMuKS4KClBvciBmYXZvciwgbGVhIGF0ZW50YW1lbnRlIG9zIHRlcm1vcyBxdWUgYSBjb250aW51YWNpw7NuIHNlIHNpbmFsYW4sIG5vcyBjYWxlcyB2b3N0ZWRlIHBlcm1pdGUgb3UgYXV0b3JpemEgbyBkZXDDs3NpdG8gZSBkaWZ1c2nDs24gZG8gc2V1IGRvY3VtZW50byBlbiBJbnZlc3RpZ286CgpOYSBzw7phIGNvbmRpY2nDs24gZGUgYXV0b3IvYXV0b3JhIG91IHByb3BpZXRhcmlhL3Byb3BpZXRhcmlvIGRvcyBkZXJlaXRvcyBkZSBhdXRvciwgdm9zdGVkZToKCjEuLSBPdXTDs3JnYWxsZSDDoSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBvIGRlcmVpdG8gbm9uIGV4Y2x1c2l2byBhIGFycXVpdmFyLCByZXByb2R1Y2lyLCBjb252ZXJ0ZXIgbmEgZm9ybWEgcXVlIG3DoWlzIGFiYWl4byBzZSBkZXNjcmliZSwgY29tdW5pY2FyIG91IGRpc3RyaWJ1w61yIHVuaXZlcnNhbG1lbnRlIG8gZG9jdW1lbnRvIGVuIGZvcm1hdG8gZWxlY3Ryw7NuaWNvLgoKMi4tIEF1dG9yw616YWxsZSDDoSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBhIGNvbnNlcnZhciBtw6FpcyBkdW5oYSBjb3BpYSBkbyBzZXUgZG9jdW1lbnRvIGUgYSBxdWUsIHNlbiBhbHRlcmFyIG8gc2V1IGNvbnRpZG8sIG8gcG9pZGEgY29udmVydGVyIGEgY2FscXVlcmEgb3V0cm8gZm9ybWF0byBkZSBmaWNoZWlybywgbWVkaW8gb3Ugc29wb3J0ZSwgY29uIHByb3DDs3NpdG9zIGRlIHNlZ3VyaWRhZGUsIHByZXNlcnZhY2nDs24gZSBhY2Nlc28uCgozLi0gTWFuaWZlc3RhIHF1ZSBvIGRvY3VtZW50byBkZXBvc2l0YWRvIMOpIHVuIHRyYWJhbGxvIG9yaXhpbmFsIHByb3BpbyBlIHF1ZSBlc3TDoSBsZXhpdGltYWRvIHBhcmEgb3V0b3JnYXIgb3MgZGVyZWl0b3MgY29udGlkb3MgbmEgcHJlc2VudGUgbGljZW56YSBkZSBkaXN0cmlidWNpw7NuLiBEYSBtZXNtYSBmb3JtYSBkZWNsYXJhIHF1ZSwgbmEgbWVkaWRhIGRvIHF1ZSBsbGUgcmVzdWx0YSBwb3NpYmxlIGNvw7FlY2VyLCBvIHNldSBkb2N1bWVudG8gbm9uIGluZnJpbnhlIG9zIGRlcmVpdG9zIGRlIGF1dG9yLCBkZSBuaW5ndW5oYSBvdXRyYSBwZXJzb2Egb3UgZW50aWRhZGUuCgo0Li0gQWZpcm1hIHF1ZSwgbm8gY2FzbyBkZSBxdWUgc2UgdHJhdGUgZHVuaGEgb2JyYSBjb24gbcOhaXMgZHVuaGEgYXV0b3LDrWEsIGRlcG9zw610YWEgZW4gbm9tZSBlIGNvIGNvbnNlbnRpbWVudG8gZG8gcmVzdG8gZGUgY29hdXRvcmVzIGUgY29hdXRvcmFzLgoKNS4tIERlY2xhcmEgcXVlLCBubyBjYXNvIGRlIHF1ZSBvIGRvY3VtZW50byBjb250ZcOxYSBtYXRlcmlhbCBkbyBxdWUgbm9uIHBvc8O6ZSBvcyBkZXJlaXRvcyBkZSBhdXRvciwgb2J0aXZvIG8gcGVybWlzbyBkYSBwZXJzb2EgcHJvcGlldGFyaWEgZGUgdGFsZXMgZGVyZWl0b3MgcGFyYSBvdXRvcmdhcmxsZSDDoSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBvcyBkZXJlaXRvcyByZXF1aXJpZG9zIHBvciBlc3RhIGxpY2VuemEsIGFzw60gY29tbyBxdWUgZXNlIG1hdGVyaWFsIGN1eG9zIGRlcmVpdG9zIGNvcnJlc3BvbmRlbiBhIHRlcmNlaXJhcyBwZXJzb2FzIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb8OxZWNpZG8gbm8gdGV4dG8gb3UgY29udGlkbyBkbyBkb2N1bWVudG8gZGVwb3NpdGFkby4KCjYuLSBSZWNvw7FlY2UgcXVlIHNlIG8gZG9jdW1lbnRvIHNlIGJhc2VhIGVuIHRyYWJhbGxvcyBwYXRyb2NpbmFkb3Mgb3UgZmluYW5jaWFkb3MgcG9yIHVuaGEgb3JnYW5pemFjacOzbiBvdSBpbnN0aXR1Y2nDs24gZGlmZXJlbnRlIGRhIFVuaXZlcnNpZGFkZSBkZSBWaWdvLCBjdW1wcml1IGNvbiBjYWxxdWVyYSBkZXJlaXRvIG91IG9icmlnYSBlc3RhYmxlY2lkYSBwb2xvIGNvcnJlc3BvbmRlbnRlIGNvbnRyYXRvIG91IGFjb3JkbyBjb2EgZGV2YW5kaXRhIG9yZ2FuaXphY2nDs24uIAoKCkVuIHZpcnR1ZGUgZGEgcHJlc2VudGUgbGljZW56YSwgYSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBjb21wcm9tw6l0ZXNlIGEgaWRlbnRpZmljYXIgY2xhcmFtZW50ZSBvIG5vbWUgZGFzIGF1dG9yYXMgZSBhdXRvcmVzLCBhc8OtIGNvbW8gZGFzIHByb3BpZXRhcmlhcyBvdSBwcm9waWV0YXJpb3MgZG9zIGRlcmVpdG9zIGRvIGRvY3VtZW50byBkZXBvc2l0YWRvLCBzZW4gcmVhbGl6YXJsbGUgbmluZ3VuaGEgbW9kaWZpY2FjacOzbiBhZ8OhcyBhcyBwZXJtaXRpZGFzIHBvciBlc3RhIGxpY2VuemEuCg==</binData>
</mdWrap>
</rightsMD>
</amdSec>
<amdSec ID="FO_11093_1100_1">
<techMD ID="TECH_O_11093_1100_1">
<mdWrap MDTYPE="PREMIS">
<xmlData schemaLocation="http://www.loc.gov/standards/premis http://www.loc.gov/standards/premis/PREMIS-v1-0.xsd">
<premis:premis>
<premis:object>
<premis:objectIdentifier>
<premis:objectIdentifierType>URL</premis:objectIdentifierType>
<premis:objectIdentifierValue>https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/1/obl_mon_add_IJGT5.pdf</premis:objectIdentifierValue>
</premis:objectIdentifier>
<premis:objectCategory>File</premis:objectCategory>
<premis:objectCharacteristics>
<premis:fixity>
<premis:messageDigestAlgorithm>MD5</premis:messageDigestAlgorithm>
<premis:messageDigest>4e9fee6ce5da87f3cf1410b6ad99e4fc</premis:messageDigest>
</premis:fixity>
<premis:size>195678</premis:size>
<premis:format>
<premis:formatDesignation>
<premis:formatName>application/pdf</premis:formatName>
</premis:formatDesignation>
</premis:format>
</premis:objectCharacteristics>
<premis:originalName>obl_mon_add_IJGT5.pdf</premis:originalName>
</premis:object>
</premis:premis>
</xmlData>
</mdWrap>
</techMD>
</amdSec>
<amdSec ID="FT_11093_1100_4">
<techMD ID="TECH_T_11093_1100_4">
<mdWrap MDTYPE="PREMIS">
<xmlData schemaLocation="http://www.loc.gov/standards/premis http://www.loc.gov/standards/premis/PREMIS-v1-0.xsd">
<premis:premis>
<premis:object>
<premis:objectIdentifier>
<premis:objectIdentifierType>URL</premis:objectIdentifierType>
<premis:objectIdentifierValue>https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/4/obl_mon_add_IJGT5.pdf.txt</premis:objectIdentifierValue>
</premis:objectIdentifier>
<premis:objectCategory>File</premis:objectCategory>
<premis:objectCharacteristics>
<premis:fixity>
<premis:messageDigestAlgorithm>MD5</premis:messageDigestAlgorithm>
<premis:messageDigest>854af4b199f6bea38b3e130e0b696220</premis:messageDigest>
</premis:fixity>
<premis:size>42340</premis:size>
<premis:format>
<premis:formatDesignation>
<premis:formatName>text/plain</premis:formatName>
</premis:formatDesignation>
</premis:format>
</premis:objectCharacteristics>
<premis:originalName>obl_mon_add_IJGT5.pdf.txt</premis:originalName>
</premis:object>
</premis:premis>
</xmlData>
</mdWrap>
</techMD>
</amdSec>
<fileSec>
<fileGrp USE="ORIGINAL">
<file ADMID="FO_11093_1100_1" CHECKSUM="4e9fee6ce5da87f3cf1410b6ad99e4fc" CHECKSUMTYPE="MD5" GROUPID="GROUP_BITSTREAM_11093_1100_1" ID="BITSTREAM_ORIGINAL_11093_1100_1" MIMETYPE="application/pdf" SEQ="1" SIZE="195678">
</file>
</fileGrp>
<fileGrp USE="TEXT">
<file ADMID="FT_11093_1100_4" CHECKSUM="854af4b199f6bea38b3e130e0b696220" CHECKSUMTYPE="MD5" GROUPID="GROUP_BITSTREAM_11093_1100_4" ID="BITSTREAM_TEXT_11093_1100_4" MIMETYPE="text/plain" SEQ="4" SIZE="42340">
</file>
</fileGrp>
</fileSec>
<structMap LABEL="DSpace Object" TYPE="LOGICAL">
<div ADMID="DMD_11093_1100" TYPE="DSpace Object Contents">
<div TYPE="DSpace BITSTREAM">
</div>
</div>
</structMap>
</mets>
<?xml version="1.0" encoding="UTF-8" ?>
<mods:mods schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:namePart>Lorenzo Picado, Leticia</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Lorenzo Freire, Silvia Maria</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2019-01-08T10:12:27Z</mods:dateAvailable>
</mods:extension>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2019-01-08T10:12:27Z</mods:dateAccessioned>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2009-03</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">International Journal of Game Theory, 38(1): 107-126 (2009)</mods:identifier>
<mods:identifier type="issn">00207276</mods:identifier>
<mods:identifier type="issn">14321270</mods:identifier>
<mods:identifier type="uri">http://hdl.handle.net/11093/1100</mods:identifier>
<mods:identifier type="doi">10.1007/s00182-008-0147-0</mods:identifier>
<mods:identifier type="editor">http://link.springer.com/10.1007/s00182-008-0147-0</mods:identifier>
<mods:abstract>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.</mods:abstract>
<mods:language>
<mods:languageTerm>eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">openAccess</mods:accessCondition>
<mods:titleInfo>
<mods:title>A characterization of Kruskal sharing rules for minimum cost spanning tree problems</mods:title>
</mods:titleInfo>
<mods:genre>article</mods:genre>
</mods:mods>
<?xml version="1.0" encoding="UTF-8" ?>
<atom:entry schemaLocation="http://www.w3.org/2005/Atom http://www.kbcafe.com/rss/atom.xsd.xml">
<atom:id>http://hdl.handle.net/11093/1100/ore.xml</atom:id>
<atom:published>2019-01-08T10:12:27Z</atom:published>
<atom:updated>2019-01-08T10:12:27Z</atom:updated>
<atom:source>
<atom:generator>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://hdl.handle.net/11093/1100/ore.xml#atom">
<dcterms:modified>2019-01-08T10:12:27Z</dcterms:modified>
</rdf:Description>
<rdf:Description about="https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/4/obl_mon_add_IJGT5.pdf.txt">
<dcterms:description>TEXT</dcterms:description>
</rdf:Description>
<rdf:Description about="https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/1/obl_mon_add_IJGT5.pdf">
<dcterms:description>ORIGINAL</dcterms:description>
</rdf:Description>
<rdf:Description about="https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/2/license.txt">
<dcterms:description>LICENSE</dcterms:description>
</rdf:Description>
<rdf:Description about="https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/3/sword.zip">
<dcterms:description>SWORD</dcterms:description>
</rdf:Description>
</oreatom:triples>
</atom:entry>
<?xml version="1.0" encoding="UTF-8" ?>
<qdc:qualifieddc 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>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>
<dcterms:abstract>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.</dcterms:abstract>
<dcterms:dateAccepted>2019-01-08T10:12:27Z</dcterms:dateAccepted>
<dcterms:available>2019-01-08T10:12:27Z</dcterms:available>
<dcterms:created>2019-01-08T10:12:27Z</dcterms:created>
<dcterms:issued>2009-03</dcterms:issued>
<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>
<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>
</qdc:qualifieddc>
<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication about="oai:www.investigo.biblioteca.uvigo.es:11093/1100">
<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: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: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>
<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>
</ow:Publication>
</rdf:RDF>
<?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">
<dcterms:dateAccepted>2019-01-08T10:12:27Z</dcterms:dateAccepted>
<dcterms:available>2019-01-08T10:12:27Z</dcterms:available>
<dcterms:issued>2009-03</dcterms:issued>
<dcterms:identifier_bibliographicCitation lang="spa">International Journal of Game Theory, 38(1): 107-126 (2009)</dcterms:identifier_bibliographicCitation>
<dcterms:identifier_issn>00207276</dcterms:identifier_issn>
<dcterms:identifier_issn>14321270</dcterms:identifier_issn>
<dcterms:identifier_doi>10.1007/s00182-008-0147-0</dcterms:identifier_doi>
<dcterms:identifier type="dcterms:URI">http://hdl.handle.net/11093/1100</dcterms:identifier>
<dcterms:identifier_editor lang="spa">http://link.springer.com/10.1007/s00182-008-0147-0</dcterms:identifier_editor>
<dcterms:abstract lang="spa">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.</dcterms:abstract>
<dcterms:description_sponsorship lang="spa">Ministerio de Ciencia y Tecnología y FEDER | Ref. SEJ2005-07637-C02-01</dcterms:description_sponsorship>
<dcterms:description_sponsorship lang="spa">Xunta de Galicia | Ref. PGIDIT06PXIB362390PR</dcterms:description_sponsorship>
<dcterms:description_sponsorship lang="spa">Xunta de Galicia | Ref. PGIDIT06PXIC300184PN</dcterms:description_sponsorship>
<dcterms:language type="dcterms:ISO639-2" lang="spa">eng</dcterms:language>
<dcterms:publisher lang="spa">International Journal of Game Theory</dcterms:publisher>
<dcterms:accessRights lang="spa">openAccess</dcterms:accessRights>
<dcterms:title lang="spa">A characterization of Kruskal sharing rules for minimum cost spanning tree problems</dcterms:title>
<dcterms:type lang="spa">article</dcterms:type>
<dcterms:computerCitation lang="spa">pub_title=International Journal of Game Theory|volume=38|journal_number=1|start_pag=107|end_pag=126</dcterms:computerCitation>
<dcterms:publisher_department lang="spa">Estatística e investigación operativa</dcterms:publisher_department>
<dcterms:publisher_group lang="spa">Research Group In Economic Analysis</dcterms:publisher_group>
<dcterms:subject lang="spa">5399 Otras Especialidades económicas</dcterms:subject>
<dcterms:authorList>3720#4775</dcterms:authorList>
</oai_dc:dc>
<?xml version="1.0" encoding="UTF-8" ?>
<metadata schemaLocation="http://www.lyncode.com/xoai http://www.lyncode.com/xsd/xoai.xsd">
<element name="dc">
<element name="contributor">
<element name="author">
<element name="none">
<field name="value">Lorenzo Picado, Leticia</field>
<field name="authority">3720</field>
<field name="confidence">500</field>
<field name="value">Lorenzo Freire, Silvia Maria</field>
<field name="authority">4775</field>
<field name="confidence">500</field>
</element>
</element>
</element>
<element name="date">
<element name="accessioned">
<element name="none">
<field name="value">2019-01-08T10:12:27Z</field>
</element>
</element>
<element name="available">
<element name="none">
<field name="value">2019-01-08T10:12:27Z</field>
</element>
</element>
<element name="issued">
<element name="none">
<field name="value">2009-03</field>
</element>
</element>
<element name="updated">
<element name="none">
<field name="value">2019-01-08T10:04:23Z</field>
</element>
</element>
</element>
<element name="identifier">
<element name="citation">
<element name="spa">
<field name="value">International Journal of Game Theory, 38(1): 107-126 (2009)</field>
</element>
</element>
<element name="issn">
<element name="none">
<field name="value">00207276</field>
<field name="value">14321270</field>
</element>
</element>
<element name="uri">
<element name="none">
<field name="value">http://hdl.handle.net/11093/1100</field>
</element>
</element>
<element name="doi">
<element name="none">
<field name="value">10.1007/s00182-008-0147-0</field>
</element>
</element>
<element name="editor">
<element name="spa">
<field name="value">http://link.springer.com/10.1007/s00182-008-0147-0</field>
</element>
</element>
</element>
<element name="description">
<element name="abstract">
<element name="spa">
<field name="value">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.</field>
</element>
</element>
<element name="sponsorship">
<element name="spa">
<field name="value">Ministerio de Ciencia y Tecnología y FEDER | Ref. SEJ2005-07637-C02-01</field>
<field name="value">Xunta de Galicia | Ref. PGIDIT06PXIB362390PR</field>
<field name="value">Xunta de Galicia | Ref. PGIDIT06PXIC300184PN</field>
</element>
</element>
</element>
<element name="language">
<element name="iso">
<element name="spa">
<field name="value">eng</field>
</element>
</element>
</element>
<element name="publisher">
<element name="spa">
<field name="value">International Journal of Game Theory</field>
</element>
<element name="departamento">
<element name="spa">
<field name="value">Estatística e investigación operativa</field>
</element>
</element>
<element name="grupoinvestigacion">
<element name="spa">
<field name="value">Research Group In Economic Analysis</field>
</element>
</element>
</element>
<element name="title">
<element name="spa">
<field name="value">A characterization of Kruskal sharing rules for minimum cost spanning tree problems</field>
</element>
</element>
<element name="type">
<element name="spa">
<field name="value">article</field>
</element>
</element>
<element name="rights">
<element name="accessRights">
<element name="spa">
<field name="value">openAccess</field>
</element>
</element>
</element>
<element name="subject">
<element name="unesco">
<element name="spa">
<field name="value">5399 Otras Especialidades económicas</field>
</element>
</element>
</element>
<element name="computerCitation">
<element name="spa">
<field name="value">pub_title=International Journal of Game Theory|volume=38|journal_number=1|start_pag=107|end_pag=126</field>
</element>
</element>
</element>
<element name="bundles">
<element name="bundle">
<field name="name">TEXT</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">obl_mon_add_IJGT5.pdf.txt</field>
<field name="originalName">obl_mon_add_IJGT5.pdf.txt</field>
<field name="description">Extracted text</field>
<field name="format">text/plain</field>
<field name="size">42340</field>
<field name="url">https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/4/obl_mon_add_IJGT5.pdf.txt</field>
<field name="checksum">854af4b199f6bea38b3e130e0b696220</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">4</field>
<field name="drm">open access</field>
</element>
</element>
</element>
<element name="bundle">
<field name="name">ORIGINAL</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">obl_mon_add_IJGT5.pdf</field>
<field name="format">application/pdf</field>
<field name="size">195678</field>
<field name="url">https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/1/obl_mon_add_IJGT5.pdf</field>
<field name="checksum">4e9fee6ce5da87f3cf1410b6ad99e4fc</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">1</field>
<field name="drm">open access</field>
</element>
</element>
</element>
<element name="bundle">
<field name="name">LICENSE</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">license.txt</field>
<field name="originalName">license.txt</field>
<field name="format">text/plain; charset=utf-8</field>
<field name="size">5578</field>
<field name="url">https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/2/license.txt</field>
<field name="checksum">26a4b4a1659859ce48ba35d3383bbbc4</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">2</field>
<field name="drm">open access</field>
</element>
</element>
</element>
<element name="bundle">
<field name="name">SWORD</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">sword.zip</field>
<field name="description">SWORD deposit package</field>
<field name="format">application/zip</field>
<field name="size">170733</field>
<field name="url">https://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/11093/1100/3/sword.zip</field>
<field name="checksum">ec7864c2d007baf17489247f0e72b34b</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">3</field>
<field name="drm">open access</field>
</element>
</element>
</element>
</element>
<element name="others">
<field name="handle">11093/1100</field>
<field name="identifier">oai:www.investigo.biblioteca.uvigo.es:11093/1100</field>
<field name="lastModifyDate">2023-04-11 04:01:53.198</field>
<field name="drm">open access</field>
</element>
<element name="repository">
<field name="name">Investigo</field>
<field name="mail">investigo@uvigo.es</field>
</element>
<element name="license">
<field name="bin">TElDRU5DSUEgSU5WRVNUSUdPCgpDb24gb2JqZXRvIGRlIHF1ZSBJbnZlc3RpZ28gcHVlZGEgYXJjaGl2YXIgeSBkaWZ1bmRpciBsb3MgZG9jdW1lbnRvcyBxdWUgc2UgZGVwb3NpdGFuIGVuIMOpbCwgc2UgbmVjZXNpdGEgbGEgYXV0b3JpemFjacOzbiBkZSBsYS9zIGF1dG9yYS9zIG8gYXV0b3IvZXMgZGUgbG9zIGRvY3VtZW50b3MgbWVkaWFudGUgbGEgcHJlc2VudGUgbGljZW5jaWEgZGUgZGlzdHJpYnVjacOzbiBubyBleGNsdXNpdmEgKOKAnExpY2VuY2lhIEludmVzdGlnb+KAnSkuIAoKQWwgb3RvcmdhciBlc3RhIGxpY2VuY2lhLCBsYS9zIGF1dG9yYS9zIG8gYXV0b3IvZXMgZGUgbG9zIGRvY3VtZW50b3MgbWFudGllbmVuIGVuIHN1IHBvZGVyIGxhIHRvdGFsaWRhZCBkZSBsb3MgZGVyZWNob3MgZGUgYXV0b3IsIHB1ZGllbmRvLCBwb3IgdGFudG8sIGhhY2VyIHVzbyBkZWwgdHJhYmFqbyBkZXBvc2l0YWRvIGVuIGxhIGZvcm1hIGVuIHF1ZSBlc3RpbWVuIG9wb3J0dW5vIChkZXBvc2l0YXJsbyBlbiBvdHJvcyByZXBvc2l0b3Jpb3MsIHB1YmxpY2FybG8gZW4gbWVkaW9zIGNvbWVyY2lhbGVzLCBkaWZ1bmRpw6luZG9sbyBlbiBzdSBww6FnaW5hIHdlYiwgZXRjLikuIAoKUG9yIGZhdm9yLCBsZWEgYXRlbnRhbWVudGUgbG9zIHTDqXJtaW5vcyBxdWUgYSBjb250aW51YWNpw7NuIHNlIHNlw7FhbGFuLCBlbiBsb3MgY3VhbGVzIHVzdGVkIHBlcm1pdGUgbyBhdXRvcml6YSBlbCBkZXDDs3NpdG8geSBkaWZ1c2nDs24gZGUgc3UgZG9jdW1lbnRvIGVuIEludmVzdGlnbzoKCkVuIHN1IGNvbmRpY2nDs24gZGUgYXV0b3IvYSBvIHByb3BpZXRhcmlvL2EgZGUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCB1c3RlZDoKCjEuLSBPdG9yZ2EgYSBsYSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBlbCBkZXJlY2hvIG5vIGV4Y2x1c2l2byBhIGFyY2hpdmFyLCByZXByb2R1Y2lyLCBjb252ZXJ0aXIgZW4gbGEgZm9ybWEgcXVlIG3DoXMgYWJham8gc2UgZGVzY3JpYmUsIGNvbXVuaWNhciBvIGRpc3RyaWJ1aXIgdW5pdmVyc2FsbWVudGUgZWwgZG9jdW1lbnRvIGVuIGZvcm1hdG8gZWxlY3Ryw7NuaWNvOwoKMi4tIEF1dG9yaXphIGEgbGEgVW5pdmVyc2lkYWRlIGRlIFZpZ28gYSBjb25zZXJ2YXIgbcOhcyBkZSB1bmEgY29waWEgZGUgc3UgZG9jdW1lbnRvIHkgYSBxdWUsIHNpbiBhbHRlcmFyIHN1IGNvbnRlbmlkbywgbG8gcHVlZGEgY29udmVydGlyIGEgY3VhbHF1aWVyIG90cm8gZm9ybWF0byBkZSBmaWNoZXJvLCBtZWRpbyBvIHNvcG9ydGUsIGNvbiBwcm9ww7NzaXRvcyBkZSBzZWd1cmlkYWQsIHByZXNlcnZhY2nDs24geSBhY2Nlc287IAoKMy4tIE1hbmlmaWVzdGEgcXVlIGVsIGRvY3VtZW50byBkZXBvc2l0YWRvIGVzIHVuIHRyYWJham8gb3JpZ2luYWwgc3V5byB5IHF1ZSBlc3TDoSBsZWdpdGltYWRvIHBhcmEgb3RvcmdhciBsb3MgZGVyZWNob3MgY29udGVuaWRvcyBlbiBsYSBwcmVzZW50ZSBsaWNlbmNpYSBkZSBkaXN0cmlidWNpw7NuLiBEZSBsYSBtaXNtYSBmb3JtYSBkZWNsYXJhIHF1ZSwgZW4gbGEgbWVkaWRhIGRlIGxvIHF1ZSBsZSByZXN1bHRhIHBvc2libGUgY29ub2Nlciwgc3UgZG9jdW1lbnRvIG5vIGluZnJpbmdlIGxvcyBkZXJlY2hvcyBkZSBhdXRvciwgZGUgbmluZ3VuYSBvdHJhIHBlcnNvbmEgbyBlbnRpZGFkOwoKNC4tIEFmaXJtYSBxdWUsIGVuIGVsIGNhc28gZGUgcXVlIHNlIHRyYXRlIGRlIHVuYSBvYnJhIGNvbiBtw6FzIGRlIHVuYSBhdXRvcsOtYSwgbGEgZGVwb3NpdGEgZW4gbm9tYnJlIHkgY29uIGVsIGNvbnNlbnRpbWllbnRvIGRlbCByZXN0byBkZSBjb2F1dG9yZXMgZSBjb2F1dG9yYXM7IAoKNS4tIERlY2xhcmEgcXVlLCBlbiBlbCBjYXNvIGRlIHF1ZSBlbCBkb2N1bWVudG8gY29udGVuZ2EgbWF0ZXJpYWwgZGVsIHF1ZSBubyBwb3NlZSBsb3MgZGVyZWNob3MgZGUgYXV0b3IsIGhhIG9idGVuaWRvIGVsIHBlcm1pc28gZGUgbGEgcGVyc29uYSBwcm9waWV0YXJpYSBkZSB0YWxlcyBkZXJlY2hvcyBwYXJhIG90b3JnYXIgYSBsYSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBsb3MgZGVyZWNob3MgcmVxdWVyaWRvcyBwb3IgZXN0YSBsaWNlbmNpYSwgYXPDrSBjb21vIHF1ZSBlc2UgbWF0ZXJpYWwgY3V5b3MgZGVyZWNob3MgY29ycmVzcG9uZGVuIGEgdGVyY2VyYXMgcGVyc29uYXMgZXN0w6EgY2xhcmFtZW50ZSBpZGVudGlmaWNhZG8geSByZWNvbm9jaWRvIGVuIGVsIHRleHRvIG8gY29udGVuaWRvIGRlbCBkb2N1bWVudG8gZGVwb3NpdGFkbzsgCgo2Li0gUmVjb25vY2UgcXVlIHNpIGVsIGRvY3VtZW50byBzZSBiYXNhIGVuIHRyYWJham9zIHBhdHJvY2luYWRvcyBvIGZpbmFuY2lhZG9zIHBvciB1bmEgb3JnYW5pemFjacOzbiBvIGluc3RpdHVjacOzbiBkaWZlcmVudGUgZGUgbGEgVW5pdmVyc2lkYWRlIGRlIFZpZ28sIGhhIGN1bXBsaWRvIGNvbiBjdWFscXVpZXIgZGVyZWNobyB1IG9ibGlnYWNpw7NuIGVzdGFibGVjaWRhIHBvciBlbCBjb3JyZXNwb25kaWVudGUgY29udHJhdG8gbyBhY3VlcmRvIGNvbiBkaWNoYSBvcmdhbml6YWNpw7NuLgoKCkVuIHZpcnR1ZCBkZSBsYSBwcmVzZW50ZSBsaWNlbmNpYSwgbGEgVW5pdmVyc2lkYWRlIGRlIFZpZ28gc2UgY29tcHJvbWV0ZSBhIGlkZW50aWZpY2FyIGNsYXJhbWVudGUgZWwgbm9tYnJlIGRlIGxhL3MgYXV0b3JhL3MgbyBhdXRvci9lcyBjb21vIHByb3BpZXRhcmlhcy9vcyBkZSBsb3MgZGVyZWNob3MgZGVsIGRvY3VtZW50byBkZXBvc2l0YWRvLCBzaW4gcmVhbGl6YXIgYWx0ZXJhY2nDs24gYWxndW5hIGRlbCBtaXNtbyBleGNlcHRvIGxhcyBwZXJtaXRpZGFzIHBvciBlc3RhIGxpY2VuY2lhLgoKCkxJQ0VOWkEgSU5WRVNUSUdPCgpDbyBvYnhlY3RvIGRlIHF1ZSBJbnZlc3RpZ28gcG9pZGEgYXJxdWl2YXIgZSBkaWZ1bmRpciBvcyBkb2N1bWVudG9zIHF1ZSBzZSBkZXBvc2l0YW4gbmVsLCBuZWNlc8OtdGFzZSBhIGF1dG9yaXphY2nDs24gZGFzIGF1dG9yYXMgb3UgYXV0b3JlcyBkb3MgZG9jdW1lbnRvcyBtZWRpYW50ZSBhIHByZXNlbnRlIGxpY2VuemEgZGUgZGlzdHJpYnVjacOzbiBub24gZXhjbHVzaXZhICjCq0xpY2VuemEgSW52ZXN0aWdvwrspLgoKQW8gb3V0b3JnYXIgZXN0YSBsaWNlbnphLCBhcyBhdXRvcmFzIG91IGF1dG9yZXMgZG9zIGRvY3VtZW50b3MgbWFudGXDsWVuIG5vIHNldSBwb2RlciBhIHRvdGFsaWRhZGUgZG9zIGRlcmVpdG9zIGRlIGF1dG9yIGUgcG9kZW4sIHBvbG8gdGFudG8sIGZhY2VyIHVzbyBkbyB0cmFiYWxsbyBkZXBvc2l0YWRvIG5hIGZvcm1hIGVuIHF1ZSBlc3RpbWUgb3BvcnR1bm8gKGRlcG9zaXRhbG8gbm91dHJvcyByZXBvc2l0b3Jpb3MsIHB1YmxpY2FsbyBlbiBtZWRpb3MgY29tZXJjaWFpcywgZGlmdW5kaWxvIGEgdHJhdsOpcyBkYSBzw7phIHDDoXhpbmEgd2ViLCBldGMuKS4KClBvciBmYXZvciwgbGVhIGF0ZW50YW1lbnRlIG9zIHRlcm1vcyBxdWUgYSBjb250aW51YWNpw7NuIHNlIHNpbmFsYW4sIG5vcyBjYWxlcyB2b3N0ZWRlIHBlcm1pdGUgb3UgYXV0b3JpemEgbyBkZXDDs3NpdG8gZSBkaWZ1c2nDs24gZG8gc2V1IGRvY3VtZW50byBlbiBJbnZlc3RpZ286CgpOYSBzw7phIGNvbmRpY2nDs24gZGUgYXV0b3IvYXV0b3JhIG91IHByb3BpZXRhcmlhL3Byb3BpZXRhcmlvIGRvcyBkZXJlaXRvcyBkZSBhdXRvciwgdm9zdGVkZToKCjEuLSBPdXTDs3JnYWxsZSDDoSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBvIGRlcmVpdG8gbm9uIGV4Y2x1c2l2byBhIGFycXVpdmFyLCByZXByb2R1Y2lyLCBjb252ZXJ0ZXIgbmEgZm9ybWEgcXVlIG3DoWlzIGFiYWl4byBzZSBkZXNjcmliZSwgY29tdW5pY2FyIG91IGRpc3RyaWJ1w61yIHVuaXZlcnNhbG1lbnRlIG8gZG9jdW1lbnRvIGVuIGZvcm1hdG8gZWxlY3Ryw7NuaWNvLgoKMi4tIEF1dG9yw616YWxsZSDDoSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBhIGNvbnNlcnZhciBtw6FpcyBkdW5oYSBjb3BpYSBkbyBzZXUgZG9jdW1lbnRvIGUgYSBxdWUsIHNlbiBhbHRlcmFyIG8gc2V1IGNvbnRpZG8sIG8gcG9pZGEgY29udmVydGVyIGEgY2FscXVlcmEgb3V0cm8gZm9ybWF0byBkZSBmaWNoZWlybywgbWVkaW8gb3Ugc29wb3J0ZSwgY29uIHByb3DDs3NpdG9zIGRlIHNlZ3VyaWRhZGUsIHByZXNlcnZhY2nDs24gZSBhY2Nlc28uCgozLi0gTWFuaWZlc3RhIHF1ZSBvIGRvY3VtZW50byBkZXBvc2l0YWRvIMOpIHVuIHRyYWJhbGxvIG9yaXhpbmFsIHByb3BpbyBlIHF1ZSBlc3TDoSBsZXhpdGltYWRvIHBhcmEgb3V0b3JnYXIgb3MgZGVyZWl0b3MgY29udGlkb3MgbmEgcHJlc2VudGUgbGljZW56YSBkZSBkaXN0cmlidWNpw7NuLiBEYSBtZXNtYSBmb3JtYSBkZWNsYXJhIHF1ZSwgbmEgbWVkaWRhIGRvIHF1ZSBsbGUgcmVzdWx0YSBwb3NpYmxlIGNvw7FlY2VyLCBvIHNldSBkb2N1bWVudG8gbm9uIGluZnJpbnhlIG9zIGRlcmVpdG9zIGRlIGF1dG9yLCBkZSBuaW5ndW5oYSBvdXRyYSBwZXJzb2Egb3UgZW50aWRhZGUuCgo0Li0gQWZpcm1hIHF1ZSwgbm8gY2FzbyBkZSBxdWUgc2UgdHJhdGUgZHVuaGEgb2JyYSBjb24gbcOhaXMgZHVuaGEgYXV0b3LDrWEsIGRlcG9zw610YWEgZW4gbm9tZSBlIGNvIGNvbnNlbnRpbWVudG8gZG8gcmVzdG8gZGUgY29hdXRvcmVzIGUgY29hdXRvcmFzLgoKNS4tIERlY2xhcmEgcXVlLCBubyBjYXNvIGRlIHF1ZSBvIGRvY3VtZW50byBjb250ZcOxYSBtYXRlcmlhbCBkbyBxdWUgbm9uIHBvc8O6ZSBvcyBkZXJlaXRvcyBkZSBhdXRvciwgb2J0aXZvIG8gcGVybWlzbyBkYSBwZXJzb2EgcHJvcGlldGFyaWEgZGUgdGFsZXMgZGVyZWl0b3MgcGFyYSBvdXRvcmdhcmxsZSDDoSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBvcyBkZXJlaXRvcyByZXF1aXJpZG9zIHBvciBlc3RhIGxpY2VuemEsIGFzw60gY29tbyBxdWUgZXNlIG1hdGVyaWFsIGN1eG9zIGRlcmVpdG9zIGNvcnJlc3BvbmRlbiBhIHRlcmNlaXJhcyBwZXJzb2FzIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb8OxZWNpZG8gbm8gdGV4dG8gb3UgY29udGlkbyBkbyBkb2N1bWVudG8gZGVwb3NpdGFkby4KCjYuLSBSZWNvw7FlY2UgcXVlIHNlIG8gZG9jdW1lbnRvIHNlIGJhc2VhIGVuIHRyYWJhbGxvcyBwYXRyb2NpbmFkb3Mgb3UgZmluYW5jaWFkb3MgcG9yIHVuaGEgb3JnYW5pemFjacOzbiBvdSBpbnN0aXR1Y2nDs24gZGlmZXJlbnRlIGRhIFVuaXZlcnNpZGFkZSBkZSBWaWdvLCBjdW1wcml1IGNvbiBjYWxxdWVyYSBkZXJlaXRvIG91IG9icmlnYSBlc3RhYmxlY2lkYSBwb2xvIGNvcnJlc3BvbmRlbnRlIGNvbnRyYXRvIG91IGFjb3JkbyBjb2EgZGV2YW5kaXRhIG9yZ2FuaXphY2nDs24uIAoKCkVuIHZpcnR1ZGUgZGEgcHJlc2VudGUgbGljZW56YSwgYSBVbml2ZXJzaWRhZGUgZGUgVmlnbyBjb21wcm9tw6l0ZXNlIGEgaWRlbnRpZmljYXIgY2xhcmFtZW50ZSBvIG5vbWUgZGFzIGF1dG9yYXMgZSBhdXRvcmVzLCBhc8OtIGNvbW8gZGFzIHByb3BpZXRhcmlhcyBvdSBwcm9waWV0YXJpb3MgZG9zIGRlcmVpdG9zIGRvIGRvY3VtZW50byBkZXBvc2l0YWRvLCBzZW4gcmVhbGl6YXJsbGUgbmluZ3VuaGEgbW9kaWZpY2FjacOzbiBhZ8OhcyBhcyBwZXJtaXRpZGFzIHBvciBlc3RhIGxpY2VuemEuCg==</field>
</element>
</metadata>