Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Urban Larsson"'
Autor:
Urban Larsson
We provide a framework, which explains how so-called vicious cycles can thrive inspite of an individual rejecting them. Then, as a corollary, we show how easily one can escape them, by not rejecting them, simply because they do not exist as such, as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57c038ab8a20e26f723f6ad471b59193
https://doi.org/10.32388/cj2tkn
https://doi.org/10.32388/cj2tkn
Autor:
Urban Larsson, Richard Nowakowski
Publikováno v:
Discrete Mathematics. 346:113229
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4318923fcf92cdb9ab6574692b1f1be
https://doi.org/10.1016/j.disc.2022.113229
https://doi.org/10.1016/j.disc.2022.113229
Autor:
Urban Larsson
Publikováno v:
Handbook of the Mathematics of the Arts and Sciences ISBN: 9783319570716
Handbook of the Mathematics of the Arts and Sciences ISBN: 9783319706580
Handbook of the Mathematics of the Arts and Sciences ISBN: 9783319706580
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5dd82fa050baa8ca9df7a7be240e69d8
https://doi.org/10.1007/978-3-319-57072-3_115
https://doi.org/10.1007/978-3-319-57072-3_115
We study zero-sum (combinatorial) games, within the framework of so-called Richman auctions (Lazarus et al. 1996) namely, we modify the alternating play scoring ruleset Cumulative Subtraction (CS) (Cohensius et al. 2019), to a discrete bidding scheme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0b541efde74e67787245c58bf124b49
Publikováno v:
Theoretical Computer Science. 725:52-63
Absolute Universes of Combinatorial Games, as defined in a recent paper by the same authors, include many standard short Normal- Misere- and Scoring-play monoids. Given G and H in an Absolute Universe U , we define a dual Normal-play game, called the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::331b46020907acb880a624f215346ff9
https://doi.org/10.1016/j.tcs.2017.11.029
https://doi.org/10.1016/j.tcs.2017.11.029
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2018, 715, pp.71-85. ⟨10.1016/j.tcs.2018.01.003⟩
Theoretical Computer Science, Elsevier, 2018, 715, pp.71-85. ⟨10.1016/j.tcs.2018.01.003⟩
We study operators that combine combinatorial games. This field was initiated by Sprague-Grundy (1930s), Milnor (1950s) and Berlekamp-Conway-Guy (1970-80s) via the now classical disjunctive sum operator on (abstract) games. The new class consists in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d22ce0f8c8de8f8a30b940314e27ac40
https://doi.org/10.1016/j.tcs.2018.01.003
https://doi.org/10.1016/j.tcs.2018.01.003