|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings, pp. 15-28, 2009, Springer, 978-3-642-02157-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 92(1), pp. 49-57, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
27 | Vladimir Gurvich, Mariya Naumova |
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.10241, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Vladimir Gurvich |
On Nash-solvability of finite n-person deterministic graphical games; Catch 22. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.06278, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Vladimir Gurvich |
On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.07177, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Vladimir Gurvich, Mariya Naumova |
On Nash-solvability of n-person graphical games under Markov's and a priori realizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.07542, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 167, pp. 131-143, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
27 | Endre Boros, Ondrej Cepek, Vladimir Gurvich |
Total tightness implies Nash-solvability for three-person game forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 312(8), pp. 1436-1443, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 99-109, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Soc. Sci. ![In: Math. Soc. Sci. 46(2), pp. 207-241, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|