#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2001

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
- Theor. Comput. Sci.
- 2008

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 NPcompleteness… (More)

- Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
- FCT
- 2005

- Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
- WINE
- 2005

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)

- Daniele Nardi, Vincenzo Bonifaci, +5 authors Fabio Zonfrilli
- RoboCup
- 2001

- ‹
- 1
- ›