arXiv (All)
open access
Antichains for Concurrent Parameterized Games (Long Version)
Concurrent parameterized games involve a fixed yet arbitrary number of players. They are described by finite arenas in which the edges are labeled with languages that describe the possible move combinations leading from one vertex to another (n players yield a word of length n). Previous work showed
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- Network Games with Many Attackers and Defenders (Formal Systems and Computality Theory)#644802
- Network Games with Many Attackers and Defenders (Formal Systems and Computality Theory)#644771
- On Memory, Systems, and Logic in a Counting Game#118263
- Path Enumeration by Position-Visit Counts in Recombining Trinomial Trees#1076754
Record · ID 971689
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive