|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
56 | Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen |
On Acyclicity of Games with Cycles. |
AAIM |
2009 |
DBLP DOI BibTeX RDF |
Positional game, game form, improvement cycle, restricted improvement cycle, restricted acyclicity, Nash-solvability, Nash equilibrium |
27 | Vladimir Gurvich, Mariya Naumova |
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms. |
Ann. Math. Artif. Intell. |
2024 |
DBLP DOI BibTeX RDF |
|
27 | Vladimir Gurvich, Mariya Naumova |
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Vladimir Gurvich |
On Nash-solvability of finite n-person deterministic graphical games; Catch 22. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
27 | Vladimir Gurvich |
On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
27 | Vladimir Gurvich, Mariya Naumova |
On Nash-solvability of n-person graphical games under Markov's and a priori realizations. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
27 | 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. |
2014 |
DBLP DOI BibTeX RDF |
|
27 | Endre Boros, Ondrej Cepek, Vladimir Gurvich |
Total tightness implies Nash-solvability for three-person game forms. |
Discret. Math. |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov |
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Endre Boros, Vladimir Gurvich |
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. |
Math. Soc. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|