12 search results - page 3 / 3 » Fair On-line Gambling |
CIE
2010
Springer
13 years 8 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper formulates and studies a general continuous-time behavioral portfolio selection model under Kahneman and Tversky's (cumulative) prospect theory, featuring S-shaped...