Approximate stable solutions in infinite tree problems

Joaquín Sanchez-Soriano; Vito Fragnelli; Natividad Llorca; Stef Tijs

doi:10.1080/02331930902971369

Approximate stable solutions in infinite tree problems

Joaquín Sanchez-Soriano
, Vito Fragnelli
, Natividad Llorca
, Stef Tijs

Research output: Contribution to journal › Article › peer-review

Abstract

In this article infinite minimum cost spanning tree situations and related TU-games are studied. Since an optimal tree for these situations does not always exist, it is impossible in such situations to implement core solutions based on a particular tree. Therefore, we study core-like solutions and deal with three cases concerning the total cost of connection: when it is zero, when it is finite but larger than zero, and when it is infinite.

Original language	English
Pages (from-to)	1123-1137
Number of pages	15
Journal	Optimization
Volume	59
Issue number	8
DOIs	https://doi.org/10.1080/02331930902971369
Publication status	Published - 2010
Externally published	Yes

Keywords

Core-like solutions
Countable infinite number of players
Spanning trees

Access to Document

10.1080/02331930902971369

Cite this

@article{df8b5eb0898e48d395d12a48bf8f6de9,

title = "Approximate stable solutions in infinite tree problems",

abstract = "In this article infinite minimum cost spanning tree situations and related TU-games are studied. Since an optimal tree for these situations does not always exist, it is impossible in such situations to implement core solutions based on a particular tree. Therefore, we study core-like solutions and deal with three cases concerning the total cost of connection: when it is zero, when it is finite but larger than zero, and when it is infinite.",

keywords = "Core-like solutions, Countable infinite number of players, Spanning trees",

author = "Joaqu{\'i}n Sanchez-Soriano and Vito Fragnelli and Natividad Llorca and Stef Tijs",

note = "Funding Information: We are grateful to an anonymous refree for her/his useful comments. We thank Rodica Branzei for her helpful comments and valuable suggestions that have substantially improved this article. This research has been partially supported by MIUR through grant IT1114. Financial support from the Government of Spain and FEDER, under projects MTM2005-09184-C02-02 and MTM2008-06778-C02-01 is gratefully acknowledged.",

year = "2010",

doi = "10.1080/02331930902971369",

language = "English",

volume = "59",

pages = "1123--1137",

journal = "Optimization",

issn = "0233-1934",

publisher = "Taylor and Francis Ltd.",

number = "8",

}

TY - JOUR

T1 - Approximate stable solutions in infinite tree problems

AU - Sanchez-Soriano, Joaquín

AU - Fragnelli, Vito

AU - Llorca, Natividad

AU - Tijs, Stef

N1 - Funding Information: We are grateful to an anonymous refree for her/his useful comments. We thank Rodica Branzei for her helpful comments and valuable suggestions that have substantially improved this article. This research has been partially supported by MIUR through grant IT1114. Financial support from the Government of Spain and FEDER, under projects MTM2005-09184-C02-02 and MTM2008-06778-C02-01 is gratefully acknowledged.

PY - 2010

Y1 - 2010

N2 - In this article infinite minimum cost spanning tree situations and related TU-games are studied. Since an optimal tree for these situations does not always exist, it is impossible in such situations to implement core solutions based on a particular tree. Therefore, we study core-like solutions and deal with three cases concerning the total cost of connection: when it is zero, when it is finite but larger than zero, and when it is infinite.

AB - In this article infinite minimum cost spanning tree situations and related TU-games are studied. Since an optimal tree for these situations does not always exist, it is impossible in such situations to implement core solutions based on a particular tree. Therefore, we study core-like solutions and deal with three cases concerning the total cost of connection: when it is zero, when it is finite but larger than zero, and when it is infinite.

KW - Core-like solutions

KW - Countable infinite number of players

KW - Spanning trees

UR - https://www.scopus.com/pages/publications/77958456870

U2 - 10.1080/02331930902971369

DO - 10.1080/02331930902971369

M3 - Article

SN - 0233-1934

VL - 59

SP - 1123

EP - 1137

JO - Optimization

JF - Optimization

IS - 8

ER -

Approximate stable solutions in infinite tree problems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this