Éva Tardos

260 papers A* 84A 6B 9Journal 144Unranked 13
YearRankTypeTitle / Venue / Authors
2026 A* conf
Robust Equilibria in Shared Resource Allocation via Strengthening Border's Theorem.
SODA
David X. Lin, Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
2026 A conf
Robust Resource Allocation via Competitive Subsidies.
ITCS
David X. Lin, Giannis Fikioris, Siddhartha Banerjee, Éva Tardos
2026 J jnl
Robust Temporal Guarantees in Budgeted Sequential Auctions.
CoRR
Giannis Fikioris, Robert Kleinberg, Yoav Kolumbus, Yishay Mansour, Éva Tardos
2025 — conf
Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria.
SIGMETRICS (Abstracts)
Chido Onyeze, Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
2025 J jnl
Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria.
CoRR
Chido Onyeze, Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
2025 J jnl
Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria.
Proc. ACM Meas. Anal. Comput. Syst.
Chido Onyeze, Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
2025 J jnl
Asymmetric Network Games: α-Potential Function and Learning.
CoRR
Kiran Rokade, Adit Jain, Francesca Parise, Vikram Krishnamurthy, Éva Tardos
2025 A* conf
Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness.
EC
Giannis Fikioris, Siddhartha Banerjee, Éva Tardos
2025 J jnl
Dynamic Allocation of Public Goods with Approximate Core Equilibria.
CoRR
Chido Onyeze, David X. Lin, Siddhartha Banerjee, Éva Tardos
2025 A* conf
Learning in Budgeted Auctions with Spacing Objectives.
EC
Giannis Fikioris, Robert Kleinberg, Yoav Kolumbus, Raunak Kumar, Yishay Mansour, Éva Tardos
2025 J jnl
Learning in Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners.
CoRR
David A. Easley, Yoav Kolumbus, Éva Tardos
2025 J jnl
Learning in Strategic Queuing Systems with Small Buffers.
CoRR
Ariana Abel, Yoav Kolumbus, Jeronimo Martin Duque, Éva Tardos
2025 J jnl
Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions.
Math. Oper. Res.
Giannis Fikioris, Éva Tardos
2025 A* conf
Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners.
EC
David A. Easley, Yoav Kolumbus, Éva Tardos
2025 A* conf
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies.
IJCAI
David X. Lin, Daniel Hall, Giannis Fikioris, Siddhartha Banerjee, Éva Tardos
2025 J jnl
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies.
CoRR
David X. Lin, Daniel Hall, Giannis Fikioris, Siddhartha Banerjee, Éva Tardos
2025 J jnl
Robust Equilibria in Shared Resource Allocation via Strengthening Border's Theorem.
CoRR
David X. Lin, Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
2025 J jnl
Robust Resource Allocation via Competitive Subsidies.
CoRR
David X. Lin, Giannis Fikioris, Siddhartha Banerjee, Éva Tardos
2024 B conf
Calibrated Recommendations for Users with Decaying Attention.
SAGT
Jon M. Kleinberg, Emily Ryu, Éva Tardos
2024 J jnl
Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks.
Math. Oper. Res.
J. Massey Cashore, Peter I. Frazier, Éva Tardos
2024 B conf
Incentives in Dominant Resource Fair Allocation Under Dynamic Demands.
SAGT
Giannis Fikioris, Rachit Agarwal, Éva Tardos
2024 J jnl
Learning in Budgeted Auctions with Spacing Objectives.
CoRR
Giannis Fikioris, Robert Kleinberg, Yoav Kolumbus, Raunak Kumar, Yishay Mansour, Éva Tardos
2024 A* conf
Modeling reputation-based behavioral biases in school choice.
EC
Jon M. Kleinberg, Sigal Oren, Emily Ryu, Éva Tardos
2024 J jnl
Modeling reputation-based behavioral biases in school choice.
CoRR
Jon M. Kleinberg, Sigal Oren, Emily Ryu, Éva Tardos
2024 J jnl
Paying to Do Better: Games with Payments between Learning Agents.
CoRR
Yoav Kolumbus, Joe Halpern, Éva Tardos
2023 A* conf
Approximately Stationary Bandits with Knapsacks.
COLT
Giannis Fikioris, Éva Tardos
2023 J jnl
Approximately Stationary Bandits with Knapsacks.
CoRR
Giannis Fikioris, Éva Tardos
2023 J jnl
Calibrated Recommendations for Users with Decaying Attention.
CoRR
Jon M. Kleinberg, Emily Ryu, Éva Tardos
2023 A* conf
Karma: Resource Allocation for Dynamic Demands.
OSDI
Midhul Vuppalapati, Giannis Fikioris, Rachit Agarwal, Asaf Cidon, Anurag Khandelwal, Éva Tardos
2023 J jnl
Karma: Resource Allocation for Dynamic Demands.
CoRR
Midhul Vuppalapati, Giannis Fikioris, Rachit Agarwal, Asaf Cidon, Anurag Khandelwal, Éva Tardos
2023 A* conf
Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions.
EC
Giannis Fikioris, Éva Tardos
2023 J jnl
Online Resource Sharing via Dynamic Max-Min Fairness: Efficiency, Robustness and Non-Stationarity.
CoRR
Giannis Fikioris, Siddhartha Banerjee, Éva Tardos
2023 A* conf
Robust Pseudo-Markets for Reusable Public Resources.
EC
Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
2023 J jnl
Robust Pseudo-Markets for Reusable Public Resources.
CoRR
Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
2023 J jnl
The Price of Anarchy of Strategic Queuing Systems.
J. ACM
Jason Gaitonde, Éva Tardos
2022 A* conf
Dynamic Pricing Provides Robust Equilibria in Stochastic Ride-Sharing Networks.
EC
J. Massey Cashore, Peter I. Frazier, Éva Tardos
2022 J jnl
Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks.
CoRR
J. Massey Cashore, Peter I. Frazier, Éva Tardos
2022 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2022 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2022 J jnl
Liquid Welfare guarantees for No-Regret Learning in Sequential Budgeted Auctions.
CoRR
Giannis Fikioris, Éva Tardos
2022 J jnl
Ordered Submodularity and its Applications to Diversifying Recommendations.
CoRR
Jon M. Kleinberg, Emily Ryu, Éva Tardos
2022 J jnl
Small-Loss Bounds for Online Learning with Partial Information.
Math. Oper. Res.
Thodoris Lykouris, Karthik Sridharan, Éva Tardos
2022 J jnl
The EATCS Award 2022 - Laudatio for Patrick Cousot.
Bull. EATCS
Éva Tardos
2021 J jnl
Algorithms as Mechanisms: The Price of Anarchy of Relax and Round.
Math. Oper. Res.
Paul Dütting, Thomas Kesselheim, Éva Tardos
2021 J jnl
Incentives in Resource Allocation under Dynamic Demands.
CoRR
Giannis Fikioris, Rachit Agarwal, Éva Tardos
2021 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2021 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2021 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2021 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2021 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2021 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2021 A* conf
Polarization in Geometric Opinion Dynamics.
EC
Jason Gaitonde, Jon M. Kleinberg, Éva Tardos
2021 J jnl
Polarization in Geometric Opinion Dynamics.
CoRR
Jason Gaitonde, Jon M. Kleinberg, Éva Tardos
2021 A conf
Randomness and Fairness in Two-Sided Matching with Limited Interviews.
ITCS
Hedyeh Beyhaghi, Éva Tardos
2021 J jnl
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations.
ACM Trans. Economics and Comput.
Pooya Jalaly, Éva Tardos
2021 J jnl
The EATCS Award 2022 - Call for Nominations.
Bull. EATCS
Éva Tardos
2021 A* conf
Virtues of Patience in Strategic Queuing Systems.
EC
Jason Gaitonde, Éva Tardos
2020 A* conf
Adversarial Perturbations of Opinion Dynamics in Networks.
EC
Jason Gaitonde, Jon M. Kleinberg, Éva Tardos
2020 J jnl
Adversarial Perturbations of Opinion Dynamics in Networks.
CoRR
Jason Gaitonde, Jon M. Kleinberg, Éva Tardos
2020 B conf
Feedback graph regret bounds for Thompson Sampling and UCB.
ALT
Thodoris Lykouris, Éva Tardos, Drishti Wali
2020 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2020 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2020 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2020 A* conf
Stability and Learning in Strategic Queuing Systems.
EC
Jason Gaitonde, Éva Tardos
2020 J jnl
Stability and Learning in Strategic Queuing Systems.
CoRR
Jason Gaitonde, Éva Tardos
2020 J jnl
The EATCS Award 2021 - Call for Nominations.
Bull. EATCS
Marta Kwiatkowska, Éva Tardos, Johan Håstad
2020 J jnl
Virtues of Patience in Strategic Queuing Systems.
CoRR
Jason Gaitonde, Éva Tardos
2019 J jnl
Graph regret bounds for Thompson Sampling and UCB.
CoRR
Thodoris Lykouris, Éva Tardos, Drishti Wali
2019 J jnl
Information Asymmetries in Common-Value Auctions with Discrete Signals.
Math. Oper. Res.
Vasilis Syrgkanis, David Kempe, Éva Tardos
2019 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2019 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2019 J jnl
The EATCS Award 2020 - Call for Nominations.
Bull. EATCS
Artur Czumaj, Marta Kwiatkowska, Éva Tardos
2018 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2018 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2018 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2018 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2018 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2018 A* ed.
Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018
EC
Éva Tardos, Edith Elkind, Rakesh Vohra
2018 — conf
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations.
WINE
Pooya Jalaly Khalilabadi, Éva Tardos
2018 A* conf
Small-loss bounds for online learning with partial information.
COLT
Thodoris Lykouris, Karthik Sridharan, Éva Tardos
2017 A* conf
Computing Equilibrium in Matching Markets.
EC
Saeed Alaei, Pooya Jalaly Khalilabadi, Éva Tardos
2017 J jnl
Computing Equilibrium in Matching Markets.
CoRR
Saeed Alaei, Pooya Jalaly, Éva Tardos
2017 J jnl
Effect of selfish choices in deferred acceptance with short lists.
CoRR
Hedyeh Beyhaghi, Daniela Sabán, Éva Tardos
2017 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2017 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2017 J jnl
Invited Article Foreword.
J. ACM
Éva Tardos
2017 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2017 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2017 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2017 J jnl
Learning and Trust in Auction Markets.
CoRR
Pooya Jalaly, Denis Nekipelov, Éva Tardos
2017 J jnl
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations.
CoRR
Pooya Jalaly, Éva Tardos
2017 J jnl
Small-loss bounds for online learning with partial information.
CoRR
Thodoris Lykouris, Karthik Sridharan, Éva Tardos
2017 J jnl
The Price of Anarchy in Auctions.
J. Artif. Intell. Res.
Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos
2016 J jnl
Fast Convergence of Common Learning Algorithms in Games.
CoRR
Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris, Karthik Sridharan, Éva Tardos
2016 J jnl
Introduction.
ACM Trans. Economics and Comput.
R. Preston McAfee, Éva Tardos
2016 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2016 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2016 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2016 J jnl
Invited Articles Foreword.
J. ACM
Éva Tardos
2016 A* conf
Learning and Efficiency in Games with Dynamic Population.
SODA
Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos
2016 — conf
Learning in Games: Robustness of Fast Convergence.
NIPS
Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris, Karthik Sridharan, Éva Tardos
2016 J jnl
The Price of Anarchy in Auctions.
CoRR
Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos
2015 A* conf
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round.
EC
Paul Dütting, Thomas Kesselheim, Éva Tardos
2015 J jnl
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round.
CoRR
Paul Dütting, Thomas Kesselheim, Éva Tardos
2015 J jnl
Algorithms as mechanisms: the price of anarchy of relax-and-round.
SIGecom Exch.
Paul Dütting, Thomas Kesselheim, Éva Tardos
2015 J jnl
Bounding the inefficiency of outcomes in generalized second price auctions.
J. Econ. Theory
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos
2015 B conf
Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets.
SAGT
Hedyeh Beyhaghi, Nishanth Dikkala, Éva Tardos
2015 A* conf
Econometrics for Learning Agents.
EC
Denis Nekipelov, Vasilis Syrgkanis, Éva Tardos
2015 J jnl
Econometrics for Learning Agents.
CoRR
Denis Nekipelov, Vasilis Syrgkanis, Éva Tardos
2015 J jnl
Effect of Strategic Grading and Early Offers in Matching Markets.
CoRR
Hedyeh Beyhaghi, Nishanth Dikkala, Éva Tardos
2015 A* conf
Information Asymmetries in Common-Value Auctions with Discrete Signals.
EC
Vasilis Syrgkanis, David Kempe, Éva Tardos
2015 J jnl
Introduction to computer science and economic theory.
J. Econ. Theory
Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos
2015 J jnl
Learning and Efficiency in Games with Dynamic Population.
CoRR
Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos
2015 J jnl
Maximizing the Spread of Influence through a Social Network.
Theory Comput.
David Kempe, Jon M. Kleinberg, Éva Tardos
2015 — conf
No-Regret Learning in Bayesian Games.
NIPS
Jason D. Hartline, Vasilis Syrgkanis, Éva Tardos
2015 J jnl
No-Regret Learning in Repeated Bayesian Games.
CoRR
Jason D. Hartline, Vasilis Syrgkanis, Éva Tardos
2015 A* conf
Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets.
EC
Thomas Kesselheim, Robert D. Kleinberg, Éva Tardos
2014 A* conf
Mechanism with unique learnable equilibria.
EC
Paul Dütting, Thomas Kesselheim, Éva Tardos
2014 B conf
Strong Price of Anarchy, Utility Games and Coalitional Dynamics.
SAGT
Yoram Bachrach, Vasilis Syrgkanis, Éva Tardos, Milan Vojnovic
2013 — conf
Can Credit Increase Revenue?
WINE
Nishanth Dikkala, Éva Tardos
2013 A* conf
Composable and efficient mechanisms.
STOC
Vasilis Syrgkanis, Éva Tardos
2013 — conf
Equilibrium in Combinatorial Public Projects.
WINE
Brendan Lucier, Yaron Singer, Vasilis Syrgkanis, Éva Tardos
2013 J jnl
Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161).
Dagstuhl Reports
Sergiu Hart, Éva Tardos, Bernhard von Stengel
2013 J jnl
Network Formation in the Presence of Contagious Risk.
ACM Trans. Economics and Comput.
Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos
2013 J jnl
Notes from the EC'13 program chairs.
SIGecom Exch.
R. Preston McAfee, Éva Tardos
2013 A* ed.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, June 16-20, 2013
EC
Michael J. Kearns, R. Preston McAfee, Éva Tardos
2013 J jnl
Strong Price of Anarchy and Coalitional Dynamics.
CoRR
Yoram Bachrach, Vasilis Syrgkanis, Éva Tardos, Milan Vojnovic
2012 J jnl
Bayesian Sequential Auctions
CoRR
Vasilis Syrgkanis, Éva Tardos
2012 A* conf
Bayesian sequential auctions.
EC
Vasilis Syrgkanis, Éva Tardos
2012 J jnl
Composable and Efficient Mechanisms
CoRR
Vasilis Syrgkanis, Éva Tardos
2012 A* conf
On revenue in the generalized second price auction.
WWW
Brendan Lucier, Renato Paes Leme, Éva Tardos
2012 J jnl
On the efficiency of equilibria in generalized second price auctions
CoRR
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos
2012 A* conf
Sequential auctions and externalities.
SODA
Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos
2012 A conf
The curse of simultaneity.
ITCS
Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos
2012 J jnl
The dining bidder problem: à la russe et à la française.
SIGecom Exch.
Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos
2011 A conf
Beyond the Nash Equilibrium Barrier.
ICS
Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos
2011 J jnl
Load balancing without regret in the bulletin board model.
Distributed Comput.
Robert Kleinberg, Georgios Piliouras, Éva Tardos
2011 A* conf
Network formation in the presence of contagious risk.
EC
Larry Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos
2011 J jnl
Sequential Auctions and Externalities
CoRR
Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos
2011 J jnl
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing.
SIAM J. Discret. Math.
Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover
2011 A* conf
Which Networks are Least Susceptible to Cascading Failures?
FOCS
Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos
2010 J jnl
Facility location with hierarchical facility costs.
ACM Trans. Algorithms
Zoya Svitkina, Éva Tardos
2010 A* conf
Globally optimal pixel labeling algorithms for tree metrics.
CVPR
Pedro F. Felzenszwalb, Gyula Pap, Éva Tardos, Ramin Zabih
2010 A* conf
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction.
FOCS
Renato Paes Leme, Éva Tardos
2009 — conf
Approximate Pure Nash Equilibria via Lovász Local Lemma.
WINE
Thành Nguyen, Éva Tardos
2009 J jnl
Approximating the smallest
Networks
Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
2009 A* conf
Load balancing without regret in the bulletin board model.
PODC
Robert D. Kleinberg, Georgios Piliouras, Éva Tardos
2009 A* conf
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract.
STOC
Robert Kleinberg, Georgios Piliouras, Éva Tardos
2009 — conf
Quantifying Outcomes in Games.
WINE
Éva Tardos
2009 J jnl
Trading networks with price-setting agents.
Games Econ. Behav.
Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos
2008 A* conf
Balanced outcomes in social exchange networks.
STOC
Jon M. Kleinberg, Éva Tardos
2008 J jnl
Cost-Sharing Mechanisms for Network Design.
Algorithmica
Anupam Gupta, Aravind Srinivasan, Éva Tardos
2008 — ed.
Equilibrium Computation, 18.11. - 23.11.2007
Equilibrium Computation
P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel
2008 J jnl
Near-Optimal Network Design with Selfish Agents.
Theory Comput.
Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler
2008 A conf
Parallel Imaging Problem.
ESA
Thành Nguyen, Éva Tardos
2008 J jnl
Special Issue on Foundations of Computer Science.
SIAM J. Comput.
Irit Dinur, Éva Tardos
2008 A* conf
Strategic network formation with structural holes.
EC
Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler
2008 J jnl
Strategic network formation with structural holes.
SIGecom Exch.
Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler
2008 J jnl
The Price of Stability for Network Design with Fair Cost Allocation.
SIAM J. Comput.
Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
2007 — conf
07271 Abstracts Collection - Computational Social Systems and the Internet .
Computational Social Systems and the Internet
Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz
2007 — conf
07271 Summary - Computational Social Systems and the Internet.
Computational Social Systems and the Internet
Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz
2007 — conf
07471 Abstracts Collection - Equilibrium Computation.
Equilibrium Computation
P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel
2007 J jnl
A network pricing game for selfish traffic.
Distributed Comput.
Ara Hayrapetyan, Éva Tardos, Tom Wexler
2007 — book
Algorithmic Game Theory
Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani
2007 A* conf
Approximately maximizing efficiency and revenue in polyhedral environments.
EC
Thành Nguyen, Éva Tardos
2007 — ed.
Computational Social Systems and the Internet, 1.7. - 6.7.2007
Computational Social Systems and the Internet
Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz
2007 J jnl
Frugal path mechanisms.
ACM Trans. Algorithms
Aaron Archer, Éva Tardos
2007 A* conf
Trading networks with price-setting agents.
EC
Larry Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos
2006 — book
Algorithm design.
Jon M. Kleinberg, Éva Tardos
2006 A* conf
Facility location with hierarchical facility costs.
SODA
Zoya Svitkina, Éva Tardos
2006 A* conf
The effect of collusion in congestion games.
STOC
Ara Hayrapetyan, Éva Tardos, Tom Wexler
2005 A* conf
A network pricing game for selfish traffic.
PODC
Ara Hayrapetyan, Éva Tardos, Tom Wexler
2005 A* conf
Approximating the smallest
SODA
Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
2005 A* conf
Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability.
ICALP
Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover
2005 A* conf
Influential Nodes in a Diffusion Model for Social Networks.
ICALP
David Kempe, Jon M. Kleinberg, Éva Tardos
2005 A* conf
Network design for information networks.
SODA
Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos
2005 J jnl
Primal-Dual-Based Algorithms for a Directed Network Design Problem.
INFORMS J. Comput.
Vardges Melkonian, Éva Tardos
2004 A* conf
A stronger bound on Braess's Paradox.
SODA
Henry C. Lin, Tim Roughgarden, Éva Tardos
2004 J jnl
Algorithms for a network design problem with crossing supermodular demands.
Networks
Vardges Melkonian, Éva Tardos
2004 A* conf
Approximate classification via earthmover metrics.
SODA
Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos
2004 J jnl
Bounding the inefficiency of equilibria in nonatomic congestion games.
Games Econ. Behav.
Tim Roughgarden, Éva Tardos
2004 — conf
Cost-Sharing Mechanisms for Network Design.
APPROX-RANDOM
Anupam Gupta, Aravind Srinivasan, Éva Tardos
2004 — conf
Min-Max Multiway Cut.
APPROX-RANDOM
Zoya Svitkina, Éva Tardos
2004 A* conf
Network games.
STOC
Éva Tardos
2004 A* conf
The Price of Stability for Network Design with Fair Cost Allocation.
FOCS
Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
2003 J jnl
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.
Internet Math.
Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos
2003 A* conf
An approximate truthful mechanism for combinatorial auctions with single parameter agents.
SODA
Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos
2003 A conf
Approximation Algorithms and Network Games.
ESA
Éva Tardos
2003 A* conf
Group Strategyproof Mechanisms via Primal-Dual Algorithms.
FOCS
Martin Pál, Éva Tardos
2003 A* conf
Maximizing the spread of influence through a social network.
KDD
David Kempe, Jon M. Kleinberg, Éva Tardos
2003 A* conf
Near-optimal network design with selfish agents.
STOC
Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler
2003 J jnl
Scheduling data transfers in a network and the set scheduling problem.
J. Algorithms
Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
2002 J jnl
A Constant-Factor Approximation Algorithm for the k-Median Problem.
J. Comput. Syst. Sci.
Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
2002 J jnl
Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields.
J. ACM
Jon M. Kleinberg, Éva Tardos
2002 A* conf
Frugal path mechanisms.
SODA
Aaron Archer, Éva Tardos
2002 J jnl
How bad is selfish routing?
J. ACM
Tim Roughgarden, Éva Tardos
2001 A* conf
Facility Location with Nonuniform Hard Capacities.
FOCS
Martin Pál, Éva Tardos, Tom Wexler
2001 J jnl
Fairness in Routing and Load Balancing.
J. Comput. Syst. Sci.
Jon M. Kleinberg, Yuval Rabani, Éva Tardos
2001 A* conf
Truthful Mechanisms for One-Parameter Agents.
FOCS
Aaron Archer, Éva Tardos
2000 A* conf
A constant factor approximation algorithm for a class of classification problems.
STOC
Anupam Gupta, Éva Tardos
2000 J jnl
Allocating Bandwidth for Bursty Connections.
SIAM J. Comput.
Jon M. Kleinberg, Yuval Rabani, Éva Tardos
2000 A* conf
How Bad is Selfish Routing?
FOCS
Tim Roughgarden, Éva Tardos
2000 J jnl
The Quickest Transshipment Problem.
Math. Oper. Res.
Bruce Hoppe, Éva Tardos
1999 A* conf
A Constant-Factor Approximation Algorithm for the
STOC
Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
1999 A* conf
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields.
FOCS
Jon M. Kleinberg, Éva Tardos
1999 B conf
Approximation Algorithms for Some Clustering and Classification Problems.
ISAAC
Éva Tardos
1999 B conf
Approximation Algorithms for a Directed Network Design Problem.
IPCO
Vardges Melkonian, Éva Tardos
1999 A* conf
Fairness in Routing and Load Balancing.
FOCS
Jon M. Kleinberg, Yuval Rabani, Éva Tardos
1999 A* conf
Scheduling Data Transfers in a Network and the Set Scheduling Problem.
STOC
Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
1999 J jnl
Separating Maximally Violated Comb Inequalities in Planar Graphs.
Math. Oper. Res.
Lisa Fleischer, Éva Tardos
1998 J jnl
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks.
J. Comput. Syst. Sci.
Jon M. Kleinberg, Éva Tardos
1998 J jnl
Efficient continuous-time dynamic network flow algorithms.
Oper. Res. Lett.
Lisa Fleischer, Éva Tardos
1998 B conf
Simple Generalized Maximum Flow Algorithms.
IPCO
Éva Tardos, Kevin D. Wayne
1997 A* conf
Allocating Bandwidth for Bursty Connections.
STOC
Jon M. Kleinberg, Yuval Rabani, Éva Tardos
1997 A* conf
Approximation Algorithms for Facility Location Problems (Extended Abstract).
STOC
David B. Shmoys, Éva Tardos, Karen I. Aardal
1997 J jnl
Approximation Algorithms for Steiner and Directed Multicuts.
J. Algorithms
Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos
1996 A* conf
Distributed Packet Switching in Arbitrary Networks.
STOC
Yuval Rabani, Éva Tardos
1996 A* ed.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA.
SODA
Éva Tardos
1996 B conf
Separating Maximally Violated Comb Inequalities in Planar Graphs.
IPCO
Lisa Fleischer, Éva Tardos
1995 A* conf
Approximations for the disjoint paths problem in high-diameter planar networks.
STOC
Jon M. Kleinberg, Éva Tardos
1995 A* conf
Disjoint Paths in Densely Embedded Graphs.
FOCS
Jon M. Kleinberg, Éva Tardos
1995 J jnl
Fast Approximation Algorithms for Fractional Packing and Covering Problems.
Math. Oper. Res.
Serge A. Plotkin, David B. Shmoys, Éva Tardos
1995 J jnl
Fast Approximation Algorithms for Multicommodity Flow Problems.
J. Comput. Syst. Sci.
Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
1995 J jnl
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.
Comb.
Serge A. Plotkin, Éva Tardos
1995 A* conf
The Quickest Transshipment Problem.
SODA
Bruce Hoppe, Éva Tardos
1994 J jnl
A Faster Parametric Minimum-Cut Algorithm.
Algorithmica
Dan Gusfield, Éva Tardos
1994 J jnl
Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts.
SIAM J. Comput.
Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos
1994 A* conf
Improved Approximation Algorithms for Network Design Problems.
SODA
Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
1994 A* conf
Polynomial Time Algorithms for Some Evacuation Problems.
SODA
Bruce Hoppe, Éva Tardos
1993 J jnl
An approximation algorithm for the generalized assignment problem.
Math. Program.
David B. Shmoys, Éva Tardos
1993 J jnl
Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs.
Inf. Process. Lett.
Éva Tardos, Vijay V. Vazirani
1993 A* conf
Improved bounds on the max-flow min-cut ratio for multicommodity flows.
STOC
Serge A. Plotkin, Éva Tardos
1993 J jnl
Polynomial dual network simplex algorithms.
Math. Program.
James B. Orlin, Serge A. Plotkin, Éva Tardos
1993 A* conf
Scheduling Unrelated Machines with Costs.
SODA
David B. Shmoys, Éva Tardos
1992 J jnl
Algorithms for Routing around a Rectangle.
Discret. Appl. Math.
András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos
1992 J jnl
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.
SIAM J. Comput.
Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1992 J jnl
Using Separation Algorithms in Fixed Dimension.
J. Algorithms
Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
1991 J jnl
Combinatorial Algorithms for the Generalized Circulation Problem.
Math. Oper. Res.
Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
1991 A* conf
Fast Approximation Algorithms for Fractional Packing and Covering Problems
FOCS
Serge A. Plotkin, David B. Shmoys, Éva Tardos
1991 A* conf
Fast Approximation Algorithms for Multicommodity Flow Problems
STOC
Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
1990 J jnl
An intersection theorem for supermatroids.
J. Comb. Theory B
Éva Tardos
1990 J jnl
Approximation Algorithms for Scheduling Unrelated Parallel Machines.
Math. Program.
Jan Karel Lenstra, David B. Shmoys, Éva Tardos
1990 A* conf
Improved Dual Network Simplex.
SODA
Serge A. Plotkin, Éva Tardos
1990 A* conf
Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities
STOC
Philip N. Klein, Clifford Stein, Éva Tardos
1990 A* conf
Using Separation Algorithms in Fixed Dimension.
SODA
Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
1989 A* conf
Interior-Point Methods in Parallel Computation
FOCS
Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1989 J jnl
Note on Weintraub's Minimum-Cost Circulation Algorithm.
SIAM J. Comput.
Francisco Barahona, Éva Tardos
1989 J jnl
On fractional multicommodity flows and distance functions.
Discret. Math.
Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos
1988 J jnl
An O(n²(m + n log n)log n) min-cost flow algorithm.
J. ACM
Zvi Galil, Éva Tardos
1988 A* conf
Combinatorial Algorithms for the Generalized Circulation Problem
FOCS
Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
1988 J jnl
Generalized polymatroids and submodular flows.
Math. Program.
András Frank, Éva Tardos
1988 J jnl
The gap between monotone and non-monotone circuit complexity is exponential.
Comb.
Éva Tardos
1987 J jnl
An application of simultaneous Diophantine approximation in combinatorial optimization.
Comb.
András Frank, Éva Tardos
1987 A* conf
Approximation Algorithms for Scheduling Unrelated Parallel Machines
FOCS
Jan Karel Lenstra, David B. Shmoys, Éva Tardos
1986 J jnl
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs.
Oper. Res.
Éva Tardos
1986 A* conf
An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm
FOCS
Zvi Galil, Éva Tardos
1986 J jnl
Layered Augmenting Path Algorithms.
Math. Oper. Res.
Éva Tardos, Craig A. Tovey, Michael A. Trick
1986 J jnl
Sensitivity theorems in integer linear programming.
Math. Program.
William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos
1985 J jnl
A strongly polynomial minimum cost circulation algorithm.
Comb.
Éva Tardos
1985 A* conf
An Application of Simultaneous Approximation in Combinatorial Optimization
FOCS
András Frank, Éva Tardos