## Organisers:

## Time:

## Venue:

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

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.

Speaker:

Kshitij Gajjar, TIFR

Thursday, 1 August 2019, 16:00 to 17:00

**Abstract:** A bunch of disjoint axis-parallel rectangles are drawn on a single piece of paper.

Speaker:

Suhail Sherif, TIFR

Friday, 26 July 2019, 17:15 to 18:15

**Abstract:** Decision trees form a basic model of computation, with connections to many areas in complexity and approximation theory.

Speaker:

Suneel Sarswat, TIFR

Friday, 19 July 2019, 16:00 to 17:00

**Abstract:** In this talk, we introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade.

Speaker:

Anand Deo, TIFR

Friday, 28 June 2019, 17:15 to 18:15

Abstract: We analyse the equilibrium behaviour of a large network of banks in presence of incomplete information, where inter-bank borrowing and lending is allowed, and banks suffer shocks to assets.

Speaker:

Tulasi mohan Molli, TIFR

Friday, 21 June 2019, 17:15 to 18:15

Abstract:

The $delta$-coin problem asks if a given function can distinguish between coins which are sampled independently with the probability of heads being $1/2+ \delta$ and those where the probability of heads is 1/2.