Sequential Language-based Decisions

Adam Bjorndahl
(Carnegie Mellon University)
Joseph Y. Halpern
(Cornell University)

In earlier work, we introduced the framework of language-based decisions, the core idea of which was to modify Savage's classical decision-theoretic framework by taking actions to be descriptions in some language, rather than functions from states to outcomes, as they are defined classically. Actions had the form "if psi then do(phi)", where psi and phi were formulas in some underlying language, specifying what effects would be brought about under what circumstances. The earlier work allowed only one-step actions. But, in practice, plans are typically composed of a sequence of steps. Here, we extend the earlier framework to sequential actions, making it much more broadly applicable. Our technical contribution is a representation theorem in the classical spirit: agents whose preferences over actions satisfy certain constraints can be modeled as if they are expected utility maximizers. As in the earlier work, due to the language-based specification of the actions, the representation theorem requires a construction not only of the probability and utility functions representing the agent's beliefs and preferences, but also the state and outcomes spaces over which these are defined, as well as a "selection function" which intuitively captures how agents disambiguate coarse descriptions. The (unbounded) depth of action sequencing adds substantial interest (and complexity!) to the proof.

In Rineke Verbrugge: Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge (TARK 2023), Oxford, United Kingdom, 28-30th June 2023, Electronic Proceedings in Theoretical Computer Science 379, pp. 131–141.
Published: 11th July 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.379.12 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org