default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉva Tardos
Refine list
refinements active!
zoomed in on 245 of 245 records
view refined list in
export refined list as
showing all 245 records
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2025
[i41]Chido Onyeze, Siddhartha Banerjee, Giannis Fikioris, Éva Tardos:
Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria. CoRR abs/2501.14916 (2025)- [i40]David A. Easley, Yoav Kolumbus, Éva Tardos:
Learning in Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners. CoRR abs/2502.08597 (2025) - [i39]Ariana Abel, Yoav Kolumbus, Jeronimo Martin Duque, Éva Tardos:
Learning in Strategic Queuing Systems with Small Buffers. CoRR abs/2502.08898 (2025) - 2024
- [j98]J. Massey Cashore
, Peter I. Frazier, Éva Tardos:
Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks. Math. Oper. Res. 49(3): 1647-1677 (2024) - [c99]Giannis Fikioris, Rachit Agarwal, Éva Tardos:
Incentives in Dominant Resource Fair Allocation Under Dynamic Demands. SAGT 2024: 108-125 - [c98]Jon M. Kleinberg, Emily Ryu, Éva Tardos:
Calibrated Recommendations for Users with Decaying Attention. SAGT 2024: 443-460 - [c97]Jon M. Kleinberg, Sigal Oren, Emily Ryu, Éva Tardos:
Modeling reputation-based behavioral biases in school choice. EC 2024: 671-672 - [i38]Jon M. Kleinberg, Sigal Oren, Emily Ryu, Éva Tardos:
Modeling reputation-based behavioral biases in school choice. CoRR abs/2403.04616 (2024) - [i37]Yoav Kolumbus, Joe Halpern, Éva Tardos:
Paying to Do Better: Games with Payments between Learning Agents. CoRR abs/2405.20880 (2024) - [i36]Giannis Fikioris, Robert Kleinberg, Yoav Kolumbus, Raunak Kumar, Yishay Mansour, Éva Tardos:
Learning in Budgeted Auctions with Spacing Objectives. CoRR abs/2411.04843 (2024) - 2023
- [j97]Jason Gaitonde, Éva Tardos:
The Price of Anarchy of Strategic Queuing Systems. J. ACM 70(3): 20:1-20:63 (2023) - [c96]Giannis Fikioris, Éva Tardos:
Approximately Stationary Bandits with Knapsacks. COLT 2023: 3758-3782 - [c95]Midhul Vuppalapati, Giannis Fikioris, Rachit Agarwal, Asaf Cidon, Anurag Khandelwal, Éva Tardos:
Karma: Resource Allocation for Dynamic Demands. OSDI 2023: 645-662 - [c94]Siddhartha Banerjee, Giannis Fikioris, Éva Tardos:
Robust Pseudo-Markets for Reusable Public Resources. EC 2023: 241 - [c93]Giannis Fikioris, Éva Tardos:
Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions. EC 2023: 678-698 - [i35]Jon M. Kleinberg, Emily Ryu, Éva Tardos:
Calibrated Recommendations for Users with Decaying Attention. CoRR abs/2302.03239 (2023) - [i34]Siddhartha Banerjee, Giannis Fikioris, Éva Tardos:
Robust Pseudo-Markets for Reusable Public Resources. CoRR abs/2302.09127 (2023) - [i33]Giannis Fikioris, Éva Tardos:
Approximately Stationary Bandits with Knapsacks. CoRR abs/2302.14686 (2023) - [i32]Midhul Vuppalapati, Giannis Fikioris, Rachit Agarwal, Asaf Cidon, Anurag Khandelwal, Éva Tardos:
Karma: Resource Allocation for Dynamic Demands. CoRR abs/2305.17222 (2023) - [i31]Giannis Fikioris, Siddhartha Banerjee, Éva Tardos:
Online Resource Sharing via Dynamic Max-Min Fairness: Efficiency, Robustness and Non-Stationarity. CoRR abs/2310.08881 (2023) - 2022
- [j96]Éva Tardos:
The EATCS Award 2022 - Laudatio for Patrick Cousot. Bull. EATCS 137 (2022) - [j95]Éva Tardos:
Invited Article Foreword. J. ACM 69(1): 7:1 (2022) - [j94]Éva Tardos:
Invited Article Foreword. J. ACM 69(2): 16:1 (2022) - [j93]Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Small-Loss Bounds for Online Learning with Partial Information. Math. Oper. Res. 47(3): 2186-2218 (2022) - [c92]J. Massey Cashore, Peter I. Frazier, Éva Tardos:
Dynamic Pricing Provides Robust Equilibria in Stochastic Ride-Sharing Networks. EC 2022: 301-302 - [i30]Jon M. Kleinberg, Emily Ryu, Éva Tardos:
Ordered Submodularity and its Applications to Diversifying Recommendations. CoRR abs/2203.00233 (2022) - [i29]J. Massey Cashore, Peter I. Frazier, Éva Tardos:
Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks. CoRR abs/2205.09679 (2022) - [i28]Giannis Fikioris, Éva Tardos:
Liquid Welfare guarantees for No-Regret Learning in Sequential Budgeted Auctions. CoRR abs/2210.07502 (2022) - 2021
- [j92]Éva Tardos:
The EATCS Award 2022 - Call for Nominations. Bull. EATCS 135 (2021) - [j91]Éva Tardos:
Invited Article Foreword. J. ACM 68(1): 6:1 (2021) - [j90]Éva Tardos:
Invited Articles Foreword. J. ACM 68(2): 12e:1 (2021) - [j89]Éva Tardos:
Invited Article Foreword. J. ACM 68(3): 20:1 (2021) - [j88]Éva Tardos:
Invited Article Foreword. J. ACM 68(4): 29:1 (2021) - [j87]Éva Tardos:
Invited Articles Foreword. J. ACM 68(5): 37:1 (2021) - [j86]Éva Tardos:
Invited Article Foreword. J. ACM 68(6): 47:1 (2021) - [j85]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax and Round. Math. Oper. Res. 46(1): 317-335 (2021) - [j84]Pooya Jalaly, Éva Tardos:
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. ACM Trans. Economics and Comput. 9(1): 4:1-4:20 (2021) - [c91]Hedyeh Beyhaghi, Éva Tardos:
Randomness and Fairness in Two-Sided Matching with Limited Interviews. ITCS 2021: 74:1-74:18 - [c90]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Polarization in Geometric Opinion Dynamics. EC 2021: 499-519 - [c89]Jason Gaitonde, Éva Tardos:
Virtues of Patience in Strategic Queuing Systems. EC 2021: 520-540 - [i27]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Polarization in Geometric Opinion Dynamics. CoRR abs/2106.12459 (2021) - [i26]Giannis Fikioris, Rachit Agarwal, Éva Tardos:
Incentives in Resource Allocation under Dynamic Demands. CoRR abs/2109.12401 (2021) - 2020
- [j83]Marta Kwiatkowska, Éva Tardos, Johan Håstad:
The EATCS Award 2021 - Call for Nominations. Bull. EATCS 132 (2020) - [j82]Éva Tardos:
Invited Article Foreword. J. ACM 67(2): 12:1 (2020) - [j81]Éva Tardos:
Invited Articles Foreword. J. ACM 67(5): 29:1 (2020) - [j80]Éva Tardos:
Invited Articles Foreword. J. ACM 67(6): 35:1 (2020) - [c88]Thodoris Lykouris, Éva Tardos, Drishti Wali:
Feedback graph regret bounds for Thompson Sampling and UCB. ALT 2020: 592-614 - [c87]Jason Gaitonde, Éva Tardos:
Stability and Learning in Strategic Queuing Systems. EC 2020: 319-347 - [c86]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Adversarial Perturbations of Opinion Dynamics in Networks. EC 2020: 471-472 - [i25]Jason Gaitonde, Éva Tardos:
Stability and Learning in Strategic Queuing Systems. CoRR abs/2003.07009 (2020) - [i24]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Adversarial Perturbations of Opinion Dynamics in Networks. CoRR abs/2003.07010 (2020) - [i23]Jason Gaitonde, Éva Tardos:
Virtues of Patience in Strategic Queuing Systems. CoRR abs/2011.10205 (2020) - no results
2010 – 2019
- 2019
- [j79]Artur Czumaj, Marta Kwiatkowska, Éva Tardos:
The EATCS Award 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [j78]Éva Tardos:
Invited Articles Foreword. J. ACM 66(3): 20:1 (2019) - [j77]Éva Tardos:
Invited Articles Foreword. J. ACM 66(6): 43:1 (2019) - [j76]Vasilis Syrgkanis, David Kempe, Éva Tardos:
Information Asymmetries in Common-Value Auctions with Discrete Signals. Math. Oper. Res. 44(4): 1450-1476 (2019) - [i22]Thodoris Lykouris, Éva Tardos, Drishti Wali:
Graph regret bounds for Thompson Sampling and UCB. CoRR abs/1905.09898 (2019) - 2018
- [j75]Éva Tardos:
Invited Article Foreword. J. ACM 65(1) (2018) - [j74]Éva Tardos:
Invited Article Foreword. J. ACM 65(2): 11e:1 (2018) - [j73]Éva Tardos:
Invited Article Foreword. J. ACM 65(3) (2018) - [j72]Éva Tardos:
Invited Article Foreword. J. ACM 65(4): 25:1-25:61 (2018) - [j71]Éva Tardos:
Invited Article Foreword. J. ACM 65(6): 44:1 (2018) - [c85]Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Small-loss bounds for online learning with partial information. COLT 2018: 979-986 - [c84]Pooya Jalaly Khalilabadi, Éva Tardos:
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. WINE 2018: 246-263 - [e6]Éva Tardos, Edith Elkind, Rakesh Vohra:
Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018. ACM 2018 [contents] - 2017
- [j70]Éva Tardos:
Invited Article Foreword. J. ACM 64(1): 6:1 (2017) - [j69]Éva Tardos:
Invited Articles Foreword. J. ACM 64(2): 13:1 (2017) - [j68]Éva Tardos:
Invited Article Foreword. J. ACM 64(3): 22:1 (2017) - [j67]Éva Tardos:
Invited Article Foreword. J. ACM 64(4) (2017) - [j66]Éva Tardos:
Invited Articles Foreword. J. ACM 64(5) (2017) - [j65]Éva Tardos:
Invited Articles Foreword. J. ACM 64(6) (2017) - [j64]Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos:
The Price of Anarchy in Auctions. J. Artif. Intell. Res. 59: 59-101 (2017) - [c83]Saeed Alaei, Pooya Jalaly Khalilabadi, Éva Tardos:
Computing Equilibrium in Matching Markets. EC 2017: 245-261 - [i21]Hedyeh Beyhaghi, Daniela Sabán, Éva Tardos:
Effect of selfish choices in deferred acceptance with short lists. CoRR abs/1701.00849 (2017) - [i20]Pooya Jalaly, Denis Nekipelov, Éva Tardos:
Learning and Trust in Auction Markets. CoRR abs/1703.10672 (2017) - [i19]Pooya Jalaly, Éva Tardos:
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. CoRR abs/1703.10681 (2017) - [i18]Saeed Alaei, Pooya Jalaly, Éva Tardos:
Computing Equilibrium in Matching Markets. CoRR abs/1703.10689 (2017) - [i17]Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Small-loss bounds for online learning with partial information. CoRR abs/1711.03639 (2017) - 2016
- [j63]Éva Tardos:
Invited Articles Foreword. J. ACM 63(1): 8:1 (2016) - [j62]Éva Tardos:
Invited Articles Foreword. J. ACM 63(2): 18:1 (2016) - [j61]Éva Tardos:
Invited Articles Foreword. J. ACM 63(3): 27e:1 (2016) - [j60]Éva Tardos:
Invited Articles Foreword. J. ACM 63(5): 45e:1 (2016) - [j59]R. Preston McAfee, Éva Tardos:
Introduction. ACM Trans. Economics and Comput. 4(3): 12:1 (2016) - [c82]Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Learning in Games: Robustness of Fast Convergence. NIPS 2016: 4727-4735 - [c81]Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos:
Learning and Efficiency in Games with Dynamic Population. SODA 2016: 120-129 - [i16]Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Fast Convergence of Common Learning Algorithms in Games. CoRR abs/1606.06244 (2016) - [i15]Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos:
The Price of Anarchy in Auctions. CoRR abs/1607.07684 (2016) - 2015
- [j58]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos:
Introduction to computer science and economic theory. J. Econ. Theory 156: 1-13 (2015) - [j57]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. J. Econ. Theory 156: 343-388 (2015) - [j56]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as mechanisms: the price of anarchy of relax-and-round. SIGecom Exch. 14(2): 22-25 (2015) - [j55]David Kempe, Jon M. Kleinberg, Éva Tardos:
Maximizing the Spread of Influence through a Social Network. Theory Comput. 11: 105-147 (2015) - [c80]Jason D. Hartline, Vasilis Syrgkanis, Éva Tardos:
No-Regret Learning in Bayesian Games. NIPS 2015: 3061-3069 - [c79]Hedyeh Beyhaghi, Nishanth Dikkala, Éva Tardos:
Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets. SAGT 2015: 300-302 - [c78]Denis Nekipelov, Vasilis Syrgkanis, Éva Tardos:
Econometrics for Learning Agents. EC 2015: 1-18 - [c77]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. EC 2015: 187-201 - [c76]Thomas Kesselheim, Robert D. Kleinberg, Éva Tardos:
Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets. EC 2015: 203-220 - [c75]Vasilis Syrgkanis, David Kempe, Éva Tardos:
Information Asymmetries in Common-Value Auctions with Discrete Signals. EC 2015: 303 - [i14]Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos:
Learning and Efficiency in Games with Dynamic Population. CoRR abs/1505.00391 (2015) - [i13]Denis Nekipelov, Vasilis Syrgkanis, Éva Tardos:
Econometrics for Learning Agents. CoRR abs/1505.00720 (2015) - [i12]Jason D. Hartline, Vasilis Syrgkanis, Éva Tardos:
No-Regret Learning in Repeated Bayesian Games. CoRR abs/1507.00418 (2015) - [i11]Hedyeh Beyhaghi, Nishanth Dikkala, Éva Tardos:
Effect of Strategic Grading and Early Offers in Matching Markets. CoRR abs/1507.02718 (2015) - [i10]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. CoRR abs/1511.09208 (2015) - 2014
- [c74]Yoram Bachrach, Vasilis Syrgkanis, Éva Tardos, Milan Vojnovic:
Strong Price of Anarchy, Utility Games and Coalitional Dynamics. SAGT 2014: 218-230 - [c73]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Mechanism with unique learnable equilibria. EC 2014: 877-894 - 2013
- [j54]R. Preston McAfee, Éva Tardos:
Notes from the EC'13 program chairs. SIGecom Exch. 12(1): 2-7 (2013) - [j53]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos:
Network Formation in the Presence of Contagious Risk. ACM Trans. Economics and Comput. 1(2): 6:1-6:20 (2013) - [c72]Vasilis Syrgkanis, Éva Tardos:
Composable and efficient mechanisms. STOC 2013: 211-220 - [c71]Nishanth Dikkala, Éva Tardos:
Can Credit Increase Revenue? WINE 2013: 121-133 - [c70]Brendan Lucier, Yaron Singer, Vasilis Syrgkanis, Éva Tardos:
Equilibrium in Combinatorial Public Projects. WINE 2013: 347-360 - [e5]Michael J. Kearns, R. Preston McAfee, Éva Tardos:
Proceedings of the fourteenth ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, June 16-20, 2013. ACM 2013, ISBN 978-1-4503-1962-1 [contents] - [i9]Yoram Bachrach, Vasilis Syrgkanis, Éva Tardos, Milan Vojnovic:
Strong Price of Anarchy and Coalitional Dynamics. CoRR abs/1307.2537 (2013) - [i8]Sergiu Hart, Éva Tardos, Bernhard von Stengel:
Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161). Dagstuhl Reports 3(4): 69-90 (2013) - 2012
- [j52]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
The dining bidder problem: à la russe et à la française. SIGecom Exch. 11(2): 25-28 (2012) - [c69]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
The curse of simultaneity. ITCS 2012: 60-67 - [c68]Vasilis Syrgkanis, Éva Tardos:
Bayesian sequential auctions. EC 2012: 929-944 - [c67]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
Sequential auctions and externalities. SODA 2012: 869-886 - [c66]Brendan Lucier, Renato Paes Leme, Éva Tardos:
On revenue in the generalized second price auction. WWW 2012: 361-370 - [i7]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos:
On the efficiency of equilibria in generalized second price auctions. CoRR abs/1201.6429 (2012) - [i6]Vasilis Syrgkanis, Éva Tardos:
Bayesian Sequential Auctions. CoRR abs/1206.4771 (2012) - [i5]Vasilis Syrgkanis, Éva Tardos:
Composable and Efficient Mechanisms. CoRR abs/1211.1325 (2012) - 2011
- [j51]Robert Kleinberg, Georgios Piliouras, Éva Tardos:
Load balancing without regret in the bulletin board model. Distributed Comput. 24(1): 21-29 (2011) - [j50]Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover:
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing. SIAM J. Discret. Math. 25(4): 1667-1686 (2011) - [c65]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos:
Which Networks are Least Susceptible to Cascading Failures? FOCS 2011: 393-402 - [c64]Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos:
Beyond the Nash Equilibrium Barrier. ICS 2011: 125-140 - [c63]Larry Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos:
Network formation in the presence of contagious risk. EC 2011: 1-10 - [i4]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
Sequential Auctions and Externalities. CoRR abs/1108.2452 (2011) - 2010
- [j49]Zoya Svitkina, Éva Tardos:
Facility location with hierarchical facility costs. ACM Trans. Algorithms 6(2): 37:1-37:22 (2010) - [c62]Pedro F. Felzenszwalb, Gyula Pap, Éva Tardos, Ramin Zabih:
Globally optimal pixel labeling algorithms for tree metrics. CVPR 2010: 3153-3160 - [c61]Renato Paes Leme, Éva Tardos:
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction. FOCS 2010: 735-744 - no results
2000 – 2009
- 2009
- [j48]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos:
Trading networks with price-setting agents. Games Econ. Behav. 67(1): 36-50 (2009) - [j47]Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks 53(4): 345-357 (2009) - [c60]Robert D. Kleinberg, Georgios Piliouras, Éva Tardos:
Load balancing without regret in the bulletin board model. PODC 2009: 56-62 - [c59]Robert Kleinberg, Georgios Piliouras, Éva Tardos:
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. STOC 2009: 533-542 - [c58]Éva Tardos:
Quantifying Outcomes in Games. WINE 2009: 17 - [c57]Thành Nguyen, Éva Tardos:
Approximate Pure Nash Equilibria via Lovász Local Lemma. WINE 2009: 160-171 - 2008
- [j46]Anupam Gupta, Aravind Srinivasan, Éva Tardos:
Cost-Sharing Mechanisms for Network Design. Algorithmica 50(1): 98-119 (2008) - [j45]Irit Dinur, Éva Tardos:
Special Issue on Foundations of Computer Science. SIAM J. Comput. 37(6) (2008) - [j44]Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden:
The Price of Stability for Network Design with Fair Cost Allocation. SIAM J. Comput. 38(4): 1602-1623 (2008) - [j43]Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler:
Strategic network formation with structural holes. SIGecom Exch. 7(3) (2008) - [j42]Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler:
Near-Optimal Network Design with Selfish Agents. Theory Comput. 4(1): 77-109 (2008) - [c56]Thành Nguyen, Éva Tardos:
Parallel Imaging Problem. ESA 2008: 684-695 - [c55]Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler:
Strategic network formation with structural holes. EC 2008: 284-293 - [c54]Jon M. Kleinberg, Éva Tardos:
Balanced outcomes in social exchange networks. STOC 2008: 295-304 - [e4]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel:
Equilibrium Computation, 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings 07471, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2007
- [j41]Ara Hayrapetyan, Éva Tardos, Tom Wexler:
A network pricing game for selfish traffic. Distributed Comput. 19(4): 255-266 (2007) - [j40]Aaron Archer, Éva Tardos:
Frugal path mechanisms. ACM Trans. Algorithms 3(1): 3:1-3:22 (2007) - [c53]Thành Nguyen, Éva Tardos:
Approximately maximizing efficiency and revenue in polyhedral environments. EC 2007: 11-19 - [c52]Larry Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos:
Trading networks with price-setting agents. EC 2007: 143-151 - [e3]Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani:
Algorithmic Game Theory. Cambridge University Press 2007, ISBN 9780511800481 - [e2]Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz:
Computational Social Systems and the Internet, 1.7. - 6.7.2007. Dagstuhl Seminar Proceedings 07271, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i3]Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz:
07271 Summary - Computational Social Systems and the Internet. Computational Social Systems and the Internet 2007 - [i2]Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz:
07271 Abstracts Collection - Computational Social Systems and the Internet . Computational Social Systems and the Internet 2007 - [i1]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel:
07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007 - 2006
- [b1]Jon M. Kleinberg, Éva Tardos:
Algorithm design. Addison-Wesley 2006, ISBN 978-0-321-37291-8, pp. I-XXIII, 1-838 - [c51]Zoya Svitkina, Éva Tardos:
Facility location with hierarchical facility costs. SODA 2006: 153-161 - [c50]Ara Hayrapetyan, Éva Tardos, Tom Wexler:
The effect of collusion in congestion games. STOC 2006: 89-98 - 2005
- [j39]Vardges Melkonian, Éva Tardos:
Primal-Dual-Based Algorithms for a Directed Network Design Problem. INFORMS J. Comput. 17(2): 159-174 (2005) - [c49]Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover:
Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. ICALP 2005: 497-512 - [c48]David Kempe, Jon M. Kleinberg, Éva Tardos:
Influential Nodes in a Diffusion Model for Social Networks. ICALP 2005: 1127-1138 - [c47]Ara Hayrapetyan, Éva Tardos, Tom Wexler:
A network pricing game for selfish traffic. PODC 2005: 284-291 - [c46]Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. SODA 2005: 562-571 - [c45]Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos:
Network design for information networks. SODA 2005: 933-942 - 2004
- [j38]Tim Roughgarden, Éva Tardos:
Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econ. Behav. 47(2): 389-403 (2004) - [j37]Vardges Melkonian, Éva Tardos:
Algorithms for a network design problem with crossing supermodular demands. Networks 43(4): 256-265 (2004) - [c44]Anupam Gupta, Aravind Srinivasan, Éva Tardos:
Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM 2004: 139-150 - [c43]Zoya Svitkina, Éva Tardos:
Min-Max Multiway Cut. APPROX-RANDOM 2004: 207-218 - [c42]Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden:
The Price of Stability for Network Design with Fair Cost Allocation. FOCS 2004: 295-304 - [c41]Henry C. Lin, Tim Roughgarden, Éva Tardos:
A stronger bound on Braess's Paradox. SODA 2004: 340-341 - [c40]Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos:
Approximate classification via earthmover metrics. SODA 2004: 1079-1087 - [c39]Éva Tardos:
Network games. STOC 2004: 341-342 - 2003
- [j36]Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos:
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. Internet Math. 1(2): 129-150 (2003) - [j35]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling data transfers in a network and the set scheduling problem. J. Algorithms 48(2): 314-332 (2003) - [c38]Éva Tardos:
Approximation Algorithms and Network Games. ESA 2003: 6 - [c37]Martin Pál, Éva Tardos:
Group Strategyproof Mechanisms via Primal-Dual Algorithms. FOCS 2003: 584-593 - [c36]David Kempe, Jon M. Kleinberg, Éva Tardos:
Maximizing the spread of influence through a social network. KDD 2003: 137-146 - [c35]Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos:
An approximate truthful mechanism for combinatorial auctions with single parameter agents. SODA 2003: 205-214 - [c34]Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler:
Near-optimal network design with selfish agents. STOC 2003: 511-520 - 2002
- [j34]Tim Roughgarden, Éva Tardos:
How bad is selfish routing? J. ACM 49(2): 236-259 (2002) - [j33]Jon M. Kleinberg, Éva Tardos:
Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. J. ACM 49(5): 616-639 (2002) - [j32]Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys:
A Constant-Factor Approximation Algorithm for the k-Median Problem. J. Comput. Syst. Sci. 65(1): 129-149 (2002) - [c33]Aaron Archer, Éva Tardos:
Frugal path mechanisms. SODA 2002: 991-999 - 2001
- [j31]Jon M. Kleinberg, Yuval Rabani, Éva Tardos:
Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63(1): 2-20 (2001) - [c32]Martin Pál, Éva Tardos, Tom Wexler:
Facility Location with Nonuniform Hard Capacities. FOCS 2001: 329-338 - [c31]Aaron Archer, Éva Tardos:
Truthful Mechanisms for One-Parameter Agents. FOCS 2001: 482-491 - 2000
- [j30]Bruce Hoppe, Éva Tardos:
The Quickest Transshipment Problem. Math. Oper. Res. 25(1): 36-62 (2000) - [j29]Jon M. Kleinberg, Yuval Rabani, Éva Tardos:
Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30(1): 191-217 (2000) - [c30]Tim Roughgarden, Éva Tardos:
How Bad is Selfish Routing? FOCS 2000: 93-102 - [c29]Anupam Gupta, Éva Tardos:
A constant factor approximation algorithm for a class of classification problems. STOC 2000: 652-658 - no results
1990 – 1999
- 1999
- [j28]Lisa Fleischer, Éva Tardos:
Separating Maximally Violated Comb Inequalities in Planar Graphs. Math. Oper. Res. 24(1): 130-148 (1999) - [c28]Jon M. Kleinberg, Éva Tardos:
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999: 14-23 - [c27]Jon M. Kleinberg, Yuval Rabani, Éva Tardos:
Fairness in Routing and Load Balancing. FOCS 1999: 568-578 - [c26]Vardges Melkonian, Éva Tardos:
Approximation Algorithms for a Directed Network Design Problem. IPCO 1999: 345-360 - [c25]Éva Tardos:
Approximation Algorithms for Some Clustering and Classification Problems. ISAAC 1999: 183 - [c24]Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys:
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). STOC 1999: 1-10 - [c23]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling Data Transfers in a Network and the Set Scheduling Problem. STOC 1999: 189-197 - 1998
- [j27]Jon M. Kleinberg, Éva Tardos:
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. J. Comput. Syst. Sci. 57(1): 61-73 (1998) - [j26]Lisa Fleischer, Éva Tardos:
Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3-5): 71-80 (1998) - [c22]Éva Tardos, Kevin D. Wayne:
Simple Generalized Maximum Flow Algorithms. IPCO 1998: 310-324 - 1997
- [j25]Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos:
Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms 22(2): 241-269 (1997) - [c21]David B. Shmoys, Éva Tardos, Karen I. Aardal:
Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC 1997: 265-274 - [c20]Jon M. Kleinberg, Yuval Rabani, Éva Tardos:
Allocating Bandwidth for Bursty Connections. STOC 1997: 664-673 - 1996
- [c19]Lisa Fleischer, Éva Tardos:
Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO 1996: 475-489 - [c18]Yuval Rabani, Éva Tardos:
Distributed Packet Switching in Arbitrary Networks. STOC 1996: 366-375 - [e1]Éva Tardos:
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA. ACM/SIAM 1996, ISBN 0-89871-366-8 [contents] - 1995
- [j24]Serge A. Plotkin, Éva Tardos:
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Comb. 15(3): 425-434 (1995) - [j23]Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas:
Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. 50(2): 228-243 (1995) - [j22]Serge A. Plotkin, David B. Shmoys, Éva Tardos:
Fast Approximation Algorithms for Fractional Packing and Covering Problems. Math. Oper. Res. 20(2): 257-301 (1995) - [c17]Jon M. Kleinberg, Éva Tardos:
Disjoint Paths in Densely Embedded Graphs. FOCS 1995: 52-61 - [c16]Bruce Hoppe, Éva Tardos:
The Quickest Transshipment Problem. SODA 1995: 512-521 - [c15]Jon M. Kleinberg, Éva Tardos:
Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995: 26-35 - 1994
- [j21]Dan Gusfield, Éva Tardos:
A Faster Parametric Minimum-Cut Algorithm. Algorithmica 11(3): 278-290 (1994) - [j20]Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos:
Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM J. Comput. 23(3): 466-487 (1994) - [c14]Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson:
Improved Approximation Algorithms for Network Design Problems. SODA 1994: 223-232 - [c13]Bruce Hoppe, Éva Tardos:
Polynomial Time Algorithms for Some Evacuation Problems. SODA 1994: 433-441 - 1993
- [j19]Éva Tardos, Vijay V. Vazirani:
Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. Inf. Process. Lett. 47(2): 77-80 (1993) - [j18]James B. Orlin, Serge A. Plotkin, Éva Tardos:
Polynomial dual network simplex algorithms. Math. Program. 60: 255-276 (1993) - [j17]David B. Shmoys, Éva Tardos:
An approximation algorithm for the generalized assignment problem. Math. Program. 62: 461-474 (1993) - [c12]David B. Shmoys, Éva Tardos:
Scheduling Unrelated Machines with Costs. SODA 1993: 448-454 - [c11]Serge A. Plotkin, Éva Tardos:
Improved bounds on the max-flow min-cut ratio for multicommodity flows. STOC 1993: 691-697 - 1992
- [j16]András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos:
Algorithms for Routing around a Rectangle. Discret. Appl. Math. 40(4): 363-378 (1992) - [j15]Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos:
Using Separation Algorithms in Fixed Dimension. J. Algorithms 13(1): 79-98 (1992) - [j14]Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos:
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. SIAM J. Comput. 21(1): 140-150 (1992) - 1991
- [j13]Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 16(2): 351-381 (1991) - [c10]Serge A. Plotkin, David B. Shmoys, Éva Tardos:
Fast Approximation Algorithms for Fractional Packing and Covering Problems. FOCS 1991: 495-504 - [c9]Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas:
Fast Approximation Algorithms for Multicommodity Flow Problems. STOC 1991: 101-111 - 1990
- [j12]Éva Tardos:
An intersection theorem for supermatroids. J. Comb. Theory B 50(2): 150-159 (1990) - [j11]Jan Karel Lenstra, David B. Shmoys, Éva Tardos:
Approximation Algorithms for Scheduling Unrelated Parallel Machines. Math. Program. 46: 259-271 (1990) - [c8]Serge A. Plotkin, Éva Tardos:
Improved Dual Network Simplex. SODA 1990: 367-376 - [c7]Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos:
Using Separation Algorithms in Fixed Dimension. SODA 1990: 377-387 - [c6]Philip N. Klein, Clifford Stein, Éva Tardos:
Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities. STOC 1990: 310-321 - no results
1980 – 1989
- 1989
- [j10]Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos:
On fractional multicommodity flows and distance functions. Discret. Math. 73(1-2): 99-109 (1989) - [j9]Francisco Barahona, Éva Tardos:
Note on Weintraub's Minimum-Cost Circulation Algorithm. SIAM J. Comput. 18(3): 579-583 (1989) - [c5]Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos:
Interior-Point Methods in Parallel Computation. FOCS 1989: 350-355 - 1988
- [j8]Éva Tardos:
The gap between monotone and non-monotone circuit complexity is exponential. Comb. 8(1): 141-142 (1988) - [j7]Zvi Galil, Éva Tardos:
An O(n²(m + n log n)log n) min-cost flow algorithm. J. ACM 35(2): 374-386 (1988) - [j6]András Frank, Éva Tardos:
Generalized polymatroids and submodular flows. Math. Program. 42(1-3): 489-563 (1988) - [c4]Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. FOCS 1988: 432-443 - 1987
- [j5]András Frank, Éva Tardos:
An application of simultaneous Diophantine approximation in combinatorial optimization. Comb. 7(1): 49-65 (1987) - [c3]Jan Karel Lenstra, David B. Shmoys, Éva Tardos:
Approximation Algorithms for Scheduling Unrelated Parallel Machines. FOCS 1987: 217-224 - 1986
- [j4]Éva Tardos:
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs. Oper. Res. 34(2): 250-256 (1986) - [j3]Éva Tardos, Craig A. Tovey, Michael A. Trick:
Layered Augmenting Path Algorithms. Math. Oper. Res. 11(2): 362-370 (1986) - [j2]William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos:
Sensitivity theorems in integer linear programming. Math. Program. 34(3): 251-264 (1986) - [c2]Zvi Galil, Éva Tardos:
An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm. FOCS 1986: 1-9 - 1985
- [j1]Éva Tardos:
A strongly polynomial minimum cost circulation algorithm. Comb. 5(3): 247-256 (1985) - [c1]András Frank, Éva Tardos:
An Application of Simultaneous Approximation in Combinatorial Optimization. FOCS 1985: 459-463 - no results
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.
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.
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.
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 2025-03-13 21:27 CET 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:
