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...
التنسيق: | Working paper |
---|---|
منشور في: |
University of Oxford
2000
|
مواد مشابهة
-
On existence and uniqueness of a carrying simplex in Kolmogorov differential systems
حسب: Hou, Zhanyuan
منشور في: (2020) -
Second quantized Kolmogorov complexity
حسب: Rogers, C, وآخرون
منشور في: (2008) -
How Incomputable Is Kolmogorov Complexity?
حسب: Paul M.B. Vitányi
منشور في: (2020-04-01) -
Topological arguments for Kolmogorov complexity
حسب: Alexander Shen, وآخرون
منشور في: (2012-08-01) -
On existence and uniqueness of a modified carrying simplex for discrete Kolmogorov systems
حسب: Hou, Zhanyuan
منشور في: (2021)