1. |
2. Sprague-Grundy function of matroids and related hypergraphsEndre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Muršič, 2019, original scientific article Keywords: matroid, self-dual matroid, impartial game, Sprague-Grundy function, Nim, hypergraph Nim, JM hypergraph
Published in RUP: 11.02.2020; Views: 1983; Downloads: 103
 Link to full text |
3. Avoidable vertices and edges in graphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, published scientific conference contribution Keywords: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published in RUP: 20.08.2019; Views: 2877; Downloads: 160
Link to full text |
4. |
5. On the Sprague-Grundy function of Exact k-NimEndre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Muršič, 2018, original scientific article Keywords: Moore's Nim, Exact Nim, impartial games, P-position, Sprague-Grundy function
Published in RUP: 22.05.2019; Views: 2603; Downloads: 128
Link to full text |
6. Sprague-Grundy function of symmetric hypergraphsEndre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Muršič, 2019, original scientific article Keywords: impartial games, Sprague-Grundy function, Nim, hypergraph Nim, JM formula, JM hypergraph, symmetric hypergraph, transversal-free hypergraph
Published in RUP: 22.05.2019; Views: 2584; Downloads: 131
Link to full text |
7. A three-person deterministic graphical game without Nash equilibriaEndre Boros, Vladimir Gurvich, Martin Milanič, Vladimir Oudalov, Jernej Vičič, 2018, original scientific article Abstract: We give an example of a three-person deterministic graphical game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique cycle and three terminal positions), and its normal form is of size only. Thus, the example strengthens significantly the one obtained in 2014 by Gurvich and Oudalov; the latter has four players, five terminals, and normal form of size . Furthermore, our example is minimal with respect to the number of players. Somewhat similar examples were known since 1975, but they were not related to deterministic graphical games. The small size of our example allows us to verify that it has no Nash equilibrium not only in pure but also in independently mixed (so-called behavioral) strategies. For independently mixed strategies two distinct effective payoffs can be considered: along with the classical Markovian evaluation, we also consider a priori evaluation, which may be a better fit for playing in behavioral strategies
Keywords: deterministic graphical multi-person game, perfect information, Nash equilibrium, directed cycle, terminal position, pure stationary strategy
Published in RUP: 30.03.2018; Views: 4552; Downloads: 178
Link to full text |
8. |
