Higher-Order Decision Theory
This paper investigates a surprising relationship between decision theory and proof theory. Using constructions originating in proof theory based on higher-order functions, so called quantifiers and selection functions, we show that these functionals model choice behavior of individual agents. Our framework is expressive, it captures classical theories such as utility functions and preference relations but it can also be used to faithfully model abstract goals such as coordination. It is directly implementable in functional programming languages. Lastly, modeling an agent with selection functions and quantifiers is modular and thereby allows to seamlessly combine agents bridging decision theory and game theory.
KeywordsDecision theory Utility functions Preferences Higher-order functions Quantifiers
- 5.Ghani, N., Hedges, J.: A compositional approach to economic game theory. CoRR, abs/1603.04641 (2016)Google Scholar
- 7.Hedges, J.: String diagrams for game theory. CoRR, abs/1503.06072 (2015)Google Scholar
- 9.Hedges, J., Oliva, P., Sprits, E., Winschel, V., Zahn, P.: Higher-order game theory. CoRR, abs/1506.01002 (2015)Google Scholar
- 10.Hedges, J., Shprits, E., Winschel, V., Zahn, P.: Compositionality and string diagrams for game theory. CoRR, abs/1604.06061 (2016)Google Scholar
- 11.Kahneman, D.: Thinking, Fast and Slow. Farrar, Straus and Giroux, New York (2011)Google Scholar