See this document in CiteSeerX!

On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles (2002)  (Make Corrections)  (2 citations)
E. Boros, V. Gurvich



  Home/Search   Context   Related

 
View or download:
rutgers.edu/pub/dimacs/...200215.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rutgers.edu/TechnicalRepor...2002 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Let g be a positional game with perfect information modelled by a directed graph G = (V, E) which is finite but may have directed cycles. A local cost function f(i, e) is given for E. The players are allowed only pure stationary strategies, that is the move in any position is deterministic, and may depend only on this present position, not on the preceding positions or moves. Hence, the resulting play p is a directed path which begins in the initial position v 0 and either (i) ends in a final... (Update)

Cited by:   More
The Sylvester-Chvatal Theorem - Chen   (Correct)
Camel Sequences and Their Applications - Gurvich, Sheng (1999)   (Correct)

Similar documents (at the sentence level):
56.5%:   On Nash-solvability in pure stationary strategies of finite.. - Boros, Gurvich (2001)   (Correct)

Active bibliography (related documents):   More   All
0.4:   The Complexity of Mean Payoff Games on Graphs - Zwick, Paterson (1996)   (Correct)
0.4:   The Complexity of Mean Payo Games - Uri Zwick And   (Correct)
0.3:   Stable Effectivity Functions and Perfect Graphs - Boros, Gurvich (2000)   (Correct)

Similar documents based on text:   More   All
0.9:   An Incremental RNC Algorithm for Generating All Maximal.. - Boros, Elbassioni, al. (2000)   (Correct)
0.7:   A corrected version of the Duchet Kernel Conjecture - Boros, Gurvich (1996)   (Correct)
0.7:   Recursive Generation of Partitionable Graphs - Boros, Gurvich, Hougardy (1999)   (Correct)

BibTeX entry:   (Update)

E.Boros and V.Gurvich, On parallel edges in cycles, Dimacs Technical Report 99-28, Rutgers University. http://citeseer.ist.psu.edu/article/boros02nashsolvability.html   More

@misc{ boros-nash-solvability,
  author = "E. Boros and V. Gurvich",
  title = "On Nash-solvability in pure stationary strategies of finite...",
  url = "citeseer.ist.psu.edu/article/boros02nashsolvability.html" }
Citations (may not include all citations):
405   Depth-first search and linear graph algorithms (context) - Tarjan - 1972
102   A characterization of the minimum cycle mean in a digraph (context) - Karp - 1978
13   Two commodity flow (context) - Itai - 1978
12   The strategy of social choice (context) - Moulin - 1983
12   Nash-solvability of games in pure strategies (context) - Gurvich - 1988
5   Positional strategies for mean payo# games (context) - Ehrenfeucht, Mycielsky - 1979
5   Cyclic games and an algorithm to find minimax cycle means in.. (context) - Gurvich, Karzanov et al. - 1988
4   Cyclical games with prohibitions (context) - Karzanov, Lebedev - 1993
4   Solvability of games in pure strategies (context) - Gurvich - 1975
2   Optimal paths in network games with p players Discrete Appli.. (context) - Boliac, Lozovanu et al. - 2000
2   A stochastic game with perfect information and without Nash .. (context) - Gurvich - 1988
2   Positional games and the problem of information (context) - Kuhn - 1953
2   The existence theorem for Nash equilibrium in pure stationar.. (context) - Gurvich - 1990
2   Prolongement des jeux a deux joueurs de summe nulle (context) - Moulin - 1976
2   A criterion of tightness for returnable bipartite cyclic gam.. (context) - Golberg, Gurvich - 1992
2   Extensions of two-person zero-sum games (context) - Moulin - 1976
2   Tight cyclic game forms (context) - Golberg, Gurvich - 1991
2   Mean cost cyclical games (context) - Pisaruk - 1999
2   Mechanizmy gruppovogo vybora (context) - Danilov, Sotskov - 1991

Documents on the same site (http://dimacs.rutgers.edu/TechnicalReports/2002.html):   More
Expected Rank in Antimatroids - Gordon (2002)   (Correct)
A Classification of Antichains of Finite Tournaments - Latka (2002)   (Correct)
Deferred Assignment Scheduling in Clustered Web Servers - Ungureanu (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC