arXiv (All)
open access
The burning game on graphs
Motivated by the burning and cooling processes, the burning game is introduced. Two players (Burner and Staller) play the game on a graph $G$ by alternately selecting vertices of $G$ to burn; as in the burning process, burning vertices spread fire to unburned neighbors. Burner aims to burn all verti
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
- Graph-to-Grid (G2G): Continuous-Coordinate Feature Painting for Soccer Pass Surfaces#1050226
- Cognitive constraints govern collective outcomes in strategic network formation#1167874
- Cognitive constraints govern collective outcomes in strategic network formation#1148190
- Recent advances in experimental studies of social dilemma games#17364
- The Effects of Team Flow on Performance: A Video Game Experiment#366455
Record · ID 1131372
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