On the Absence of Predictive Complexity for Some Games

Yuri Kalnishkan; M V  Vyugin

doi:10.1007/3-540-36169-3_15

On the Absence of Predictive Complexity for Some Games

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Algorithmic Learning Theory 13th International Conference, ALT 2002, Proceedings
Subtitle of host publication	volume 2533 of Lecture Notes in Artificial Intelligence
Publisher	Springer
DOIs	https://doi.org/10.1007/3-540-36169-3_15
Publication status	Published - 2002

Publication series

Name	Lecture Notes in Artificial Intelligence
Publisher	Springer
Volume	2533

Access to Document

10.1007/3-540-36169-3_15

Cite this

@inproceedings{c27f3e6063da4d9c8543814e33b5487b,

title = "On the Absence of Predictive Complexity for Some Games",

author = "Yuri Kalnishkan and Vyugin, {M V}",

year = "2002",

doi = "10.1007/3-540-36169-3_15",

language = "English",

series = "Lecture Notes in Artificial Intelligence",

publisher = "Springer",

booktitle = "Algorithmic Learning Theory 13th International Conference, ALT 2002, Proceedings",

}

On the Absence of Predictive Complexity for Some Games. / Kalnishkan, Yuri; Vyugin, M V .
Algorithmic Learning Theory 13th International Conference, ALT 2002, Proceedings: volume 2533 of Lecture Notes in Artificial Intelligence. Springer, 2002. (Lecture Notes in Artificial Intelligence; Vol. 2533).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - On the Absence of Predictive Complexity for Some Games

AU - Kalnishkan, Yuri

AU - Vyugin, M V

PY - 2002

Y1 - 2002

U2 - 10.1007/3-540-36169-3_15

DO - 10.1007/3-540-36169-3_15

M3 - Conference contribution

T3 - Lecture Notes in Artificial Intelligence

BT - Algorithmic Learning Theory 13th International Conference, ALT 2002, Proceedings

PB - Springer

ER -