Computer Science – Computer Science and Game Theory
Scientific paper
2011-04-15
Computer Science
Computer Science and Game Theory
14 pages
Scientific paper
We extend the theorem about optimal strategies for the multiplication game on compact groups to the setting of amenable semigroups. This answers the question posed by the second author about the existence of optimal strategies in the case of non-compact groups. We give a formal definition for the operation game to be loaded and we show there exist operation games that are loadable in uncountably many different ways. Finally, we introduce a new class of winning sets for which the value of the game does not depend on the loading. In particular, these are examples of games that admit infinitely many different optimal strategies.
Capraro Valerio
Morrison Kent
No associations
LandOfFree
Existence of optimal strategies for the Operation Game on amenable semigroups 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 Existence of optimal strategies for the Operation Game on amenable semigroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Existence of optimal strategies for the Operation Game on amenable semigroups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-9159