Abstract
We show that every indeterministic n-agent choice model \(M^i\) can be transformed into a deterministic n-agent choice model \(M^d\), such that \(M^i\) is a bounded morphic image of \(M^d\). This generalizes an earlier result from Van Benthem and Pacuit [16] about finite two-player choice models. It further strengthens the link between STIT logic and game theory, because deterministic choice models correspond in a straightforward way to normal game forms, and choice models are generally used to interpret STIT logic.
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.
