Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Ouali, Mourad El"'
We study the $(a:b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_n$ on $n$ vertices, $n,a,b \in \mathbb{N}$ where the goal of Maker is to build a copy of a specific fixed subgraph $H$. In our work this is a spanning graph
Externí odkaz:
http://arxiv.org/abs/2406.11051
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of all, we stat
Externí odkaz:
http://arxiv.org/abs/2106.05136
In this paper, we prove that it is always possible to define a realization of the Laplacian $\Delta_{\kappa,\theta}$ on $L^2(\Omega)$ subject to nonlocal Robin boundary conditions with general jump measures on arbitrary open subsets of $\mathbb R^N$.
Externí odkaz:
http://arxiv.org/abs/2105.05169
Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $\Delta$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq \mathcal{E}$ such
Externí odkaz:
http://arxiv.org/abs/2101.09080
In this paper, we introduce a new class of hemivariational inequalities, called dynamic boundary hemivariational inequalities reflecting the fact that the governing operator is also active on the boundary. In our context, it concerns the Laplace oper
Externí odkaz:
http://arxiv.org/abs/2008.09850
Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $\Delta$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq \mathcal{E}$ such
Externí odkaz:
http://arxiv.org/abs/2003.06936
Mastermind game is a two players zero sum game of imperfect information. The first player, called codemaker, chooses a secret code and the second player, called codebreaker, tries to break the secret code by making as few guesses as possible, exploit
Externí odkaz:
http://arxiv.org/abs/1611.05907
Autor:
Ouali, Mourad El, Sauerland, Volkmar
In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The first player, called "codemaker", chooses a secret code and the second
Externí odkaz:
http://arxiv.org/abs/1303.5862
Publikováno v:
The Journal of the Operational Research Society, 2015 Apr 01. 66(4), 615-626.
Externí odkaz:
http://www.jstor.org/stable/24505309
