Optimal strategies for a game on amenable semigroups

From MaRDI portal
Publication:378345

DOI10.1007/S00182-012-0345-7zbMATH Open1302.91041arXiv1104.3098OpenAlexW3100699414MaRDI QIDQ378345FDOQ378345


Authors: Valerio Capraro, Kent E. Morrison Edit this on Wikidata


Publication date: 11 November 2013

Published in: International Journal of Game Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1104.3098




Recommendations




Cites Work


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)