Kernel Strategies

Kernel Strategies is a strategic framework in combinatorial game theory that identifies invariant subsets of game states, termed kernels, which uniquely determine optimal move selections by ensuring that no two positions within the kernel are mutually reachable and every position outside the kernel has a move leading into it.

28

Publications

817

Citations

82

Authors

43

Institutions

Publications per year

2017–2026

10

Authors

82

  1. IF
    Ian Flint

    Nanyang Technological University, Singapore

    2 publications · 57 citations

    2

    h-index

  2. AM
    Arnab Maity

    North Carolina State University, United States

    2 publications · 176 citations

    2

    h-index

  3. LD
    Laurent Decreusefond

    Télécom Paris, France

    2 publications · 57 citations

    2

    h-index

  4. AV
    Anaïs Vergne

    Télécom Paris, France

    2 publications · 57 citations

    2

    h-index

  5. MC
    Michael C. Wu

    Fred Hutch Cancer Center, United States

    2 publications · 136 citations

    2

    h-index

1–5 of 82

Venues

  1. Journal of Applied Probability

    JAP · 2 publications · 57 citations

    2

    h-index

  2. Genetic Epidemiology

    2 publications · 176 citations

    2

    h-index

  3. Journal of Process Control

    2 publications · 28 citations

    2

    h-index

  4. Neural Information Processing Systems

    Conference · 1 publications · 15 citations

    1

    h-index

  5. Algorithmica

    1 publications · 13 citations

    1

    h-index

1–5