相关论文: INFLUENCE: a partizan scoring game on graphs

We study a variant of the chip-firing game called the diffusion game. In the diffusion game, we begin with some integer labelling of the vertices of a graph, interpreted as a number of chips on each vertex, and then for each subsequent step…

We study a two-player game played on undirected graphs called {\sc Trail Trap}, which is a variant of a game known as {\sc Partizan Edge Geography}. One player starts by choosing any edge and moving a token from one endpoint to the other;…

When multiple influencers attempt to compete for a receiver's attention, their influencing strategies must account for the presence of one another. We introduce the Battling Influencers Game (BIG), a multi-player simultaneous-move…

Decisions in a shareholder meeting or a legislative committee are often modeled as a weighted game. Influence of a member is then measured by a power index. A large variety of different indices has been introduced in the literature. This…

Snort is a two-player game played on a simple graph in which the players take turns colouring vertices in their own colour, with the restriction that two adjacent vertices cannot have opposite colours. We will show that on triangular grids…

A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints,…

We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model, agents change behaviors/opinions on the basis of information collected from their…

Lionel Levine's hat challenge has $t$ players, each with a (very large, or infinite) stack of hats on their head, each hat independently colored at random black or white. The players are allowed to coordinate before the random colors are…

Intransitive player dominance, where player A beats B, B beats C, but C beats A, is common in competitive tennis. Yet, there are few known attempts to incorporate it within forecasting methods. We address this problem with a graph neural…

In this note we discuss a theory of combinatorial games that involve transmitting the moves through a noisy channel that can introduce errors during the transmission. Players are aware of this interference and incorporate this variable into…

The network coloring game has been proposed in the literature of social sciences as a model for conflict-resolution circumstances. The players of the game are the vertices of a graph with $n$ vertices and maximum degree $\Delta$. The game…

We combine the ideas of edge coloring games and asymmetric graph coloring games and define the \emph{$(m,1)$-edge coloring game}, which is alternatively played by two players Maker and Breaker on a finite simple graph $G$ with a set of…

The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has not yet been chosen. Dominator wins if at some point the…

In a finite two player game consider the matrix of one player's payoff difference between any two consecutive pure strategies. Define the half space induced by a column vector of this matrix as the set of vectors that form an obtuse angle…

We propose InfoChess, a symmetric adversarial game that elevates competitive information acquisition to the primary objective. There is no piece capture, removing material incentives that would otherwise confound the role of information.…

A dataset has been classified by some unknown classifier into two types of points. What were the most important factors in determining the classification outcome? In this work, we employ an axiomatic approach in order to uniquely…

In the concurrent graph sharing game, two players, called First and Second, share the vertices of a connected graph with positive vertex-weights summing up to $1$ as follows. The game begins with First taking any vertex. In each proceeding…

We study the strategic aspects of social influence in a society of agents linked by a trust network, introducing a new class of games called games of influence. A game of influence is an infinite repeated game with incomplete information in…

In 2010, Bre\v{s}ar, Klav\v{z}ar and Rall introduced the optimization variant of the graph domination game and the game domination number, which was proved PSPACE-hard by Bre\v{s}ar et al. in 2016. In 2024, Leo Versteegen obtained the…

We study multi-player turn-based games played on (potentially infinite) directed graphs. An outcome is assigned to every play of the game. Each player has a preference relation on the set of outcomes which allows him to compare plays. We…