# The complexity of uniform Nash equilibria and related regular subgraph problems

@article{Bonifaci2008TheCO, title={The complexity of uniform Nash equilibria and related regular subgraph problems}, author={Vincenzo Bonifaci and Ugo Di Iorio and Luigi Laura}, journal={Theor. Comput. Sci.}, year={2008}, volume={401}, pages={144-152} }

- Published 2008 in Theor. Comput. Sci.
DOI:10.1016/j.tcs.2008.03.036

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 results for the problems of finding regular induced subgraphs of large size or regularity, which can be of independent interest. © 2008… CONTINUE READING

#### Citations

##### Publications citing this paper.

Showing 1-7 of 7 extracted citations

## Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems

View 4 Excerpts

Highly Influenced

## Single Parameter FPT-Algorithms for Non-trivial Games

View 7 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 27 references

## Complexity Results about Nash Equilibria

View 4 Excerpts

Highly Influenced

## Nash and Correlated Equilibria : Some Complexity Considerations

View 4 Excerpts

Highly Influenced

## The Complexity of Computing a Nash Equilibrium

View 1 Excerpt

## Computing correlated equilibria in multi-player games

View 1 Excerpt

## Maximum k -regular induced subgraphs

View 1 Excerpt