Abstract: Given an $n \times n$  rational matrix A, a vector $u \in \mathbb{Q}^n$ and an affine subspace $W \subset \mathbb{Q}^n$ , the affine subspace reachability problem asks whether there exists $t \in \mathbb{N}$ such that $A

Abstract: In a multi-armed bandit problem a gambler needs to choose at each round one of K arms, each characterized by an unknown reward distribution.

Abstract: Given n jobs with release dates, deadlines and processing times we consider the problem of scheduling them on m parallel machines so as to minimize the total energy consumed.

Abstract: We study the complexity of equilibrium computation in discrete preference games.

Abstract: Machine learning algorithms are getting used increasingly in making decisions in domains with social consequences. This leads to a natural concern about the biases the algorithms might learn from possibly biased historical data.