_version_ |
1797064735558991872
|
collection |
OXFORD
|
description |
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 and developed, and illustrate with applications to the analysis of two player finite repeated games.
|
first_indexed |
2024-03-06T21:18:36Z
|
format |
Working paper
|
id |
oxford-uuid:40a9586b-542a-4e1d-be0b-eba8377573cf
|
institution |
University of Oxford
|
last_indexed |
2024-03-06T21:18:36Z
|
publishDate |
2000
|
publisher |
University of Oxford
|
record_format |
dspace
|
spelling |
oxford-uuid:40a9586b-542a-4e1d-be0b-eba8377573cf2022-03-26T14:39:05ZOn Kolmogorov complexity and the costs of carrying out strategiesWorking paperhttp://purl.org/coar/resource_type/c_8042uuid:40a9586b-542a-4e1d-be0b-eba8377573cfSymplectic ElementsBulk import via SwordUniversity of Oxford2000It 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 and developed, and illustrate with applications to the analysis of two player finite repeated games.
|
spellingShingle |
On Kolmogorov complexity and the costs of carrying out strategies
|
title |
On Kolmogorov complexity and the costs of carrying out strategies
|
title_full |
On Kolmogorov complexity and the costs of carrying out strategies
|
title_fullStr |
On Kolmogorov complexity and the costs of carrying out strategies
|
title_full_unstemmed |
On Kolmogorov complexity and the costs of carrying out strategies
|
title_short |
On Kolmogorov complexity and the costs of carrying out strategies
|
title_sort |
on kolmogorov complexity and the costs of carrying out strategies
|