Vladimir Gurvich

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 58

Top Venues

Publications

Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
On Minimal Transversals of Maximal Cliques in Graphs. CoRR (2024)
Vladimir Gurvich, Mariya Naumova
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms. Ann. Math. Artif. Intell. 92 (1) (2024)
Vladimir Gurvich, Mariya Naumova
On Nash-solvability of n-person graphical games under Markov and a-priori realizations. Ann. Oper. Res. 336 (3) (2024)
Endre Boros, Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino
Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. 336 (3) (2024)
Vladimir Gurvich, Matjaz Krnc, Mikhail N. Vyalyi
Growing Trees and Amoebas' Replications. CoRR (2024)
Vladimir Gurvich, Mariya Naumova
Screw discrete dynamical systems and their applications to exact slow NIM. Discret. Appl. Math. 358 (2024)
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Mikhail N. Vyalyi
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. Int. J. Game Theory 53 (2) (2024)
Vladimir Gurvich, Artem Parfenov, Michael N. Vyalyi
Experimental Study of the Game Exact Nim(5, 2). CoRR (2023)
Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games. CoRR (2023)
Vladimir Gurvich, Mariya Naumova
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. Discret. Appl. Math. 340 (2023)
Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
Dually conformal hypergraphs. CoRR (2023)
Vladimir Gurvich
Metric and ultrametric inequalities for directed graphs. Discret. Appl. Math. 314 (2022)
Vladimir Gurvich, Mariya Naumova
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms. CoRR (2022)
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Shifting paths to avoidable ones. J. Graph Theory 100 (1) (2022)
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Avoidability beyond paths. CoRR (2022)
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
Avoidable vertices and edges in graphs: Existence, characterization, and applications. Discret. Appl. Math. 309 (2022)
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Michael N. Vyalyi
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. CoRR (2022)
Vladimir Gurvich, Mariya Naumova
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. CoRR (2021)
Vladimir Gurvich
Balanced flows for transshipment problems. Discret. Appl. Math. 305 (2021)
Vladimir Gurvich
On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture. CoRR (2021)
Vladimir Gurvich, Mariya Naumova
On Nash-solvability of n-person graphical games under Markov's and a priori realizations. CoRR (2021)
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino
On the Sprague-Grundy function of extensions of proper Nim. Int. J. Game Theory 50 (3) (2021)
Vladimir Gurvich, Mariya Naumova
Logical Contradictions in the One-Way ANOVA and Tukey-Kramer Multiple Comparisons Tests with More Than Two Groups of Observations. Symmetry 13 (8) (2021)
Vladimir Gurvich
On Nash-solvability of finite n-person deterministic graphical games; Catch 22. CoRR (2021)
Vladimir Gurvich, Mikhail N. Vyalyi
On Computational Hardness of Multidimensional Subtraction Games. Algorithms 14 (3) (2021)
Vladimir Gurvich, Michael N. Vyalyi
Computational Hardness of Multidimensional Subtraction Games. CoRR (2020)
Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic
On the degree sequences of dual graphs on surfaces. CoRR (2020)
Vladimir Gurvich, Mikhail N. Vyalyi
Computational Hardness of Multidimensional Subtraction Games. CSR (2020)
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Shifting paths to avoidable ones. CoRR (2020)
Endre Boros, Vladimir Gurvich, Martin Milanic
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. J. Graph Theory 94 (3) (2020)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. Inf. Comput. 267 (2019)
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. 799 (2019)
Endre Boros, Vladimir Gurvich, Martin Milanic
Decomposing 1-Sperner Hypergraphs. Electron. J. Comb. 26 (3) (2019)
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
Avoidable Vertices and Edges in Graphs. CoRR (2019)
Endre Boros, Ondrej Cepek, Vladimir Gurvich
Separable discrete functions: Recognition and sufficient conditions. Discret. Math. 342 (5) (2019)
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
Avoidable Vertices and Edges in Graphs. WADS (2019)
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory, Ser. A 165 (2019)
Vladimir Gurvich, Nhan Bao Ho
On tame, pet, domestic, and miserable impartial games. Discret. Appl. Math. 243 (2018)
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
On the Sprague-Grundyfunction of Exact k-Nim. Discret. Appl. Math. 239 (2018)
Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica 80 (11) (2018)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dyn. Games Appl. 8 (1) (2018)
Vladimir Gurvich, Gleb A. Koshevoy
Monotone bargaining is Nash-solvable. Discret. Appl. Math. 250 (2018)
Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. 243 (2018)
Vladimir Gurvich
Complexity of Generation. CSR (2018)
Endre Boros, Vladimir Gurvich, Martin Milanic
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. CoRR (2018)
Vladimir Gurvich
Backward induction in presence of cycles. J. Log. Comput. 28 (7) (2018)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A convex programming-based algorithm for mean payoff stochastic games with perfect information. Optim. Lett. 11 (8) (2017)
Endre Boros, Vladimir Gurvich, Martin Milanic
On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. 216 (2017)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A nested family of $\varvec{k}$ -total effective rewards for positional games. Int. J. Game Theory 46 (1) (2017)
Vladimir Gurvich, Gleb A. Koshevoy
Monotone bargaining is Nash-solvable. CoRR (2017)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $2 \times 2$ subgames. Int. J. Game Theory 45 (4) (2016)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information. CoRR (2016)
Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
A three-person chess-like game without Nash equilibria. CoRR (2016)
Endre Boros, Vladimir Gurvich, Martin Milanic
1-Sperner hypergraphs. CoRR (2015)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. CoRR (2015)
Endre Boros, Vladimir Gurvich
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games. Discret. Math. 338 (12) (2015)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games. CoRR (2015)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS (2015)
Endre Boros, Vladimir Gurvich, Martin Milanic
On CIS circulants. Discret. Math. 318 (2014)
Andrey Gol'berg, Vladimir Gurvich, Diogo Vieira Andrade, Konrad Borys, Gábor Rudolf
Combinatorial games modeling seki in GO. Discret. Math. 329 (2014)
Vladimir Gurvich, Vladimir Oudalov
On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost. Discret. Appl. Math. 167 (2014)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Nested Family of Cyclic Games with $k$-total Effective Rewards. CoRR (2014)
Vladimir Gurvich, Vladimir Oudalov
A four-person chess-like game without Nash equilibria in pure stationary strategies. CoRR (2014)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. COCOA (2014)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ICALP (1) (2013)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. Dyn. Games Appl. 3 (2) (2013)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. Oper. Res. Lett. 41 (4) (2013)
Endre Boros, Vladimir Gurvich, Vladimir Oudalov
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory. Int. J. Game Theory 42 (4) (2013)
Endre Boros, Vladimir Gurvich, Martin Milanic
On CIS Circulants CoRR (2013)
Vladimir Gurvich, Mikhail N. Vyalyi
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs. Discret. Appl. Math. 160 (12) (2012)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. Discret. Math. 312 (4) (2012)
Vladimir Gurvich
Further generalizations of the Wythoff game and the minimum excludant. Discret. Appl. Math. 160 (7-8) (2012)
Endre Boros, Ondrej Cepek, Vladimir Gurvich
Total tightness implies Nash-solvability for three-person game forms. Discret. Math. 312 (8) (2012)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary
The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann. Oper. Res. 188 (1) (2011)
Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) (2011)
Vladimir Gurvich
On exact blockers and anti-blockers, Δ-conjecture, and related problems. Discret. Appl. Math. 159 (5) (2011)
Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao
Nash-solvable two-person symmetric cycle game forms. Discret. Appl. Math. 159 (15) (2011)
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
Friendship Two-Graphs. Graphs Comb. 26 (5) (2010)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
On effectivity functions of game forms. Games Econ. Behav. 68 (2) (2010)
Diogo Vieira Andrade, Endre Boros, Vladimir Gurvich
Not complementary connected and not CIS d-graphs form weakly monotone families. Discret. Math. 310 (5) (2010)
Jack R. Edmonds, Stéphane Gaubert, Vladimir Gurvich
Sperner Oiks. Electron. Notes Discret. Math. 36 (2010)
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen
On acyclicity of games with cycles. Discret. Appl. Math. 158 (10) (2010)
Jack R. Edmonds, Stéphane Gaubert, Vladimir Gurvich
Scarf Oiks. Electron. Notes Discret. Math. 36 (2010)
Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp
Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discret. Math. 310 (6-7) (2010)
Vladimir Gurvich
Metric and ultrametric spaces of resistances. Discret. Appl. Math. 158 (14) (2010)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO (2010)
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen
On Acyclicity of Games with Cycles. AAIM (2009)
Endre Boros, Vladimir Gurvich, Kazuhisa Makino
Minimal and locally minimal games and game forms. Discret. Math. 309 (13) (2009)
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
On split and almost CIS-graphs. Australas. J Comb. 43 (2009)
Vladimir Gurvich, Igor E. Zverovich
Neighborhood hypergraphs of digraphs and some matrix permutation problems. Discret. Appl. Math. 157 (13) (2009)
Vladimir Gurvich
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited. Discret. Appl. Math. 157 (14) (2009)
Endre Boros, Vladimir Gurvich
Vertex- and edge-minimal and locally minimal graphs. Discret. Math. 309 (12) (2009)
Vladimir Gurvich, Peter Bro Miltersen
On the computational complexity of solving stochastic mean-payoff games CoRR (2008)
Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf
Generating 3-vertex connected spanning subgraphs. Discret. Math. 308 (24) (2008)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43 (2) (2008)
Vladimir Gurvich
On cyclically orientable graphs. Discret. Math. 308 (1) (2008)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
Generating All Vertices of a Polyhedron Is Hard. Discret. Comput. Geom. 39 (1-3) (2008)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discret. Appl. Math. 156 (11) (2008)
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
Neighborhood hypergraphs of bipartite graphs. J. Graph Theory 58 (1) (2008)
Vladimir Gurvich
War and peace in veto voting. Eur. J. Oper. Res. 185 (1) (2008)

Vladimir Gurvich.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vladimir Gurvich