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) -
On existence and uniqueness of a modified carrying simplex for discrete Kolmogorov systems
מאת: Hou, Zhanyuan
יצא לאור: (2021) -
Second quantized Kolmogorov complexity
מאת: Rogers, C, et al.
יצא לאור: (2008) -
How Incomputable Is Kolmogorov Complexity?
מאת: Paul M.B. Vitányi
יצא לאור: (2020-04-01) -
Topological arguments for Kolmogorov complexity
מאת: Alexander Shen, et al.
יצא לאור: (2012-08-01)