Evdokia Nikolova is a Ph.D. Candidate in the Theoretical Computer
Science group at MIT. She finished her BA and MS degrees at Harvard
University in 2002, in Applied Mathematics with Economics and in Computer
Science respectively. After that, supported by a Herchel Smith
Scholarship from Harvard, she spent a year in Cambridge University, where
she obtained the Certificate of Advanced Study in Mathematics with
Distinction.
Her research interests can be broadly defined as strategic algorithms
for computing domains, which encompasses complexity, algorithms,
optimization and game theory for a wide range of problems.
A Truthful Mechanism for Offline Ad Slot Scheduling.
[ps],
[pdf]
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal.
To appear in the First International Symposium on
Algorithmic Game Theory (SAGT '08), Padeborn, Germany, May '08.
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization.
[ps],
[pdf]
Jonathan Kelner, Evdokia Nikolova.
In Proceedings of FOCS '07, Providence, RI, October '07.
Incentive-Compatible Interdomain Routing with Linear Utilities.
[ps],
[pdf]
Alexander Hall, Evdokia Nikolova, and Christos Papadimitriou.
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.
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 '07.
Yiling Chen, Lance Fortnow, Evdokia Nikolova, David Pennock.
To appear in Proceedings of SIGecom Exchanges special issue on combinatorial auctions.
Theses
Evdokia Nikolova. Duality of the Gradient Method and
Lyapunov Functions in the context of Congestion Control.
[ps]
[pdf]
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.