The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Nash-solvability (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2003-2024 (10)
Publication types (Num. hits)
article(8) inproceedings(2)
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
56Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen On Acyclicity of Games with Cycles. Search on Bibsonomy AAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Positional game, game form, improvement cycle, restricted improvement cycle, restricted acyclicity, Nash-solvability, Nash equilibrium
27Vladimir Gurvich, Mariya Naumova Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
27Vladimir Gurvich, Mariya Naumova On Nash-Solvability of Finite Two-Person Tight Vector Game Forms. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
27Vladimir Gurvich On Nash-solvability of finite n-person deterministic graphical games; Catch 22. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
27Vladimir Gurvich On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
27Vladimir Gurvich, Mariya Naumova On Nash-solvability of n-person graphical games under Markov's and a priori realizations. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
27Vladimir 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 Discret. Appl. Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
27Endre Boros, Ondrej Cepek, Vladimir Gurvich Total tightness implies Nash-solvability for three-person game forms. Search on Bibsonomy Discret. Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
27Endre 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 CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Endre Boros, Vladimir Gurvich On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. Search on Bibsonomy Math. Soc. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #10 of 10 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license