  The GKS game was formulated by Justin Gilmer, Michal Koucky, and Michael Saks
in their research of the sensitivity conjecture. Mario Szegedy invented a
protocol for the game with the cost of $O(n^{0.4732})$. Then a protocol with
the cost of $O(n^{0.4696})$ was obtained by DeVon Ingram who used a bipartite
matching. We propose a slight improvement of Ingram's method and design a
protocol with cost of $O(n^{0.4693})$.
