Abstract
Many classes of two-player zero-sum stochastic games have the orderfield property; that is, if all payoffs and transitions belong to some field, so does the limit value. Is it also the case for absorbing games? No: In this note, we exhibit m×m absorbing games with rational data whose limit values are algebraic of degree m, for each m∈N⁎. Furthermore, we provide maximal conditions for the orderfield property to hold, namely if transitions are deterministic and one player has at most two actions. Last, we prove that any algebraic number of degree 2 is the limit value of a 2×2 absorbing game, which leads to the conjecture that any algebraic number of degree m is the limit value of an m×m absorbing game.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
