Vladimir A. Gurvich

From MaRDI portal
Revision as of 10:53, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Vladimir A. Gurvich to Vladimir A. Gurvich: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:923675

Available identifiers

zbMath Open gurvich.vladimir-aWikidataQ102406252 ScholiaQ102406252MaRDI QIDQ923675

List of research outcomes

PublicationDate of PublicationType
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms2024-02-09Paper
Screw discrete dynamical systems and their applications to exact slow NIM2023-12-11Paper
Experimental Study of the Game Exact Nim(5, 2)2023-11-30Paper
On remoteness functions of k-NIM with k+1 piles in normal and in mis\`ere versions2023-11-22Paper
GM-rule and its applications to impartial games2023-11-06Paper
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games2023-11-05Paper
Shifting paths to avoidable ones2023-10-05Paper
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles2023-09-14Paper
On Remoteness Functions of Exact Slow $k$-NIM with $k+1$ Piles2023-04-13Paper
Supercentenarian Paradox2023-01-16Paper
Computational Hardness of Multidimensional Subtraction Games2022-10-19Paper
Avoidability beyond paths2022-08-26Paper
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms2022-04-21Paper
Metric and ultrametric inequalities for directed graphs2022-04-20Paper
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs2022-03-31Paper
More about Exact Slow $k$-Nim2022-03-24Paper
Avoidable vertices and edges in graphs: existence, characterization, and applications2022-01-13Paper
On Nash-solvability of finite $n$-person deterministic graphical games; Catch 222021-11-11Paper
Balanced flows for transshipment problems2021-10-21Paper
On the Sprague-Grundy function of extensions of proper \textsc{nim}2021-09-24Paper
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles2021-08-11Paper
On Nash-solvability of n-person graphical games under Markov's and a priori realizations2021-04-15Paper
https://portal.mardi4nfdi.de/entity/Q51487052021-02-05Paper
Recognizing distributed approval voting forms and correspondences2020-10-29Paper
Metric and ultrametric inequalities for resistances in directed graphs2020-09-29Paper
On the degree sequences of dual graphs on surfaces2020-08-02Paper
https://portal.mardi4nfdi.de/entity/Q32956082020-07-10Paper
Avoidable vertices and edges in graphs2020-01-16Paper
Sprague-Grundy function of matroids and related hypergraphs2019-11-13Paper
Decomposing 1-Sperner hypergraphs2019-08-05Paper
Avoidable Vertices and Edges in Graphs2019-07-28Paper
On graphs whose maximal cliques and stable sets intersect2019-07-25Paper
Sprague-Grundy function of symmetric hypergraphs2019-06-25Paper
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions2019-05-29Paper
Separable discrete functions: recognition and sufficient conditions2019-03-25Paper
On the Sprague-Grundy function of compound games2019-03-19Paper
Backward induction in presence of cycles2019-01-31Paper
Approximation schemes for stochastic mean payoff games with perfect information and few random positions2019-01-11Paper
Complexity of generation2018-11-28Paper
Monotone bargaining is Nash-solvable2018-10-26Paper
A potential reduction algorithm for two-person zero-sum mean payoff stochastic games2018-06-05Paper
A three-person deterministic graphical game without Nash equilibria2018-05-24Paper
On tame, pet, domestic, and miserable impartial games2018-05-24Paper
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs2018-05-09Paper
On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}2018-03-21Paper
A convex programming-based algorithm for mean payoff stochastic games with perfect information2017-12-15Paper
Generalizing Gale's theorem on backward induction and domination of strategies2017-11-30Paper
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames2017-04-27Paper
A nested family of \(k\)-total effective rewards for positional games2017-04-12Paper
Markov decision processes and stochastic games with total effective payoff2017-01-24Paper
Tetris Hypergraphs and Combinations of Impartial Games2017-01-10Paper
On equistable, split, CIS, and related classes of graphs2016-11-24Paper
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games2015-09-11Paper
Slow $k$-Nim2015-08-24Paper
Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games2015-08-05Paper
On the Sprague-Grundy Function of Tetris Extensions of Proper {\sc Nim}2015-04-27Paper
A four-person chess-like game without Nash equilibria in pure stationary strategies2014-11-02Paper
Chess-like games may have no uniform Nash equilibria even in mixed strategies2014-09-30Paper
Combinatorial games modeling seki in Go2014-06-25Paper
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness2014-05-14Paper
On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost2014-03-27Paper
On CIS circulants2014-01-27Paper
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory2013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q28615652013-11-08Paper
https://portal.mardi4nfdi.de/entity/Q28615662013-11-08Paper
On canonical forms for zero-sum stochastic mean payoff games2013-09-16Paper
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions2013-08-06Paper
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs2012-08-14Paper
Further generalizations of the Wythoff game and the minimum excludant2012-05-30Paper
On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games2012-04-13Paper
Total tightness implies Nash-solvability for three-person game forms2012-03-29Paper
https://portal.mardi4nfdi.de/entity/Q30997402011-12-01Paper
The negative cycles polyhedron and hardness of checking some polyhedral properties2011-11-17Paper
Nash-solvable two-person symmetric cycle game forms2011-10-27Paper
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes2011-07-06Paper
On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems2011-03-10Paper
Metric and ultrametric spaces of resistances2010-11-25Paper
Friendship two-graphs2010-11-12Paper
On acyclicity of games with cycles2010-10-11Paper
Generating all vertices of a polyhedron is hard2010-08-16Paper
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information2010-06-22Paper
Neighborhood hypergraphs of digraphs and some matrix permutation problems2010-04-28Paper
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited2010-04-28Paper
Acyclic, or totally tight, two-person game forms: characterization and main properties2010-04-27Paper
Not complementary connected and not CIS \(d\)-graphs form weakly monotone families2010-04-27Paper
On effectivity functions of game forms2010-03-10Paper
Algorithms - ESA 20032010-03-03Paper
A global parallel algorithm for the hypergraph transversal problem2010-01-29Paper
Minimal and locally minimal games and game forms2009-12-10Paper
Vertex- and edge-minimal and locally minimal graphs2009-12-09Paper
Algorithms and Computation2009-08-07Paper
On Acyclicity of Games with Cycles2009-07-02Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
https://portal.mardi4nfdi.de/entity/Q36222532009-04-28Paper
https://portal.mardi4nfdi.de/entity/Q36199462009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36140232009-03-16Paper
Generating Minimal k-Vertex Connected Spanning Subgraphs2009-03-06Paper
Generating 3-vertex connected spanning subgraphs2009-01-28Paper
Recalling Leo2008-09-10Paper
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions2008-09-10Paper
Scientific contributions of Leo Khachiyan (a short overview)2008-09-10Paper
Generating cut conjunctions in graphs and related problems2008-07-01Paper
On short paths interdiction problems: Total and node-wise limited interdiction2008-06-17Paper
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames2008-06-05Paper
Neighborhood hypergraphs of bipartite graphs2008-05-14Paper
ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)2008-04-29Paper
Generating all vertices of a polyhedron is hard2008-04-16Paper
Enumerating Spanning and Connected Subsets in Graphs and Matroids2008-03-11Paper
On enumerating minimal dicuts and strongly connected subgraphs2008-02-18Paper
On cyclically orientable graphs2007-12-12Paper
War and peace in veto voting2007-10-18Paper
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs2007-09-18Paper
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data2007-07-16Paper
Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction2007-05-02Paper
On the misere version of game Euclid and miserable games2007-03-15Paper
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory2007-02-19Paper
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms2007-02-07Paper
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation2007-01-09Paper
https://portal.mardi4nfdi.de/entity/Q34088462006-11-15Paper
Algorithms and Computation2006-11-14Paper
Perfect graphs, kernels, and cores of cooperative games2006-10-30Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
On the Complexity of Some Enumeration Problems for Matroids2006-06-01Paper
Computing and Combinatorics2006-01-11Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Algorithms – ESA 20042005-08-18Paper
Stable matchings in three-sided systems with cyclic preferences2005-02-22Paper
Dual-bounded generating problems: Weighted transversals of a hypergraph2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47368342004-08-11Paper
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices2004-03-11Paper
Difference graphs2004-02-14Paper
https://portal.mardi4nfdi.de/entity/Q44492022004-02-08Paper
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.2003-12-04Paper
An inequality for polymatroid functions and its applications.2003-10-14Paper
On maximal frequent and minimal infrequent sets in binary matrices2003-08-21Paper
https://portal.mardi4nfdi.de/entity/Q47085652003-06-18Paper
Recursive generation of partitionable graphs2003-03-19Paper
Camel sequences and quadratic residues2002-12-02Paper
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities2002-09-29Paper
https://portal.mardi4nfdi.de/entity/Q45350122002-06-12Paper
Generating dual-bounded hypergraphs2002-01-01Paper
Dual subimplicants of positive Boolean functions2001-11-16Paper
https://portal.mardi4nfdi.de/entity/Q27541792001-11-11Paper
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph2001-06-21Paper
Dual cores and effectivity functions2001-02-13Paper
Criteria of nonemptiness of dual cores2001-02-13Paper
Stable effectivity functions and perfect graphs2000-05-08Paper
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions2000-02-14Paper
https://portal.mardi4nfdi.de/entity/Q42429511999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42565581999-07-18Paper
Stable families of coalitions and normal hypergraphs1999-04-27Paper
A corrected version of the Duchet kernel conjecture1998-04-08Paper
https://portal.mardi4nfdi.de/entity/Q43411991998-04-02Paper
A circular graph---counterexample to the Duchet kernel conjecture1998-02-12Paper
https://portal.mardi4nfdi.de/entity/Q43633151997-11-18Paper
Extremal sequences with forbidden sums1997-10-29Paper
On the frequency of the most frequently occurring variable in dual monotone DNFs1997-10-06Paper
Perfect graphs are kernel solvable1997-05-04Paper
Decomposability of partially defined Boolean functions1996-03-11Paper
Trees as semilattices1996-01-21Paper
https://portal.mardi4nfdi.de/entity/Q43280921995-04-24Paper
https://portal.mardi4nfdi.de/entity/Q43239571995-03-23Paper
https://portal.mardi4nfdi.de/entity/Q43239861995-03-23Paper
https://portal.mardi4nfdi.de/entity/Q43159361995-01-31Paper
https://portal.mardi4nfdi.de/entity/Q43159751995-01-31Paper
Nikolai Ivanovich Lobachevskii (on the bicentenary of his birth)1994-08-02Paper
https://portal.mardi4nfdi.de/entity/Q42787411994-03-27Paper
Complex analysis and convolution operators1994-03-20Paper
https://portal.mardi4nfdi.de/entity/Q42785821994-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42786271994-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42784721994-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42784951994-03-07Paper
https://portal.mardi4nfdi.de/entity/Q52870451994-02-07Paper
https://portal.mardi4nfdi.de/entity/Q52870571994-02-07Paper
Enumerated graphs and their bilinear forms1994-02-01Paper
https://portal.mardi4nfdi.de/entity/Q46958251993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q46958661993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q46959381993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q39968361993-01-23Paper
https://portal.mardi4nfdi.de/entity/Q40065451992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q40065561992-09-26Paper
Tight cyclic game forms1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39803171992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39803571992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47105691992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47108721992-06-25Paper
Absolutely determined matrices1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30350741990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31976261990-01-01Paper
A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games1990-01-01Paper
Conditions of existence and uniqueness of a solution of problems of convex programming1990-01-01Paper
Quasilinear set functions and absolute definite matrices1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34766281989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38219791989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38241321989-01-01Paper
A criterion and verification of the ergodicity of cyclic game forms1989-01-01Paper
Cyclic games and an algorithm to find minimax cycle means in directed graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37984991988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38120771988-01-01Paper
A stochastic game with complete information and without equilibrium situations in pure stationary strategies1988-01-01Paper
The equivalence of the problems of circuit computation, optimal flows, and statical equilibrium1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37552361987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37895931987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37909801987-01-01Paper
The conditions of solubility by domination of concaven-person games1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47243791987-01-01Paper
Metric and ultrametric spaces of resistances1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37414411986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37068001984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37413621984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37416361984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37012271983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36666251982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39624951982-01-01Paper
Coalitional equilibrium situations in metagames1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38920981980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39179141977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41205191977-01-01Paper
The solvability of positional games in pure strategies1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41033601976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41190511976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41822941976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40825791975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47668391973-01-01Paper
On the Sprague-Grundy function of compound games0001-01-03Paper
More on discrete convexity0001-01-03Paper
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem0001-01-03Paper
Growing Trees and Amoebas' Replications0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vladimir A. Gurvich