Related papers: P-positions in Modular Extensions to Nim

We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we…

An attempt is made to find a comprehensive mathematical framework in which to investigate the problems of well-posedness and asymptotic analysis for fully nonlinear evolutionary game theoretic models. The model should be rich enough to…

Let $a$, $b$, and $n$ be integers with $0<a<b<n$. In a certain two-player probabilistic chip-collecting game, Alice tosses a coin to determine whether she collects $a$ chips or $b$ chips. If Alice collects $a$ chips, then Bob collects $b$…

Representing a board game and its positions by text-based notation enables the possibility of NLP applications. Language models, can help gain insight into a variety of interesting problems such as unsupervised learning rules of a game,…

We study the complexity of computing stationary Nash equilibrium (NE) in n-player infinite-horizon general-sum stochastic games. We focus on the problem of computing NE in such stochastic games when each player is restricted to choosing a…

We study a wireless jamming problem consisting of the competition between a legitimate receiver and a jammer, as a zero-sum game where the value to maximize/minimize is the channel capacity at the receiver's side. Most of the approaches…

We provide general theoretical foundations for modeling strategic uncertainty in large distributional Bayesian games with general type spaces, using a version of interim correlated rationalizability. We then focus on the case in which…

Reinforcement learning is typically concerned with learning control policies tailored to a particular agent. We investigate whether there exists a single global policy that can generalize to control a wide variety of agent morphologies --…

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.…

In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes faced with the following problem: how can a human (as opposed to a computer) shuffle a large deck of cards? The procedure we study is to break…

We consider the following modification of annihilation game called node blocking. Given a directed graph, each vertex can be occupied by at most one token. There are two types of tokens, each player can move his type of tokens. The players…

As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a ``topological'' game for Multiplicative Additive Linear Logic without propositional variables, including cut moves. We recast the…

We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a win. We explore and compare several criteria for establishing…

We study the game of go from a complex network perspective. We construct a directed network using a suitable definition of tactical moves including local patterns, and study this network for different datasets of professional tournaments…

We introduce two new iteration games: the game G, which is a strengthening of the weak iteration game, and the game G+, which is somewhat stronger than G but weaker than the full iteration game of length omega_1. For a countable M…

Because combat environments change over time and technology upgrades are widespread for ground vehicles, a large number of vehicles and equipment become quickly obsolete. A possible solution for the U.S. Army is to develop fleets of modular…

In an all-pay auction, only one bidder wins but all bidders must pay the auctioneer. All-pay bidding games arise from attaching a similar bidding structure to traditional combinatorial games to determine which player moves next. In contrast…

We consider potential games with mixed-integer variables, for which we propose two distributed, proximal-like equilibrium seeking algorithms. Specifically, we focus on two scenarios: i) the underlying game is generalized ordinal and the…

The emergence of mutual cooperation is studied in a spatially extended evolutionary prisoner's dilemma game in which the players are located on the sites of cubic lattices for dimensions d=1, 2, and 3. Each player can choose one of the…

We explain some results concerning the topology of varieties and stacks equipped with an action of the multiplicative group $\mathbb{G}_m$. We apply these techniques to the moduli of Higgs bundles. Our main application is to upgrade the…