受强制性开放获取政策约束的文章 - Vladimir Gurvich了解详情
无法在其他位置公开访问的文章：2 篇
Avoidable vertices and edges in graphs: Existence, characterization, and applications
J Beisegel, M Chudnovsky, V Gurvich, M Milanič, M Servatius
Discrete Applied Mathematics 309, 285-300, 2022
强制性开放获取政策： Slovenian Research Agency
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden subgames
E Boros, K Elbassioni, V Gurvich, K Makino, V Oudalov
International journal of game theory 45, 1111-1131, 2016
强制性开放获取政策： US National Science Foundation
可在其他位置公开访问的文章：13 篇
On graphs whose maximal cliques and stable sets intersect
DV Andrade, E Boros, V Gurvich
Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th …, 2018
强制性开放获取政策： US National Science Foundation
On equistable, split, CIS, and related classes of graphs
E Boros, V Gurvich, M Milanič
Discrete Applied Mathematics 216, 47-66, 2017
强制性开放获取政策： US National Science Foundation, Slovenian Research Agency
Markov decision processes and stochastic games with total effective payoff
E Boros, K Elbassioni, V Gurvich, K Makino
Annals of Operations Research, 1-29, 2018
强制性开放获取政策： US National Science Foundation
A three-person deterministic graphical game without Nash equilibria
E Boros, V Gurvich, M Milanič, V Oudalov, J Vičič
Discrete Applied Mathematics 243, 21-38, 2018
强制性开放获取政策： US National Science Foundation, Slovenian Research Agency
Avoidable vertices and edges in graphs
J Beisegel, M Chudnovsky, V Gurvich, M Milanič, M Servatius
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
强制性开放获取政策： Slovenian Research Agency
A convex programming-based algorithm for mean payoff stochastic games with perfect information
E Boros, K Elbassioni, V Gurvich, K Makino
Optimization Letters 11, 1499-1512, 2017
强制性开放获取政策： Federal Ministry of Education and Research, Germany
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
E Boros, V Gurvich, M Milanič
Journal of graph theory 94 (3), 364-397, 2020
强制性开放获取政策： Slovenian Research Agency
A potential reduction algorithm for two-person zero-sum mean payoff stochastic games
E Boros, K Elbassioni, V Gurvich, K Makino
Dynamic games and applications 8 (1), 22-41, 2018
强制性开放获取政策： US National Science Foundation
A nested family of k k-total effective rewards for positional games
E Boros, K Elbassioni, V Gurvich, K Makino
International journal of game theory 46, 263-293, 2017
强制性开放获取政策： US National Science Foundation, Federal Ministry of Education and Research …
Shifting paths to avoidable ones
V Gurvich, M Krnc, M Milanič, M Vyalyi
Journal of Graph Theory 100 (1), 69-83, 2022
强制性开放获取政策： Slovenian Research Agency
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions
E Boros, K Elbassioni, M Fouz, V Gurvich, K Makino, B Manthey
Algorithmica 80, 3132-3157, 2018
强制性开放获取政策： US National Science Foundation, Federal Ministry of Education and Research …
Dataset of Feasible, Edmonds' and Geographic Bi-Vectors and Tri-Vectors
E Boros, V Gurvich, M Krnc, M Milanič, J Vičič
Edmonds' and Geographic Bi-Vectors and Tri-Vectors, 2023
强制性开放获取政策： Slovenian Research Agency
A three-person chess-like game without Nash equilibria
E Boros, V Gurvich, M Milanic, V Oudalov, J Vicic
arXiv preprint arXiv:1610.07701, 2016
强制性开放获取政策： US National Science Foundation, Slovenian Research Agency
出版信息和资助信息由计算机程序自动确定