Evdokia Nikolova is an Assistant Professor in the Department of Computer Science and Engineering at Texas A&M University. Previously, she was a postdoctoral associate in the Computer Science
and Artificial Intelligence Laboratory at MIT, working with Prof. Hari
Balakrishnan.
She graduated with a
BA in Applied Mathematics with Economics from Harvard University,
MS in Mathematics from Cambridge University, U.K. and
Ph.D. in Computer Science from MIT.
Evdokia Nikolova's research aims to improve the design and efficiency of complex systems (such as networks and electronic markets), by integrating stochastic, dynamic and economic analysis.
She is very interested in how the abundance of data and information
can enhance the interaction of people, markets and technology in order
to improve human lives. Her internships with Google and Yahoo!
Research as a Ph.D. student convinced her of the need for an
inherently interdisciplinary approach combining Computer Science &
Engineering, Operations Research and Economics for solving
practically relevant problems (such as the design of information
markets and sponsored search mechanisms). Her recent work examines
how human risk aversion transforms traditional computational models
and solutions. One of her algorithms has been adapted in the MIT
CarTel
project for traffic-aware routing. She currently focuses on
integrating risk-aversion in game theoretic models of stochastic
network routing.
A Mean-Risk Model for the Stochastic Traffic Assignment Problem
Evdokia Nikolova, Nicolas E. Stier Moses.
Full version: Columbia Working Paper # DRO-2011-03, May 2011. This version: December 2011.
[pdf]
Conference: (with title Stochastic Selfish Routing)
[pdf]
In Proceedings of the Fourth Symposium on Algorithmic Game Theory (SAGT '11), Salerno, Amalfi Coast, Italy, Lecture Notes in Computer Science, Springer, Berlin, 2011.
Approximation Algorithms for Offline Risk-averse Combinatorial Optimization
Conference:
[pdf]
(with title Approximation Algorithms for Reliable Stochastic Combinatorial Optimization.)
In Proceedings of APPROX '10, Barcelona, Spain, 2010.
High-performance heuristics for optimization in stochastic traffic engineering
problems
[ps],
[pdf]
Evdokia Nikolova.
In Proceedings of the Seventh International Conference on Large-Scale Scientific Computing (LSSC), 2009.
Offline Ad Slot Scheduling
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal.
Conference:
[pdf]
(with title A Truthful Mechanism for Offline Ad Slot Scheduling)
In Proceedings of the First International Symposium on
Algorithmic Game Theory (SAGT '08), Padeborn, Germany, May 2008.
Route Planning under Uncertainty: The Canadian Traveller Problem
[ps],
[pdf]
Evdokia Nikolova, David Karger.
In Proceedings of the Twenty-Third Conference on Artificial
Intelligence (AAAI), Chicago, IL, July 2008.
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
[ps],
[pdf]
Jonathan Kelner, Evdokia Nikolova.
In Proceedings of FOCS '07, Providence, RI, October 2007.
Incentive-Compatible Interdomain Routing with Linear Utilities
Alexander Hall, Evdokia Nikolova, and Christos Papadimitriou.
Conference:
[pdf]
In Proceedings of the 3rd International Workshop On Internet And Network Economics (WINE 2007), LNCS 4858, Springer Verlag, San Diego, USA, pages 232-244, December 2007.
Journal:
[pdf]
Internet Mathematics. Volume 5, Number 4 (2008), 395-410. (Special Issue for Selected papers from WINE'07.)
A Strategic Model for Information Markets
[ps],
[pdf]
Evdokia Nikolova, Rahul Sami.
In Proceedings of Eighth ACM Conference on Electronic Commerce (EC '07), San Diego, CA, June 2007.
Ph.D. Thesis,
Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Duality of the Gradient Method and
Lyapunov Functions in the context of Congestion Control.
[ps]
[pdf]
Evdokia Nikolova.
Math Tripos Essay, Cambridge University, 2003.
*Small Print
The documents distributed here have been provided as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.