Solving Min-Max Problems with Applications to Games

Details Solving Min-Max Problems with Applications to Games Solving Min-Max Problems with Applications to Games

2008-01-27

arxiv.org/abs/0801.4130v1

Computer Science

Computer Science and Game Theory

Scientific paper

We refine existing general network optimization techniques, give new characterizations for the class of problems to which they can be applied, and show that they can also be used to solve various two-player games in almost linear time. Among these is a new variant of the network interdiction problem, where the interdictor wants to destroy high-capacity paths from the source to the destination using a vertex-wise limited budget of arc removals. We also show that replacing the limit average in mean payoff games by the maximum weight results in a class of games amenable to these techniques.

Affiliated with

Also associated with

No associations

Rating

Solving Min-Max Problems with Applications to 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 Solving Min-Max Problems with Applications to Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Min-Max Problems with Applications to Games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313660