Equilibrium Points in Bimatrix Games
    
    
  
  
  
      
      
      
        
Teoriâ veroâtnostej i ee primeneniâ, Tome 3 (1958) no. 3, pp. 318-331
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			An algorithm for computing all equilibrium points (situations) for the case of bimatrix (i.e., finite two-person, non-cooperative, non-zero-sum) games is given.
			
            
            
            
          
        
      @article{TVP_1958_3_3_a3,
     author = {N. N. Vorob'ev},
     title = {Equilibrium {Points} in {Bimatrix} {Games}},
     journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
     pages = {318--331},
     publisher = {mathdoc},
     volume = {3},
     number = {3},
     year = {1958},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_1958_3_3_a3/}
}
                      
                      
                    N. N. Vorob'ev. Equilibrium Points in Bimatrix Games. Teoriâ veroâtnostej i ee primeneniâ, Tome 3 (1958) no. 3, pp. 318-331. http://geodesic.mathdoc.fr/item/TVP_1958_3_3_a3/
