Results 1 to 10 of about 30 (30)

Fast strategies in biased Maker--Breaker games [PDF]

open access: yesDiscrete 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

Cost-sharing in Parking Games [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
In 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 access: yesOpen 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

Order and inverses in the monoid of misère blocking games [PDF]

open access: yes
This paper considers combinatorial games with the last move losing (misère play) instead of winning (normal play). Misère games form a pomonoid in which no non-zero elements are invertible; normal-play games, however, form a group with a much richer ...
Milley, Rebecca, Davies, Alfie
core   +1 more source

On Nonadaptive Search Problem [PDF]

open access: yes, 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  

The Nim-Sum of a Random Integer Partition

open access: yes
An unordered position of ordinary Nim with \(N\) tokens is an integer partition of \(N\). By Bouton's theorem, the position is losing if and only if the bitwise exclusive OR (XOR) of its parts is zero.
Daewon Kim
core   +1 more source

The Rényi-Ulam Pathological Liar Game with a Fixed Number of Lies

open access: yes, 2008
The q-round Rényi-Ulam pathological liar game with k lies on the set [n]:= {1,..., n} is a 2-player perfect information zero sum game. In each round Paul chooses a subset A ⊆ [n] and Carole either assigns 1 lie to each element of A or to each element of [
Robert B. Ellis A
core  

Assessing racial/ethnic differences in sleep-pain relationships using intensive longitudinal modeling among Native Americans. [PDF]

open access: yesSleep
Rhudy JL   +8 more
europepmc   +1 more source

On Nonadaptive Search Problem

open access: yes, 2012
Kolev, Emil
core  

Home - About - Disclaimer - Privacy