Ugo Di Iorio

Learn More
We are interested in the complexity of finding Nash equilibria with one uniformly mixed strategy (that is, equilibria in which at least one played strategy is a uniform probability function). We show that, even in imitation bimatrix games, where one player has a positive payoff if he plays the same pure strategy as the opponent, deciding the existence of(More)
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose bimatrix games, deciding the existence of such uniform equilibria is an NP-complete problem. Our proof is graph-theoretical. Motivated by this result, we also give NP-completeness(More)
  • 1