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 |
---|---|
Publié: |
University of Oxford
2000
|
Documents similaires
-
On existence and uniqueness of a carrying simplex in Kolmogorov differential systems
par: Hou, Zhanyuan
Publié: (2020) -
Second quantized Kolmogorov complexity
par: Rogers, C, et autres
Publié: (2008) -
How Incomputable Is Kolmogorov Complexity?
par: Paul M.B. Vitányi
Publié: (2020-04-01) -
Topological arguments for Kolmogorov complexity
par: Alexander Shen, et autres
Publié: (2012-08-01) -
On existence and uniqueness of a modified carrying simplex for discrete Kolmogorov systems
par: Hou, Zhanyuan
Publié: (2021)