We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
We tackle the problem of real-time statistical analysis of functional magnetic resonance imaging (fMRI) data. In a recent paper, we proposed an incremental algorithm based on the e...
Alexis Roche, Philippe Pinel, Stanislas Dehaene, J...
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...