Backward Induction for Repeated Games
We present a method of backward induction for computing approximate subgame perfect Nash equilibria of infinitely repeated games with discounted payoffs. This uses the selection monad transformer, combined with the searchable set monad viewed as a notion of ‘topologically compact’ nondeterminism, an...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Published: |
Open Publishing Association
2018
|