Éva Tardos
Affiliations: | Cornell University, Ithaca, NY, United States |
Area:
Computer Science, Operations Research, MathematicsWebsite:
https://www.cs.cornell.edu/~eva/Google:
"Éva Tardos"Children
Sign in to add traineeVardges Melkonian | grad student | 2002 | Cornell |
Timothy A. Roughgarden | grad student | 2002 | Cornell (Computer Science Tree) |
Aaron F. Archer | grad student | 2004 | Cornell |
Martin Pal | grad student | 2005 | Cornell |
Thomas B. Wexler | grad student | 2006 | Cornell |
Ara Hayrapetyan | grad student | 2007 | Cornell |
Zoya Svitkina | grad student | 2007 | Cornell |
Georgios Piliouras | grad student | 2010 | Cornell |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Roughgarden T, Syrgkanis V, Tardos É. (2017) The price of anarchy in auctions Journal of Artificial Intelligence Research. 59: 59-101 |
Dütting P, Kesselheim T, Tardos É. (2016) Algorithms as mechanisms: the price of anarchy of relax-and-round Sigecom Exchanges. 14: 22-25 |
Caragiannis I, Kaklamanis C, Kanellopoulos P, et al. (2015) Bounding the inefficiency of outcomes in generalized second price auctions Journal of Economic Theory. 156: 343-388 |
Leme RP, Syrgkanis V, Tardos É. (2012) The dining bidder problem: à la russe et à la française Sigecom Exchanges. 11: 25-28 |
Lin H, Roughgarden T, Tardos E, et al. (2011) Stronger bounds on braess's paradox and the maximum latency of selfish routing Siam Journal On Discrete Mathematics. 25: 1667-1686 |
Kleinberg R, Piliouras G, Tardos E. (2011) Load balancing without regret in the bulletin board model Distributed Computing. 24: 21-29 |
Svitkina Z, Tardos É. (2010) Facility location with hierarchical facility costs Acm Transactions On Algorithms. 6: 37 |
Blume LE, Easley D, Kleinberg J, et al. (2009) Trading networks with price-setting agents Games and Economic Behavior. 67: 36-50 |
Gabow HN, Goemans MX, Tardos É, et al. (2009) Approximating the smallest k-edge connected spanning subgraph by LP-rounding Networks. 53: 345-357 |
Kleinberg J, Suri S, Tardos E, et al. (2008) Strategic network formation with structural holes Proceedings of the Acm Conference On Electronic Commerce. 284-293 |