Arpita Biswas is a PhD student at the Department of Computer Science and Automation (CSA), Indian Institute of Science (IISc) since August 2016. She is also a recipient of the Google PhD Fellowship 2016. Her PhD advisors are Prof. Y. Narahari and Prof. Siddharth Barman. Her broad areas of interests include Game Theory, Optimization and Machine Learning. She is presently looking at problems in Computational Social Choice Theory and Fairness in Machine Learning. In Computational Social Choice Theory, she is working on the existence and hardness of various fairness notions while partitioning indivisible goods among agents. She has prior experience in multi-agent learning (multi-armed bandit), incentive mechanisms, facility location, planning and scheduling etc. and thus far she has worked on problems arising from real-world scenarios like online crowd-sourcing, resource allocation, dynamic pricing in transportation etc.

Prior to joining PhD at IISc, she worked as a Research Engineer at Xerox Research Centre India (XRCI), Bangalore in the Algorithms and Optimization team (July 2014 – July 2016).

She completed her Masters in Engineering from Dept of CSA, IISc (2012-2014) with thesis titled “A Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks”.