Parameterized Two-Player Nash Equilibrium

Details Parameterized Two-Player Nash Equilibrium Parameterized Two-Player Nash Equilibrium

2010-06-10

arxiv.org/abs/1006.2063v1

Computer Science

Computational Complexity

Scientific paper

We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement those results, by identifying three cases in which the problem becomes fixed-parameter tractable. These cases occur in the previously studied settings of sparse games and unbalanced games as well as in the newly considered case of locally bounded treewidth games that generalizes both these two cases.

Affiliated with

Also associated with

No associations

Rating

Parameterized Two-Player Nash Equilibrium 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 Parameterized Two-Player Nash Equilibrium, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameterized Two-Player Nash Equilibrium will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492444