We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
We consider multi-period portfolio selection problems for a decision maker with a specified utility function when the variance of security returns is described by a discrete time ...
Today there are solutions for some specific turn-taking problems, but no general model. We show how turn-taking can be reduced to two more general problems, prediction and selecti...
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...