| dc.creator | Cesco, Juan | |
| dc.date | 2015-09 | |
| dc.date | 2015 | |
| dc.date | 2017-04-04T16:15:50Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/59430 | |
| dc.identifier | http://44jaiio.sadio.org.ar/sites/default/files/sio112-117.pdf | |
| dc.identifier | issn:2451-7550 | |
| dc.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. | |
| dc.description | Sociedad Argentina de Informática e Investigación Operativa (SADIO) | |
| dc.format | application/pdf | |
| dc.format | 112-117 | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by/3.0/ | |
| dc.rights | Creative Commons Attribution 3.0 Unported (CC BY 3.0) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | U-cycle | |
| dc.subject | TU-game | |
| dc.subject | Games | |
| dc.title | Approximated Cycles in TU-Games | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
