A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Selection Equilibria of Higher-Order Games
[chapter]
2016
Lecture Notes in Computer Science
In applied game theory the modelling of each player's intentions and motivations is a key aspect. In classical game theory these are encoded in the payoff functions. In previous work [2,4] a novel way of modelling games was introduced where players and their goals are more naturally described by a special class of higher-order functions called quantifiers. We refer to these as higher-order games. Such games can be directly and naturally implemented in strongly typed functional programming
doi:10.1007/978-3-319-51676-9_9
fatcat:kxxoucibore3jp4roomgcvubxu