Fast strategies in biased Maker--Breaker games
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 $b$, in which Maker can win in each of the...
Main Authors: | Mirjana Mikalački, Miloš Stojaković |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2018-10-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/4033/pdf |
Similar Items
-
A class of extensions of Restricted (s, t)-Wythoff’s game
by: Liu Sanyang, et al.
Published: (2017-03-01) -
Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$
by: Jovana Forcan, et al.
Published: (2024-04-01) -
Feedback Nash equilibria in optimal taxation problems
by: Krastanov Mikhail, et al.
Published: (2009-12-01) -
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
by: Nicola Basilico, et al.
Published: (2020-03-01) -
Generic uniqueness of saddle point for two-person zero-sum differential games
by: Ji Wei
Published: (2022-04-01)