Related papers: Erratum to: Lattice point methods for combinatoria…
Subtraction games is a class of combinatorial games. It was solved since the Sprague-Grundy Theory was put forward. This paper described a new algorithm for subtraction games. The new algorithm can find win or lost positions in subtraction…
In this article, the author provides full details of the proof of the concordance/isotopy problem. The first published proof, [5], accomplished this task only partially since there was an error, see the erratum [6], which damaged the main…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
An error is spotted in the statement of Theorem~1.3 of our published article titled "On oriented cliques with respect to push operation" (Discrete Applied Mathematics 2017). The theorem provided an exhaustive list of 16 minimal (up to…
In the present paper we discuss the lattice of reducts of $\langle \mathbb{Q}, \{$+$\} \rangle$
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
The statement of item (ii) of Proposition 3.2 of the article referenced in the title is not correct. We provide a corrected version and show that, under the assumption that $\gcd(a_i, a_j, q-1)=1$ for any pair $i\neq j$ in $\{0, \cdots,…
This note corrects a discrepancy between the semantics and the algorithm of the multiple until operator of CSL, like in Pr_{> 0.0025} (a until[1,2] b until[3,4] c), of the article: Model-checking continuous-time Markov chains by Aziz,…
By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior. We consider two well…
We show the value of positions of the combinatorial game ``Toads and Frogs''. We present new values of starting positions. Moreover, we discuss the values of all positions with exactly one $\Box, \regT^{a}\Box\Box \regF^{a}, \regT^{a} \Box…
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely…
We fill in a gap in the proof of the main theorem in our earlier paper [Ol]. At the same time, we prove a slightly stronger version of the theorem needed for another paper.
The CFR+ algorithm for solving imperfect information games is a variant of the popular CFR algorithm, with faster empirical performance on a range of problems. It was introduced with a theoretical upper bound on solution error, but…
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…
We study last-iterate convergence properties of algorithms for solving two-player zero-sum games based on Regret Matching$^+$ (RM$^+$). Despite their widespread use for solving real games, virtually nothing is known about their last-iterate…
We extend the Fermilab formalism for heavy quarks to develop a more improved action. We give results of matching calculations of the improvement couplings at tree level. Finally, we estimate the discretization errors associated with the new…
In his seminal paper "A Natural Semantics for Lazy Evaluation", John Launchbury proves his semantics correct with respect to a denotational semantics. We machine-checked the proof and found it to fail, and provide two ways to fix it: One by…
This note provides a brief guide to the current state of the literature on Tarski's problems with emphasis on features that distinguish the approach based on combinatorial and algorithmic group theory from the topological approach to…
This paper is concerned with the death-birth updating process. This model is an example of a spatial game in which players located on the~$d$-dimensional integer lattice are characterized by one of two possible strategies and update their…