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.

Abstract: A complex number z is said to be algebraic, if there is a univariate f(x) with real coefficients such that f(z)=0. For instance i, the square root of -1, is algebraic with f(x) being x^2 + 1.