Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website
@article{JGAA_2007_11_1_a12, author = {Louigi Addario-Berry and Neil Olver and Adrian Vetta}, title = {A {Polynomial} {Time} {Algorithm} for {Finding} {Nash} {Equilibria} in {Planar} {Win-Lose} {Games}}, journal = {Journal of Graph Algorithms and Applications}, pages = {309--319}, publisher = {mathdoc}, volume = {11}, number = {1}, year = {2007}, doi = {10.7155/jgaa.00147}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00147/} }
TY - JOUR AU - Louigi Addario-Berry AU - Neil Olver AU - Adrian Vetta TI - A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games JO - Journal of Graph Algorithms and Applications PY - 2007 SP - 309 EP - 319 VL - 11 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00147/ DO - 10.7155/jgaa.00147 LA - en ID - JGAA_2007_11_1_a12 ER -
%0 Journal Article %A Louigi Addario-Berry %A Neil Olver %A Adrian Vetta %T A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games %J Journal of Graph Algorithms and Applications %D 2007 %P 309-319 %V 11 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00147/ %R 10.7155/jgaa.00147 %G en %F JGAA_2007_11_1_a12
Louigi Addario-Berry; Neil Olver; Adrian Vetta. A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. Journal of Graph Algorithms and Applications, Tome 11 (2007) no. 1, pp. 309-319. doi : 10.7155/jgaa.00147. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00147/
Cité par Sources :