On the Complexity of Deciding Degeneracy in Games

Details On the Complexity of Deciding Degeneracy in Games On the Complexity of Deciding Degeneracy in Games

2009-05-19

arxiv.org/abs/0905.3012v1

Computer Science

Computer Science and Game Theory

Scientific paper

We show that it is NP-Complete to decide whether a bimatrix game is
degenerate and it is Co-NP-Complete to decide whether a bimatrix game is
nondegenerate.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Deciding Degeneracy in Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of Deciding Degeneracy in Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Deciding Degeneracy in Games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-699224