Sign games on graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909896740438016 |
|---|---|
| author | Blum, Liz Brustkern, Lily Hawkins, Rosetta Nicholson, Neil R. Rohatgi, Ranjan |
| author_facet | Blum, Liz Brustkern, Lily Hawkins, Rosetta Nicholson, Neil R. Rohatgi, Ranjan |
| contents | We define the Sign Game as a two-player game played on a simple undirected mathematical graph $G$. The players alternate turns, assigning vertices of $G$ either $1$ or $-1$, and edges take on the value of the product of their endvertices. The game ends when all vertices are assigned values, and the score of the game is the sum of all edge values. One player's goal is to make the score positive while the other's is to make the score negative. In this paper we investigate the game being played on various types of graphs, determining outcomes and winning strategies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_05451 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sign games on graphs Blum, Liz Brustkern, Lily Hawkins, Rosetta Nicholson, Neil R. Rohatgi, Ranjan Combinatorics 91A43, 05C57 We define the Sign Game as a two-player game played on a simple undirected mathematical graph $G$. The players alternate turns, assigning vertices of $G$ either $1$ or $-1$, and edges take on the value of the product of their endvertices. The game ends when all vertices are assigned values, and the score of the game is the sum of all edge values. One player's goal is to make the score positive while the other's is to make the score negative. In this paper we investigate the game being played on various types of graphs, determining outcomes and winning strategies. |
| title | Sign games on graphs |
| topic | Combinatorics 91A43, 05C57 |
| url | https://arxiv.org/abs/2511.05451 |