Arrow Research search
Back to CSL

CSL 2024

Energy Games over Totally Ordered Groups

Conference Paper Accepted Paper Logic in Computer Science · Theoretical Computer Science

Abstract

Kopczyński (ICALP 2006) conjectured that prefix-independent half-positional winning conditions are closed under finite unions. We refute this conjecture over finite arenas. For that, we introduce a new class of prefix-independent bi-positional winning conditions called energy conditions over totally ordered groups. We give an example of two such conditions whose union is not half-positional. We also conjecture that every prefix-independent bi-positional winning condition coincides with some energy condition over a totally ordered group on periodic sequences.

Authors

Keywords

  • Games on graphs
  • half-positionality
  • ordered groups

Context

Venue
Annual Conference on Computer Science Logic
Archive span
1988-2026
Indexed papers
1413
Paper id
275713387328337799
v2026.09.13