Mourad El Ouali

Learn More
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 player, called ”codebreaker”, tries to break the secret code by making as few guesses as possible,(More)
In this paper we analyze the maximum cardinality b-matching problem in l-uniform hypergraphs with respect to the complexity class Max-Snp, where b-matching is defined as follows: for given b ∈ N and a hypergraph H = (V, E) a subset Mb ⊆ E with maximum cardinality is sought so that no vertex is contained in more than b hyperedges of Mb. We show that if the(More)
Let $$b\in {\mathbb {N}}_{\ge 1}$$ b ∈ N ≥ 1 and let $${\mathcal {H}}=(V,{\mathcal {E}})$$ H = ( V , E ) be a hypergraph with maximum vertex degree $${\varDelta }$$ Δ and maximum edge size $$l$$ l . A set $$b$$ b -multicover in $${\mathcal {H}}$$ H is a set of edges $$C \subseteq {\mathcal {E}}$$ C ⊆ E such that every vertex in $$V$$ V belongs to at least(More)
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, exploiting information that is given by the codemaker after each guess. In this paper, we consider the so called(More)
  • 1