Finite State Machines Play Extensive-Form Games

Branislav Bosanský
Branislav Bosanský

EC '20: The 21st ACM Conference on Economics and Computation Virtual Event Hungary July, 2020, pp. 509-533, 2020.

Cited by: 0|Bibtex|Views25|DOI:https://doi.org/10.1145/3391403.3399517
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

Finite state machines are a well-known representation of strategies in (in)finitely repeated or stochastic games. Actions of players correspond to states in the machine and the transition between machine-states are caused by observations in the game. For extensive-form games (EFGs), machines can act as a formal grounding for abstraction m...More

Code:

Data:

Your rating :
0

 

Tags
Comments