On Kolmogorov complexity and the costs of carrying out strategies
It is common to model costs of carrying out strategies in games in relation to the complexity, in some sense, of the strategies. We show a particularly general definition of complexity for this purpose, one that subsumes many alternatives as special cases. We explore how this definition can be used...
Format: | Working paper |
---|---|
Udgivet: |
University of Oxford
2000
|
Lignende værker
-
On existence and uniqueness of a carrying simplex in Kolmogorov differential systems
af: Hou, Zhanyuan
Udgivet: (2020) -
Second quantized Kolmogorov complexity
af: Rogers, C, et al.
Udgivet: (2008) -
How Incomputable Is Kolmogorov Complexity?
af: Paul M.B. Vitányi
Udgivet: (2020-04-01) -
Topological arguments for Kolmogorov complexity
af: Alexander Shen, et al.
Udgivet: (2012-08-01) -
On existence and uniqueness of a modified carrying simplex for discrete Kolmogorov systems
af: Hou, Zhanyuan
Udgivet: (2021)