A graph theoretical model for the total balancedness of combinatorial optimization games

Autores
Escalante, Mariana Silvina; Leoni, Valeria Alejandra; Nasini, Graciela Leonor
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzen’s characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games.
Fil: Escalante, Mariana Silvina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Materia
PACKING
COVERING
GRAPH MODEL
TOTALLY BALANCED GAME
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/268611
Acceder
id CONICETDig_5ea1e9ce558adf9ff0753bf94448ee14
oai_identifier_str oai:ri.conicet.gov.ar:11336/268611
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A graph theoretical model for the total balancedness of combinatorial optimization gamesEscalante, Mariana SilvinaLeoni, Valeria AlejandraNasini, Graciela LeonorPACKINGCOVERINGGRAPH MODELTOTALLY BALANCED GAMEhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzen’s characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games.Fil: Escalante, Mariana Silvina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaUnión Matemática Argentina2012-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/268611Escalante, Mariana Silvina; Leoni, Valeria Alejandra; Nasini, Graciela Leonor; A graph theoretical model for the total balancedness of combinatorial optimization games; Unión Matemática Argentina; Revista de la Unión Matemática Argentina; 53; 1; 1-2012; 85-920041-69321669-9637CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://inmabb.criba.edu.ar/revuma/revuma.php?p=toc/vol53info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T11:58:24Zoai:ri.conicet.gov.ar:11336/268611instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-22 11:58:25.041CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A graph theoretical model for the total balancedness of combinatorial optimization games
title A graph theoretical model for the total balancedness of combinatorial optimization games
spellingShingle A graph theoretical model for the total balancedness of combinatorial optimization games
Escalante, Mariana Silvina
PACKING
COVERING
GRAPH MODEL
TOTALLY BALANCED GAME
title_short A graph theoretical model for the total balancedness of combinatorial optimization games
title_full A graph theoretical model for the total balancedness of combinatorial optimization games
title_fullStr A graph theoretical model for the total balancedness of combinatorial optimization games
title_full_unstemmed A graph theoretical model for the total balancedness of combinatorial optimization games
title_sort A graph theoretical model for the total balancedness of combinatorial optimization games
dc.creator.none.fl_str_mv Escalante, Mariana Silvina
Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author Escalante, Mariana Silvina
author_facet Escalante, Mariana Silvina
Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author_role author
author2 Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author2_role author
author
dc.subject.none.fl_str_mv PACKING
COVERING
GRAPH MODEL
TOTALLY BALANCED GAME
topic PACKING
COVERING
GRAPH MODEL
TOTALLY BALANCED GAME
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzen’s characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games.
Fil: Escalante, Mariana Silvina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
description In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzen’s characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games.
publishDate 2012
dc.date.none.fl_str_mv 2012-01
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/268611
Escalante, Mariana Silvina; Leoni, Valeria Alejandra; Nasini, Graciela Leonor; A graph theoretical model for the total balancedness of combinatorial optimization games; Unión Matemática Argentina; Revista de la Unión Matemática Argentina; 53; 1; 1-2012; 85-92
0041-6932
1669-9637
CONICET Digital
CONICET
url http://hdl.handle.net/11336/268611
identifier_str_mv Escalante, Mariana Silvina; Leoni, Valeria Alejandra; Nasini, Graciela Leonor; A graph theoretical model for the total balancedness of combinatorial optimization games; Unión Matemática Argentina; Revista de la Unión Matemática Argentina; 53; 1; 1-2012; 85-92
0041-6932
1669-9637
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://inmabb.criba.edu.ar/revuma/revuma.php?p=toc/vol53
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Unión Matemática Argentina
publisher.none.fl_str_mv Unión Matemática Argentina
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846782298874183680
score 12.982451

Publicaciones similares