Computer Science – Computer Science and Game Theory
Scientific paper
2010-03-22
Computer Science
Computer Science and Game Theory
Scientific paper
It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure saddle point. Further sufficient conditions for existence are provided. We apply our theory to a rich collection of examples by noting that the class of symmetric two-player zero-sum games coincides with the class of relative payoff games associated with symmetric two-player games. This allows us to derive results on the existence of a finite population evolutionary stable strategies.
Duersch Peter
Oechssler Joerg
Schipper Burkhard C.
No associations
LandOfFree
Pure Saddle Points and Symmetric Relative Payoff 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 Pure Saddle Points and Symmetric Relative Payoff Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pure Saddle Points and Symmetric Relative Payoff Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-210768