Selected Recent
Publications
Simple Auctions
- Dylan Foster,
Zhiyuan Li, Thodoris Lykouris,
Karthik Sridharan, and Eva Tardos. Learning in Games: Robustness of
Fast Convergence. To appear in the Proceedings of Neural Information
Processing Systems (NIPS), 2016.
- Thodoris Lykouris,
Vasilis Syrgkanis, and Eva Tardos, Learning and Efficiency in Games
with Dynamic Population, Preliminary version in Proceedings of the
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016.
- Jason Hartline,
Vasilis Syrgkanis, Eva Tardos. No-regret
learning in repeated Bayesian Games, in the Proceedings of Neural
Information Processing Systems (NIPS), December 2015.
- Denis Nekipelov,
Vasilis Syrgkanis, Eva Tardos, Econometrics
for Learning Agents, preliminary version appeared in the proceedings
of the ACM Conference on Economics and Computation, Portland, OR June
2015 (best paper award).
- Thomas Kesselheim,
Robert Kleinberg, Eva Tardos, Smooth Online Mechanisms, in the
proceedings of the ACM Conference on Economics and Computation,
Portland, OR June 2015.
- Paul Duetting, Thomas
Kesselheim, Eva Tardos, Algorithms
as Mechanisms: The Price of Anarchy of Relax-and-Round, preliminary
version appeared in the proceedings of the ACM Conference on Economics
and Computation, Portland, OR June 2015.
- Thomas Kesselheim,
Robert Kleinberg, Eva Tardos, Smooth online
mechanisms: A game-theoretic problem in renewable energy markets, in
the proceedings of the ACM Conference on Economics and Computation,
Portland, OR June 2015.
- Paul Duetting, Thomas
Kesselheim, Eva Tardos, Mechanisms with
Unique Learnable Equilibria, in the Proceedings of the ACM
Conference on Electronic Commerce, June 2014, Palo Alto, CA.
- Ioannis Caragiannis,
Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan
Lucier, Renato Paes Leme, Éva Tardos, Bounding the inefficiency of
outcomes in generalized second price auctions, Journal of Economic
Theory (JET), Volume 156, March 2015, Pages 343-388.
- Vasilis Syrgkanis, Eva
Tardos, Composable
and Efficient Mechanisms, Preliminary version appeared in Symposium
on the Theory of Computing, STOC'13
- Brendan Lucier, Yaron
Singer, Vasilis Syrgkanis, and Eva Tardos, Equilibrium in
Combinatorial Public Projects, Conference on Web and Internet
Economics, WINE 2013.
- David Kempe, Vasilis
Syrgkanis, Eva Tardos. Information
Asymmetries in Common-Value Auctions with Discrete Signals, Arxiv 2013. AdAuction
workshop, Philadelphia, PA, June 2013.
- Nishanth Dikkala and
Eva Tardos. Can Credit Increase Revenue? Conference on Web and Internet
Economics, WINE 2013.
- Vasilis Syrgkanis, Eva
Tardos, Bayesian Sequential
Auctions, ACM Conference on electronic Commerce, EC'12
- Renato Paes Leme,
Vasilis Syrgkanis, Eva Tardos, Sequential Auctions and
Externalities, SODA 2012
- Renato Paes Leme,
Vasilis Syrgkanis, Eva Tardos, The
Dining Bidder Problem: a la russe et a la francais SIGecom
Exchanges, December 2012
- Tim Roughgarden and
Eva Tardos, Do Externalities Degrade GSPs E
ciency? AdAuction
workshop, Valenia, Spain, June 2012.
- Brendan Lucier, Renato
Paes Leme, Eva Tardos, On
Revenue in the Generalized Second Price Auction, Proceedings of
WWW'12, April 2012, Lyon, France.
- Ioannis Caragiannis,
Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou,
Brendan Lucier, Renato Paes Leme, Eva Tardos. Bounding the inefficiency of
equilibria in generalized second price auctions. Preliminary
versions include: Renato Paes Leme and Eva Tardos, Pure and Bayes-Nash
Price of Anarchy for Generalized Second Price Auction, 51st Annual IEEE
Symposium on Foundations of Computer Science (FOCS 2010).
Network Games:
- T. Roughgarden and E.
Tardos: How Bad
is Selfish Routing? Journal of the
ACM, 2002, Volume 49 , Issue 2. Preliminary version has
appeared in the Proceedings of the 41st Annual IEEE Symposium on the
Foundations of Computer Science, 2000.
- T. Roughgarden and E.
Tardos: Bounding
the Inefficiency of Equilibria in Nonatomic
Congestion Games.Games
and Economic Behaviour, Volume 47, Issue 2,
May 2004, Pages 389-403.
- H. Lin, T. Roughgarden, and E.
Tardos, Bounding Braess's Paradox, Proceedings of the 15th Annual
ACM-SIAM Symposium on Discrete Algorithms, 2004.
- H. Lin, T. Roughgarden, E.
Tardos, and A. Walkover. Braess's Paradox, Fibonacci Numbers, and Exponential
Inapproximability
, in the 32nd International Colloquium on Automata, Languages
and Programming (ICALP,05) July, 2005.
- E. Anshelevich, A. Dasgupta, É. Tardos, T. Wexler, Near-optimal network design with selfish agents,
in the proceedings of the Annual ACM Symposium on the Theory of
Computing, 2003.
- E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The Price of Stability for Network Design with Fair
Cost Allocation, Annual IEEE Symposium on Foundations
of Computer Science, 2004.
- Eva
Tardos. Network Games. Proceedings of the
Annual ACM Symposium on Theory of Computing, 2004.
- Ara Hayrapetyan, Éva Tardos and Tom Wexler - A Network Pricing Game for Selfish Traffic Distributed
Computing, (PODC'05 special issue).Preliminary version appeared in the
Proceedings of
24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed
Computing (PODC'05), July 2005.
- Ara Hayrapetyan, Éva Tardos and Tom Wexler: Effect of Collusion in Congestion Games.
Proceedings of the ACM Symposium on the Theory of Computing (STOC),
2006.
- L.
Blume, D. Easley, J. Kleinberg and E. Tardos: Trading Networks with Price-Setting Agents
in the ACM Conference on Electronic Commerce, EC'07.
- Thanh
Nguyen and E. Tardos, Approximately Maximizing Efficiency and Revenue
in Convex Environments, in the ACM Conference on
Electronic Commerce, EC'07.
- Robert
Kleinberg, Georgios Piliouras, and Eva Tardos. Multiplicative Updates Outperform Generic No-Regret
Learning in Congestion Games, in the proceedings of
the ACM Symposium on Theory of Computing, 2009.
- Robert
Kleinberg, Georgios Piliouras, and Eva Tardos. Load Balancing Without Regret in the Bulletin Board
Model, in the Proceedings of ACM Symposium on
Principles of Distributed Computing, August 2009.
- Robert
Kleinberg, Katrina Ligett, Georgios Piliouras, and Eva Tardos. Beyond the Nash Equilibrium BarrierInnovations
in Computer Science, 2011
- Renato
Paes Leme, Vasilis Syrgkanis, Eva Tardos, The Curse of Simultaneity Innovations
in Theoretical Computer Science, 2012
- A. Archer and 'E.
Tardos: Frugal Path mechanisms, to appear
in Transaction on Algorithms. Preliminary version appeared in the
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,
2002, pp. 991-999.
- A. Archer and E.
Tardos: Truthful mechanisms for one-parameter agents, Proceedings
of the 42nd IEEE Symposium on Foundations of Computer Science (2001)
482-491.
- A. Archer, Christos Papadimitriou, Kunal Talwar, Eva Tardos: An approximate truthful mechanism for combinatorial
auctions with single parameter agents. Internet Mathematics, Volume 1 Issue 2, 2004.
Prleiminary version appeared in the
Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms, 2003, pp. 205 - 214.
- M. Pal and E. Tardos: Group Strategyproof Mechanisms via Primal-Dual
Algorithms, in the Proceedings of the Annual IEEE
Symposium on Foundations of Computer Science, 2003.
- A. Gupta, A. Srinivasan, and E. Tardos. Cost-Sharing Mechanisms for Network Design. Proceedings
of APPROX 2004.
- David Kempe, Jon Kleinberg, Éva
Tardos: Maximizing the Spread of Influence in a Social
Network.
Proceedings of KDD 2003, Washington DC.
- David Kempe, Jon Kleinberg, Éva
Tardos: Influential Nodes in a Diffusion Model for Social
Networks. InProceedings
of ICALP 2005, Lisboa, Portugal.
- on
Kleinberg, Sid Suri and Eva Tardos, Strategic Network Formation with Structural Holes,
in the proceedings of the ACM Conference on Electronic Commerce 2008.
- Jon
Kleinberg and Eva Tardos. Balanced Outcomes in Social Exchange Networks.
ACM Symposium on the Theory of Computing (STOC), 2007.
- J. Kleinberg and E.
Tardos. Approximation Algorithms for Classification Problems
with Pairwise Relationships:
Metric Partitioning and Markov Random Fields, Journal of the ACM, 2002, Volume 49,
Issue 5, pp, 616-639. Preliminary version has appeared
in the Proceedings of the 40th Annual IEEE Symposium on the Foundations
of Computer Science, 1999.
- A. Gupta and E. Tardos: A Constant Factor Approximation Algorithm for a Class
of Classification Problems, In the Proceedings of the
ACM Symposium on the Theory of Computing, May 2000.
- A. Archer J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, K. Talvar and E. Tardos: Approximate Classification via Earthmover Metrics, in
the Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete
Algorithms, 2004.
- Thanh
Nguyen and E. Tardos, Parallel Imaging Problem, European
Symposium on Algorithms, 2008: 684-695.
- Zoya Svitkina and Eva
Tardos: Facility Location with Hierarchical Facility Costs.
in the Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete
Algorithms, 2006.
- Martin Pál, Éva
Tardos, Tom Wexler. Facility Location with Hard Capacities. In
the Proceedings of the 42nd Annual IEEE Symposium on the Foundations of
Computer Science, 2001.
- D. B. Shmoys, E. Tardos and
K. Aardal. Approximation algorithms for the facility location
problem.
In the Proc. of the 29th Annual ACM Symposium on the Theory of
Computing, 1997, pp. 265-274.
- M. Charikar, S. Guha, E. Tardos and D. Shmoys. A constant-factor approximation algorithm for the
k-median problem. To appear in the JCSS, preliminary
version has appeared in the Proc. of the 31st Annual ACM Symposium
on the Theory of Computing, 1999, pp. 1-10.
- Ara Hayrapetyan, Chaitanya Swamy and Éva Tardos: Network Design for Information Networks,
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005
- M.
Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D.
Williamson: Improved approximation algorithms for network design
problems. In the proceeding of the 5th Annual ACM-SIAM
Symposium on Discrete Algorithms, January 1994, pp. 223-232. ORIE TR-1116.
- V.
Melkonian and E. Tardos. Approximation Algorithms for a Directed Network
Design Problem.
In the Proceedings of the 7th International Integer Programming and
Combinatorial Optimization Conference (IPCO'99), Graz, 1999.
- Ara Hayrapetyan, Chaitanya Swamy and Éva Tardos - Network Design for Information Networks
- Zoya Svitkina and Éva Tardos: Facility Location with Hierarchical Facility Costs.
- J. Kleinberg, Y. Rabani, and
E. Tardos. Fairness in Routing and Load Balancing,
In the Proceedings of the 40th Annual IEEE Symposium on the Foundations
of Computer Science, 1999.
- J. Kleinberg
and E. Tardos: Approximations for the Disjoint Paths Problem in
High-Diameter Planar Networks, Journal of Computer and
System Sciences STOC'95 special issue, vol 57,
pp 61-73, 1998. Preliminary version has appeared in the Proceedings of
the 27th Annual ACM Symposium on the Theory of Computing, 1995,
pp. 26-35. ORIE TR-1121.
- J.
Kleinberg and E. Tardos: Disjoint Paths in Densely Embedded Graphs,
In the Proceedings of the 34th Annual IEEE Symposium on the Foundations
of Computer Science, 1995, pp. 52-61.
- Y.
Rabani and E. Tardos: Distributed Packet Switching in Arbitrary Networks,
in the 28th ACM Symposium on Theory of Computing, May, 1996, pp.
366-376.
- A.
Goldberg, S. Plotkin, E. Tardos: Combinatorial algorithms for the generalized
circulation problem, Mathematics of Operations
Research, 16/2, 1991, 351-381. Preliminary version has appeared in the
Proceedings of the 29th Annual IEEE Symposium on the Foundations of
Computer Science (1988), 432-443.
- E.
Tardos and K. Wayne. Simple Generalized Maximum Flow Algorithms.
Proceedings of the 6th International Integer Programming and
Combinatorial Optimization Conference (IPCO'98), Houston, 1998,
pp. 310-324.
- P.
Klein, S. Plotkin, C. Stein and E. Tardos, Faster approximation
algorithms for the unit capacity concurrent flow problem with
applications to routing and finding sparse cuts. SIAM Journal on
Computing, 23/3, 1994,. 466-487.Preliminary version has appeared in the
proceedings of the 22nd Annual ACM Symposium on the Theory of Computing
(1990), 310-321.
- T. Leighton,
F. Makedon, S. Plotkin, C. Stein, E. Tardos, S. Tragoudas:
Fast Approximation Algorithms for Multicommodity Flow Problems, Journal
of Computer and System Sciences, 50 (STOC'91 special issue), 1995, pp.
228--243. Preliminary version has appeared in the Proceedings of
the 23rd Annual ACM Symposium on the Theory of Computing (1991),
101-110.
- S.A.
Plotkin, D. Shmoys, and E. Tardos, Fast approximation algorithms for
fractional packing and covering problems, to appear in Mathematics of
Operations Research. ORIE TR-999. Preliminary
version has appeared in the Proceedings of the 32nd Annual IEEE
Symposium on the Foundations of Computer Science (1991), 495-505.
|
|
