Optimal strategies for a game on amenable semigroups
From MaRDI portal
Publication:378345
Abstract: The semigroup game is a two-person zero-sum game defined on a semigroup S as follows: Players 1 and 2 choose elements x and y in S, respectively, and player 1 receives a payoff f(xy) defined by a function f from S to [-1,1]. If the semigroup is amenable in the sense of Day and von Neumann, one can extend the set of classical strategies, namely countably additive probability measures on S, to include some finitely additive measures in a natural way. This extended game has a value and the players have optimal strategies. This theorem extends previous results for the multiplication game on a compact group or on the positive integers with a specific payoff. We also prove that the procedure of extending the set of allowed strategies preserves classical solutions: if a semigroup game has a classical solution, this solution solves also the extended game.
Recommendations
Cites work
- scientific article; zbMATH DE number 3123490 (Why is no real title available?)
- scientific article; zbMATH DE number 3706692 (Why is no real title available?)
- scientific article; zbMATH DE number 45383 (Why is no real title available?)
- scientific article; zbMATH DE number 193576 (Why is no real title available?)
- scientific article; zbMATH DE number 2123347 (Why is no real title available?)
- scientific article; zbMATH DE number 3061365 (Why is no real title available?)
- Amenable semigroups
- An ultrafilter approach to Jin's theorem
- Finitely additive and epsilon Nash equilibria
- On Topologically Invariant Means on a Locally Compact Group
- On a Theorem of De Finetti, Oddsmaking, and Game Theory
- Semigroups Satisfying a Strong Folner Condition
- Syndetic sets and amenability
- The multiplication game
Cited in
(2)
This page was built for publication: Optimal strategies for a game on amenable semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378345)