Computer Science – Computer Science and Game Theory
Scientific paper
2010-03-22
Computer Science
Computer Science and Game Theory
Scientific paper
We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of the rock-scissors-paper variety. Thus, in many interesting examples, like 2x2 games, Cournot duopoly, price competition, rent seeking, public goods games, common pool resource games, minimum effort coordination games, arms race, search, bargaining, etc., imitation cannot be beaten by much even by a very clever opponent.
Duersch Peter
Oechssler Joerg
Schipper Burkhard C.
No associations
LandOfFree
Unbeatable Imitation 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 Unbeatable Imitation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unbeatable Imitation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-210761