Researchers with theoretical and computational expertise in polyhedral computation discuss combinatorial properties of linear program digraphs, combinatorial techniques for monotone generation problems, polyhedral representation conversion up to symmetries, the multi-parametric linear complementarity problem with sufficient matrices, hyperplane arrangements with large average diameter, and the Nash equilibria of rank-1 games.

In the private duopoly, (DE, FMS) and (FMS, DE) are Nash equilibria if [[sigma].

It should be noted that a dominant action equilibrium is also a Nash Equilibrium, (38) and further, that there can be multiple Nash Equilibria or no Nash Equilibria at all.