相关论文: Degrees are Useless in SNORT When Measuring Temper…

Here we present a combinatorial decision problem, inspired by the celebrated quiz show called the countdown, that involves the computation of a given target number T from a set of k randomly chosen integers along with a set of arithmetic…

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…

We use the Matrix formalism to investigate what happens to strings above the Hagedorn temperaure. We show that it is not a limiting temperature but a temperature at which the continuum string picture breaks down. We study a collection of…

Game theory is usually considered applied mathematics, but a few game-theoretic results, such as Borel determinacy, were developed by mathematicians for mathematics in a broad sense. These results usually state determinacy, i.e. the…

Ladder tournaments are widely used to rank individuals in real-world organizations and games. Their mathematical properties however are still poorly understood. We formalize the ranking rule generated by a ladder tournament, and we show…

Combinatorial Game Theory(CGT)is a branch of Game Theory that has developed largely independently of Economic Game Theory (EGT), and is concerned with deep mathematical properties of two-player zero-sum games recursively defined over…

The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from…

Although recent work in AI has made great progress in solving large, zero-sum, extensive-form games, the underlying assumption in most past work is that the parameters of the game itself are known to the agents. This paper deals with the…

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by…

We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it.…

A generalized model of games is proposed, in which cooperative games and non-cooperative games are special cases. Some games that are neither cooperative nor non-cooperative can be expressed and analyzed. The model is based on relationships…

We introduce a topological combinatorial game called the Link Smoothing Game. The game is played on the shadow of a link diagram and legal moves consist of smoothing precrossings. One player's goal is to keep the diagram connected while the…

A k-distance r-coloring of a graph is a coloring of the vertices of the graph such that if the distance between 2 vertices x and y is less or equal to k, then x and y must have distinct colors. A planar graph is a graph that can be drawn…

Graph burning is a discrete time process which can be used to model the spread of social contagion. One is initially given a graph of unburned vertices. At each round (time step), one vertex is burned; unburned vertices with at least one…

The total domination game is a two-person competitive optimization game, where the players, Dominator and Staller, alternately select vertices of an isolate-free graph $G$. Each vertex chosen must strictly increase the number of vertices…

In many combinatorial games, one can prove that the first player wins under best play using a simple but non-constructive argument called strategy-stealing. This work is about the complexity behind these proofs: how hard is it to actually…

With the success of modern machine learning, it is becoming increasingly important to understand and control how learning algorithms interact. Unfortunately, negative results from game theory show there is little hope of understanding or…

The notion of configuration temperature is extended to discontinuous systems by identifying the temperature as the nontrivial root of several integral equations regarding the distribution of the energy change upon configuration…

We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without edge intersections and a move consists of swapping the locations of two vertices connected by an edge. We analyze this puzzle game using…

In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph $G$ and take it into a set $D$. The number of vertices dominated by the set $D$ must increase in each single turn and the game ends when $D$…