@inproceedings{10.1007/978-3-662-47666-6_16,
    Abstract = {We study two-player games with counters, where the objective of the first player is that the counter values remain bounded. We investigate the existence of a trade-off between the size of the memory and the bound achieved on the counters, which has been conjectured by Colcombet and L{\"o}ding. We show that unfortunately this conjecture does not hold: there is no trade-off between bounds and memory, even for finite arenas. On the positive side, we prove the existence of a trade-off for the special case of thin tree arenas.},
    Address = {Berlin, Heidelberg},
    Author = {Fijalkow, Nathana{\"e}l and Horn, Florian and Kuperberg, Denis and Skrzypczak, Micha{{\l}}},
    BookTitle = {Automata, Languages, and Programming},
    Editor = {Halld{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina},
    File = {Trading Bounds for Memory in Games with Counters - 1709.03121 - a - a - a - y.pdf},
    ISBN = {978-3-662-47666-6},
    Pages = {197--208},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Trading Bounds for Memory in Games with Counters},
    Year = {2015},
    date-added = {2020-02-03 20:00:12 +0100},
    date-modified = {2020-02-03 20:00:12 +0100},
    doi = {10.1007/978-3-662-47666-6_16}
}

@inproceedings{10.1007/978-3-662-47666-6_16, Abstract = {We study two-player games with counters, where the objective of the first player is that the counter values remain bounded. We investigate the existence of a trade-off between the size of the memory and the bound achieved on the counters, which has been conjectured by Colcombet and L{\"o}ding. We show that unfortunately this conjecture does not hold: there is no trade-off between bounds and memory, even for finite arenas. On the positive side, we prove the existence of a trade-off for the special case of thin tree arenas.}, Address = {Berlin, Heidelberg}, Author = {Fijalkow, Nathana{\"e}l and Horn, Florian and Kuperberg, Denis and Skrzypczak, Micha{{\l}}}, BookTitle = {Automata, Languages, and Programming}, Editor = {Halld{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, File = {Trading Bounds for Memory in Games with Counters - 1709.03121 - a - a - a - y.pdf}, ISBN = {978-3-662-47666-6}, Pages = {197--208}, Publisher = {Springer Berlin Heidelberg}, Title = {Trading Bounds for Memory in Games with Counters}, Year = {2015}, date-added = {2020-02-03 20:00:12 +0100}, date-modified = {2020-02-03 20:00:12 +0100}, doi = {10.1007/978-3-662-47666-6_16} }