5 papers
Traveling Salesmen in the Presence of Competition
Sandor P. Fekete, Rudolf Fleischer, Aviezri Fraenkel +1
We propose the ``Competing Salesmen Problem'' (CSP), a 2-player competitive version of the classical Traveling Salesman Problem. This problem arises when considering two competing…
How far can Nim in disguise be stretched?
Uri Blass, Aviezri S. Fraenkel, Romina Guelman
A move in the game of nim consists of taking any positive number of tokens from a single pile. Suppose we add the class of moves of taking a nonnegative number of tokens jointly fr…
Infinite cyclic impartial games
Aviezri S. Fraenkel, Ofer Rahat
We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy…
A new heap game
Aviezri S. Fraenkel, Dmitri Zusman
Given heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most heaps, or to remove the {\sl same}…
Heap games, numeration systems and sequences
Aviezri S. Fraenkel
We propose and analyse a 2-parameter family of 2-player games on two heaps of tokens, and present a strategy based on a class of sequences. The strategy looks easy, but is actually…