Approximated Cycles in TU-Games

Autores
Cesco, Juan
Año de publicación
2015
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Non-balanced TU-games, which are games with empty core, can also be characterized by the existence of certain type of cycles of pre-imputations. A particular sub-class of these cycles is that of maximal U-cycles. They show up in connection with the application of a transfer scheme to games with empty core, although this transfer scheme was originally designed however, to reach a point in the core of a balanced TU-game. While the appearance of one of such cycles is enough to detect the non-balancedness of the game, it is still an open question if every non- balanced game has a maximal U-cycle. The aim of this note is to show, however, that there are always, in non-balanced games, approximated maximal U-cycles sharing with the true maximal U-cycles all their good properties.
Sociedad Argentina de Informática e Investigación Operativa (SADIO)
Materia
Ciencias Informáticas
U-cycle
TU-game
Games
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/59430

id SEDICI_e495a8897c22b8866b365554c27083f7
oai_identifier_str oai:sedici.unlp.edu.ar:10915/59430
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Approximated Cycles in TU-GamesCesco, JuanCiencias InformáticasU-cycleTU-gameGamesNon-balanced TU-games, which are games with empty core, can also be characterized by the existence of certain type of cycles of pre-imputations. A particular sub-class of these cycles is that of maximal U-cycles. They show up in connection with the application of a transfer scheme to games with empty core, although this transfer scheme was originally designed however, to reach a point in the core of a balanced TU-game. While the appearance of one of such cycles is enough to detect the non-balancedness of the game, it is still an open question if every non- balanced game has a maximal U-cycle. The aim of this note is to show, however, that there are always, in non-balanced games, approximated maximal U-cycles sharing with the true maximal U-cycles all their good properties.Sociedad Argentina de Informática e Investigación Operativa (SADIO)2015-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf112-117http://sedici.unlp.edu.ar/handle/10915/59430enginfo:eu-repo/semantics/altIdentifier/url/http://44jaiio.sadio.org.ar/sites/default/files/sio112-117.pdfinfo:eu-repo/semantics/altIdentifier/issn/2451-7550info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/3.0/Creative Commons Attribution 3.0 Unported (CC BY 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:39:40Zoai:sedici.unlp.edu.ar:10915/59430Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:39:40.453SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Approximated Cycles in TU-Games
title Approximated Cycles in TU-Games
spellingShingle Approximated Cycles in TU-Games
Cesco, Juan
Ciencias Informáticas
U-cycle
TU-game
Games
title_short Approximated Cycles in TU-Games
title_full Approximated Cycles in TU-Games
title_fullStr Approximated Cycles in TU-Games
title_full_unstemmed Approximated Cycles in TU-Games
title_sort Approximated Cycles in TU-Games
dc.creator.none.fl_str_mv Cesco, Juan
author Cesco, Juan
author_facet Cesco, Juan
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
U-cycle
TU-game
Games
topic Ciencias Informáticas
U-cycle
TU-game
Games
dc.description.none.fl_txt_mv Non-balanced TU-games, which are games with empty core, can also be characterized by the existence of certain type of cycles of pre-imputations. A particular sub-class of these cycles is that of maximal U-cycles. They show up in connection with the application of a transfer scheme to games with empty core, although this transfer scheme was originally designed however, to reach a point in the core of a balanced TU-game. While the appearance of one of such cycles is enough to detect the non-balancedness of the game, it is still an open question if every non- balanced game has a maximal U-cycle. The aim of this note is to show, however, that there are always, in non-balanced games, approximated maximal U-cycles sharing with the true maximal U-cycles all their good properties.
Sociedad Argentina de Informática e Investigación Operativa (SADIO)
description Non-balanced TU-games, which are games with empty core, can also be characterized by the existence of certain type of cycles of pre-imputations. A particular sub-class of these cycles is that of maximal U-cycles. They show up in connection with the application of a transfer scheme to games with empty core, although this transfer scheme was originally designed however, to reach a point in the core of a balanced TU-game. While the appearance of one of such cycles is enough to detect the non-balancedness of the game, it is still an open question if every non- balanced game has a maximal U-cycle. The aim of this note is to show, however, that there are always, in non-balanced games, approximated maximal U-cycles sharing with the true maximal U-cycles all their good properties.
publishDate 2015
dc.date.none.fl_str_mv 2015-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/59430
url http://sedici.unlp.edu.ar/handle/10915/59430
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://44jaiio.sadio.org.ar/sites/default/files/sio112-117.pdf
info:eu-repo/semantics/altIdentifier/issn/2451-7550
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/3.0/
Creative Commons Attribution 3.0 Unported (CC BY 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/3.0/
Creative Commons Attribution 3.0 Unported (CC BY 3.0)
dc.format.none.fl_str_mv application/pdf
112-117
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260258413608960
score 13.13397