The Complexity of Iterated Strategy Elimination

Details The Complexity of Iterated Strategy Elimination The Complexity of Iterated Strategy Elimination

2009-10-27

arxiv.org/abs/0910.5107v2

Computer Science

Computational Complexity

Scientific paper

We consider the computational complexity of the question whether a certain
strategy can be removed from a game by means of iterated elimination of
dominated strategies. In particular, we study the influence of different
definitions of domination and of the number of different payoff values. In
addition, the consequence of restriction to constant-sum games is shown.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Iterated Strategy Elimination 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 The Complexity of Iterated Strategy Elimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Iterated Strategy Elimination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-483002