default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvdokia Nikolova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Yutong Wu
, Ali Khodabakhsh, Bo Li, Evdokia Nikolova, Emmanouil Pountourakis:
Eliciting truthful reports with partial signals in repeated games. Theor. Comput. Sci. 988: 114371 (2024)- 2023
- [c36]Yutong Wu, Ali Khodabakhsh, Bo Li, Evdokia Nikolova, Emmanouil Pountourakis:
Eliciting Truthful Reports with Partial Signals in Repeated Games. IJTCS-FAW 2023: 42-57 - [c35]Ali Khodabakhsh, Evdokia Nikolova, Emmanouil Pountourakis, Jimmy Horn:
Threshold Mechanisms for Dynamic Procurement with Abandonment. SAGT 2023: 383-400 - 2022
- [j11]José Correa, Cristóbal Guzmán, Thanasis Lianeas, Evdokia Nikolova, Marc Schröder:
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. Oper. Res. 70(1): 472-489 (2022) - [j10]Swati Gupta, Ali Khodabakhsh, Hassan Mortagy, Evdokia Nikolova:
Electrical flows over spanning trees. Math. Program. 196(1): 479-519 (2022) - 2021
- [i13]Yutong Wu, Ali Khodabakhsh, Bo Li, Evdokia Nikolova, Emmanouil Pountourakis:
Eliciting Information with Partial Signals in Repeated Games. CoRR abs/2109.04343 (2021) - 2020
- [j9]Mengyuan Chao, Harsha Chenji, Chen Yang, Radu Stoleru, Evdokia Nikolova, Ala Altaweel:
EAR: Energy-aware risk-averse routing for disaster response networks. Ad Hoc Networks 103: 102167 (2020) - [c34]Jimmy Horn, Yutong Wu, Ali Khodabakhsh, Evdokia Nikolova, Emmanouil Pountourakis:
The Long-term Cost of Energy Generation. e-Energy 2020: 74-85
2010 – 2019
- 2019
- [j8]Adi Botea, Akihiro Kishimoto, Evdokia Nikolova, Stefano Braghin, Michele Berlingerio, Elizabeth Daly:
Computing Multi-Modal Journey Plans under Uncertainty. J. Artif. Intell. Res. 65: 633-674 (2019) - [j7]Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses:
Risk-Averse Selfish Routing. Math. Oper. Res. 44(1): 38-57 (2019) - [j6]Rasoul Shafipour, Ali Khodabakhsh, Gonzalo Mateos, Evdokia Nikolova:
A Directed Graph Fourier Transform With Spread Frequency Components. IEEE Trans. Signal Process. 67(4): 946-960 (2019) - [c33]Ali Khodabakhsh, Jimmy Horn, Evdokia Nikolova, Emmanouil Pountourakis:
Prosumer Pricing, Incentives and Fairness. e-Energy 2019: 116-120 - [e1]Ioannis Caragiannis, Vahab S. Mirrokni, Evdokia Nikolova:
Web and Internet Economics - 15th International Conference, WINE 2019, New York, NY, USA, December 10-12, 2019, Proceedings. Lecture Notes in Computer Science 11920, Springer 2019, ISBN 978-3-030-35388-9 [contents] - [i12]Swati Gupta, Ali Khodabakhsh, Hassan Mortagy, Evdokia Nikolova:
Electrical Flows over Spanning Trees. CoRR abs/1909.04759 (2019) - 2018
- [c32]Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael Caramanis, Thanasis Lianeas, Emmanouil Pountourakis:
A Submodular Approach for Electricity Distribution Network Reconfiguration. HICSS 2018: 1-10 - [c31]Rasoul Shafipour, Ali Khodabakhsh, Gonzalo Mateos, Evdokia Nikolova:
Digraph Fourier Transform via Spectral Dispersion Minimization. ICASSP 2018: 6284-6288 - [c30]Richard Cole, Thanasis Lianeas, Evdokia Nikolova:
When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? IJCAI 2018: 173-179 - [c29]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. MobiHoc 2018: 221-230 - [c28]José Correa, Cristóbal Guzmán, Thanasis Lianeas, Evdokia Nikolova, Marc Schröder:
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. EC 2018: 375-392 - [c27]Evdokia Nikolova, Emmanouil Pountourakis, Ger Yang:
Optimal Mechanism Design with Risk-Loving Agents. WINE 2018: 375-392 - [i11]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. CoRR abs/1805.06420 (2018) - [i10]Evdokia Nikolova, Emmanouil Pountourakis, Ger Yang:
Optimal Mechanism Design with Risk-loving Agents. CoRR abs/1810.02758 (2018) - [i9]Ali Khodabakhsh, Orestis Papadigenopoulos, Jannik Matuschke, Jimmy Horn, Evdokia Nikolova, Emmanouil Pountourakis:
Electric Vehicle Valet. CoRR abs/1811.06184 (2018) - 2017
- [c26]Rasoul Shafipour, Ali Khodabakhsh, Gonzalo Mateos, Evdokia Nikolova:
A digraph fourier transform with spread frequency components. GlobalSIP 2017: 583-587 - [c25]Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen:
Reconciling Selfish Routing with Social Good. SAGT 2017: 147-159 - [i8]Richard Cole, Thanasis Lianeas, Evdokia Nikolova:
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? CoRR abs/1702.07806 (2017) - [i7]Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen:
Reconciling Selfish Routing with Social Good. CoRR abs/1707.00208 (2017) - [i6]Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael C. Caramanis, Thanasis Lianeas, Emmanouil Pountourakis:
A Submodular Approach for Electricity Distribution Network Reconfiguration. CoRR abs/1711.03517 (2017) - 2016
- [j5]Georgios Piliouras, Evdokia Nikolova, Jeff S. Shamma:
Risk Sensitivity of Price of Anarchy under Uncertainty. ACM Trans. Economics and Comput. 5(1): 5:1-5:27 (2016) - [c24]Ger Yang, Evdokia Nikolova:
Approximation Algorithms for Route Planning with Nonlinear Objectives. AAAI 2016: 3209-3217 - [c23]Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses:
Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing. IJCAI 2016: 338-344 - 2015
- [c22]Darrell Hoy, Evdokia Nikolova:
Approximately Optimal Risk-Averse Routing Policies via Adaptive Discretization. AAAI 2015: 3533-3539 - [c21]Evdokia Nikolova, Nicolás E. Stier Moses:
The Burden of Risk Aversion in Mean-Risk Selfish Routing. EC 2015: 489-506 - [c20]Soumya Basu, Thanasis Lianeas, Evdokia Nikolova:
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. WINE 2015: 89-103 - [i5]Soumya Basu, Thanasis Lianeas, Evdokia Nikolova:
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. CoRR abs/1509.07260 (2015) - [i4]Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses:
Asymptotically tight bounds for inefficiency in risk-averse selfish routing. CoRR abs/1510.02067 (2015) - [i3]Ger Yang, Evdokia Nikolova:
Approximation Algorithms for Route Planning with Nonlinear Objectives. CoRR abs/1511.07412 (2015) - 2014
- [j4]Evdokia Nikolova, Nicolás E. Stier Moses:
A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times. Oper. Res. 62(2): 366-382 (2014) - [i2]Evdokia Nikolova, Nicolás E. Stier Moses:
The Burden of Risk Aversion in Mean-Risk Selfish Routing. CoRR abs/1411.0059 (2014) - 2013
- [c19]Adi Botea, Evdokia Nikolova, Michele Berlingerio:
Multi-Modal Journey Planning in the Presence of Uncertainty. ICAPS 2013 - [c18]Jia Yuan Yu, Evdokia Nikolova:
Sample Complexity of Risk-Averse Bandit-Arm Selection. IJCAI 2013: 2576-2582 - [c17]Georgios Piliouras, Evdokia Nikolova, Jeff S. Shamma:
Risk sensitivity of price of anarchy under uncertainty. EC 2013: 715-732 - [c16]Harsha Chenji, Lidia Smith, Radu Stoleru, Evdokia Nikolova:
Raven: Energy aware QoS control for DRNs. WiMob 2013: 464-471 - 2012
- [j3]Evdokia Nikolova, Nicolás E. Stier Moses:
Stochastic selfish routing. SIGecom Exch. 11(1): 21-25 (2012) - [c15]Sejoon Lim, Christian Sommer, Evdokia Nikolova, Daniela Rus:
Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries. Robotics: Science and Systems 2012 - 2011
- [c14]Evdokia Nikolova, Nicolás E. Stier Moses:
Stochastic Selfish Routing. SAGT 2011: 314-325 - 2010
- [c13]Evdokia Nikolova:
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization. APPROX-RANDOM 2010: 338-351
2000 – 2009
- 2009
- [b1]Evdokia Nikolova:
Strategic algorithms. Massachusetts Institute of Technology, Cambridge, MA, USA, 2009 - [c12]Evdokia Nikolova:
High-Performance Heuristics for Optimization in Stochastic Traffic Engineering Problems. LSSC 2009: 352-360 - 2008
- [j2]Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou:
Incentive-Compatible Interdomain Routing with Linear Utilities. Internet Math. 5(4): 395-410 (2008) - [c11]Evdokia Nikolova, David R. Karger:
Route Planning under Uncertainty: The Canadian Traveller Problem. AAAI 2008: 969-974 - [c10]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál:
A Truthful Mechanism for Offline Ad Slot Scheduling. SAGT 2008: 182-193 - [i1]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal:
A Truthful Mechanism for Offline Ad Slot Scheduling. CoRR abs/0801.2931 (2008) - 2007
- [j1]Yiling Chen, Lance Fortnow, Evdokia Nikolova, David M. Pennock:
Combinatorial betting. SIGecom Exch. 7(1): 61-64 (2007) - [c9]Jonathan A. Kelner, Evdokia Nikolova:
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. FOCS 2007: 472-482 - [c8]Evdokia Nikolova, Rahul Sami:
A strategic model for information markets. EC 2007: 316-325 - [c7]Yiling Chen, Lance Fortnow, Evdokia Nikolova, David M. Pennock:
Betting on permutations. EC 2007: 326-335 - [c6]Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou:
Incentive-Compatible Interdomain Routing with Linear Utilities. WINE 2007: 232-244 - 2006
- [c5]Evdokia Nikolova, Matthew Brand, David R. Karger:
Optimal Route Planning under Uncertainty. ICAPS 2006: 131-141 - [c4]David R. Karger, Evdokia Nikolova:
On the Expected VCG Overpayment in Large Networks. CDC 2006: 2831-2836 - [c3]Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher:
Stochastic Shortest Paths Via Quasi-convex Maximization. ESA 2006: 552-563 - 2005
- [c2]David R. Karger, Evdokia Nikolova:
Brief announcement: on the expected overpayment of VCG mechanisms in large networks. PODC 2005: 126 - [c1]Nicole Immorlica, David R. Karger, Evdokia Nikolova, Rahul Sami:
First-price path auctions. EC 2005: 203-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-03 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
