Results 1 to 10 of about 137 (19)
Fast strategies in biased Maker--Breaker games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj +1 more source
Strong Ramsey Games in Unbounded Time [PDF]
, 2019 For two graphs $B$ and $H$ the strong Ramsey game $\mathcal{R}(B,H)$ on the board $B$ and with target $H$ is played as follows. Two players alternately claim edges of $B$. The first player to build a copy of $H$ wins. If none of the players win, the game
David, Stefan +2 more
core +6 more sources
, 2016 A famous result in game theory known as Zermelo's theorem says that "in chess either White can force a win, or Black can force a win, or both sides can force at least a draw".
Amir, Rabah, Evstigneev, Igor V.
core +2 more sources
Cost-sharing in Parking Games [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper, we study the total displacement statistic of parking functions from the perspective of cooperative game theory. We introduce parking games, which are coalitional cost-sharing games in characteristic function form derived from the total ...
Jennifer Elder +3 more
doaj +1 more source
A class of extensions of Restricted (s, t)-Wythoff’s game
Open Mathematics, 2017 Restricted (s, t)-Wythoff’s game, introduced by Liu et al. in 2014, is an impartial combinatorial game. We define and solve a class of games obtained from Restricted (s, t)-Wythoff’s game by adjoining to it some subsets of its P-positions as additional ...
Liu Sanyang, Li Haiyan
doaj +1 more source
Impartial avoidance and achievement games for generating symmetric and alternating groups [PDF]
, 2016 We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group.
Benesh, Bret J. +2 more
core +3 more sources
The majority game with an arbitrary majority [PDF]
, 2016 The k-majority game is played with n numbered balls, each coloured with one of two colours. It is given that there are at least k balls of the majority colour, where k is a fixed integer greater than n/2.
Aigner +9 more
core +1 more source
, 2014 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.
Krivelevich, Michael
core +1 more source
The level set method for the two-sided eigenproblem [PDF]
, 2011 We consider the max-plus analogue of the eigenproblem for matrix pencils Ax=lambda Bx. We show that the spectrum of (A,B) (i.e., the set of possible values of lambda), which is a finite union of intervals, can be computed in pseudo-polynomial number of ...
B De Schutter +32 more
core +4 more sources
On Nonadaptive Search Problem [PDF]
, 2003 2000 Mathematics Subject Classification: 91A46, 91A35.We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3, . . . , 2^n}, n ≥ 3.
Kolev, Emil
core