Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
In this paper, we propose a novel general framework for analysing competing double auction markets that vie for traders, who then need to choose which market to go to. Based on th...
Bing Shi, Enrico H. Gerding, Perukrishnen Vyteling...
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
Although emotions elicited by the fictional world or the artefact play a part in story-driven video games, they are certainly not the focus of the experience. From a cognitive psy...
Abstract. We study the decision theory of a maximally risk-averse investor — one whose objective, in the face of stochastic uncertainties, is to minimize the probability of ever ...
Noam Berger, Nevin Kapur, Leonard J. Schulman, Vij...