Zobrazeno 1 - 10
of 514
pro vyhledávání: '"Gurvich Vladimir"'
We prove that every finite two-person positive shortest path game has a Nash equilibrium (NE) in pure stationary strategies, which can be computed in polynomial time. The existence result holds also for graphs with finite out-degrees. Moreover, we pr
Externí odkaz:
http://arxiv.org/abs/2410.09257
We construct a finite deterministic graphical (DG) game without Nash equilibria in pure stationary strategies. This game has 3 players $I=\{1,2,3\}$ and 5 outcomes: 2 terminal $a_1$ and $a_2$ and 3 cyclic. Furthermore, for 2 players a terminal outcom
Externí odkaz:
http://arxiv.org/abs/2406.14587
A hypergraph is conformal if it is the family of maximal cliques of a graph. In this paper we are interested in the problem of determining when is the family of minimal transversal of maximal cliques of a graph conformal. Such graphs are called cliqu
Externí odkaz:
http://arxiv.org/abs/2405.10789
Autor:
Gurvich, Vladimir, Naumova, Mariya
Given integers $n,k,\ell$ such that $0
Externí odkaz:
http://arxiv.org/abs/2312.08382
Given integer $n$ and $k$ such that $0 < k \leq n$ and $n$ piles of stones, two players alternate turns. By one move it is allowed to choose any $k$ piles and remove exactly one stone from each. The player who has to move but cannot is the loser. in
Externí odkaz:
http://arxiv.org/abs/2311.13511
Autor:
Gurvich, Vladimir, Naumova, Mariya
Given integer $n \geq 1, \ell \geq 2$, and vector $x = (x_1, \ldots, x_n)$ that has an entry which is a multiple of $\ell$ and such that $x_1 \leq \ldots \leq x_n$, the GM-rule is defined as follows: Keep the rightmost minimal entry $x_i$ of $x$, whi
Externí odkaz:
http://arxiv.org/abs/2311.03257
We study remoteness function $\mathcal R$ of impartial games introduced by Smith in 1966. The player who moves from a position $x$ can win if and only if $\mathcal R(x)$ is odd. The odd values of $\mathcal R(x)$ show how soon the winner can win, whil
Externí odkaz:
http://arxiv.org/abs/2311.02685
Given a hypergraph $\mathcal{H}$, the dual hypergraph of $\mathcal{H}$ is the hypergraph of all minimal transversals of $\mathcal{H}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraph
Externí odkaz:
http://arxiv.org/abs/2309.00098
Autor:
Gurvich, Vladimir, Naumova, Mariya
In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some discrete o
Externí odkaz:
http://arxiv.org/abs/2306.10948
The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2019 as a common generalization of avoidable vertices and simplicial paths. In 2020, Bonamy, Defrain, Hatzel, and Thiebaut proved
Externí odkaz:
http://arxiv.org/abs/2208.12803