Elisa Celis' research interests include Algorithms, Probability, and Economics/Game Theory. She has worked on a variety of problems that have arisen with the advent of Web 2.0 such as Online Advertising and Crowdsourcing. She is also interested in mechanism design and learning where information acquisition is present, particularly due to social networks. Some notable honors include being selected for for China Theory Week 2011 and receiving the Yahoo! Key Scienti?c Challenges (KSC) Prize 2011. Her Ph.D. was funded by the National Physical Science Consortium Fellowship.
Prior to joining EPFL, she worked as a Research Scientist at Xerox Research Centre India for two years. During her Ph.D. She interned at Microsoft Research Redmond (2008), Microsoft Research New England (2010), Microsoft Research SVC (2011), and Yahoo! Research Labs (2011). She also participated in the Semester on Algorithmic Game Theory at the Institute of Advanced Studies at the Hebrew University in Jerusalem in 2011.
Incentivizing performance, maintaining privacy, maximizing efficiency.
Learning on networks:
Information cascades and free-rider effects, cost of network on learning.
Source localization, metric and double-metric dimension of graphs, hardness and approximation algorithms.
Learning under constrained adversaries, learning with stochastic drift.
Incentivizing performance, tournaments, graphical games.
|Ph.D.||Computer Science||University of Washington||2012|
|M.Sci.||Mathematics||University of Washington||2008|
|B.Sci||Computer Science and Mathematics||Harvey Mudd College||2006|