: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...