Evdokia Nikolova
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 complex computing domains,
which encompasses complexity, algorithms,
optimization and game theory for a wide range of problems.
Research area:
Computational Economics and Game Theory;
Algorithms and Combinatorial Optimization;
Stochastic and Nonconvex Optimization;
- 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.
- A Strategic Model for Information Markets.
[ps],
[pdf]
- Evdokia Nikolova, Rahul Sami.
- In Proceedings of Eighth ACM Conference on Electronic Commerce (ACM EC '07), San Diego, CA, June '07.
- 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.
- Stochastic Shortest Paths via Quasi-Convex Maximization.
[ps],
[pdf]
- Evdokia Nikolova, Jonathan Kelner, Matthew Brand
and Michael Mitzenmacher.
- In Proceedings of 2006 European Symposium of Algorithms (ESA '06), Zurich, Sep '06.
- 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.
- Betting on Permutations
[ps],
[pdf]
- Yiling Chen, Lance Fortnow, Evdokia Nikolova, David Pennock.
- In Proceedings of Eighth ACM Conference on Electronic Commerce (EC '07), San Diego, CA, June '07.
- Stochastic Shortest Paths via Quasi-Convex Maximization.
[ps],
[pdf]
- Evdokia Nikolova, Jonathan Kelner, Matthew Brand
and Michael Mitzenmacher.
- In Proceedings of 2006 European Symposium of Algorithms (ESA '06), Zurich, Sep '06.
-
Optimal Route Planning under Uncertainty.
[ps],
[pdf]
- Evdokia Nikolova, Matthew Brand, and David Karger.
- In Proceedings of 2006 International Conference on Automated Planning & Scheduling (ICAPS 2006), Lake District, England, June '06.
- VCG Overpayment in Random Graphs.
[ps],
[pdf]
- David Karger, Evdokia Nikolova.
- Brief Announcement in PODC 2005, Las Vegas, July '05.
[ps],
[pdf]
- Conference on Decision and Control (CDC '06), San Diego, CA, December '06.
[ps],
[pdf]
- DIMACS Workshop on Computational Issues in Auction Design, October 2004, Rutgers University.
- First-Price Path Auctions.
[ps],
[pdf]
- Nicole Immorlica, David Karger, Evdokia Nikolova, and Rahul Sami.
- In Proceedings of Sixth ACM Conference on Electronic Commerce (EC '05), Vancouver, June '05.
- Surveys
- Combinatorial Betting
[ps],
[pdf]
- 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).
* 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.
|
|
- Office Address
- Massachusetts Institute of Technology
The Stata Center, Room 32-G596
32 Vassar Street
Cambridge, MA 02139, USA
- (617) 253-6182
- my last name@mit.edu
|