## Organisers:

## Time:

## Venue:

**Abstract: **The year was 1953. Rajendra Prasad was still the president of India after winning the presidential election one year prior.

Speaker:

Suhail Sherif, TIFR

Friday, 8 November 2019, 17:15 to 18:15

**Abstract: **The year was 1953. Rajendra Prasad was still the president of India after winning the presidential election one year prior.

Speaker:

Anirban Bhattacharjee, TIFR

Friday, 18 October 2019, 17:15 to 18:15

**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.

Kshitij Gajjar (IIIT Delhi) and Prerona Chatterjee (STCS, TIFR)

Friday, 11 October 2019, 17:15 to 18:15

**Abstract: **In this talk, we will explore a surprising connection between graph theory and convex geometry. We look at graphs whose edge weights are linear forms in $d$ variables.

Speaker:

Gunjan Kumar, TIFR

Friday, 4 October 2019, 17:15 to 18:15

**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.

Speaker:

Prerona Chatterjee, TIFR

Friday, 13 September 2019, 17:15 to 18:15

Abstract: A polynomial is said to be multilinear if the individual degree of every variable is at most one in any monomial; and is said to be homogeneous if every monomial in it has the same degree.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 6 September 2019, 17:15 to 18:15

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

Abhishek Khetan

Friday, 30 August 2019, 17:15 to 18:15

**Abstract:** Suppose an ant is walking on the unit circle following a certain algorithm.

Speaker:

Varun Narayanan, TIFR

Friday, 23 August 2019, 17:15 to 18:15

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.

Speaker:

Gunjan Kumar, TIFR

Friday, 16 August 2019, 17:15 to 18:45

Abstract: The equivalence of optimization and separation is a widely used tool. The reduction from optimization to separation is particularly useful for, e.g., solving linear programs with exponential constraints.

Speaker:

Anamay Tengse, TIFR

Friday, 9 August 2019, 17:15 to 18:45

**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.