Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Éva Tardos
2010 – today
- 2013
[j43]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 (2013)- [c73]
- [e4]Michael Kearns, R. Preston McAfee, Éva Tardos (Eds.): ACM Conference on Electronic Commerce, EC '13, Philadelphia, PA, USA, June 16-20, 2013. ACM 2013, ISBN 978-1-4503-1962-1
- [i6]Yoram Bachrach, Vasilis Syrgkanis, Éva Tardos, Milan Vojnovic: Strong Price of Anarchy and Coalitional Dynamics. CoRR abs/1307.2537 (2013)
- [i5]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
- [c72]
- [c71]Vasilis Syrgkanis, Éva Tardos: Bayesian sequential auctions. ACM Conference on Electronic Commerce 2012: 929-944
- [c70]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos: Sequential auctions and externalities. SODA 2012: 869-886
- [c69]Brendan Lucier, Renato Paes Leme, Éva Tardos: On revenue in the generalized second price auction. WWW 2012: 361-370
- [i4]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)
- [i3]
- [i2]
- 2011
- [j42]Robert Kleinberg, Georgios Piliouras, Éva Tardos: Load balancing without regret in the bulletin board model. Distributed Computing 24(1): 21-29 (2011)
- [j41]Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover: Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing. SIAM J. Discrete Math. 25(4): 1667-1686 (2011)
- [c68]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
- [c67]Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos: Beyond the Nash Equilibrium Barrier. ICS 2011: 125-140
- [c66]Larry Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos: Network formation in the presence of contagious risk. ACM Conference on Electronic Commerce 2011: 1-10
- [i1]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos: Sequential Auctions and Externalities. CoRR abs/1108.2452 (2011)
- 2010
- [j40]Zoya Svitkina, Éva Tardos: Facility location with hierarchical facility costs. ACM Transactions on Algorithms 6(2) (2010)
- [c65]Pedro F. Felzenszwalb, Gyula Pap, Éva Tardos, Ramin Zabih: Globally optimal pixel labeling algorithms for tree metrics. CVPR 2010: 3153-3160
- [c64]Renato Paes Leme, Éva Tardos: Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction. FOCS 2010: 735-744
2000 – 2009
- 2009
- [j39]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos: Trading networks with price-setting agents. Games and Economic Behavior 67(1): 36-50 (2009)
- [j38]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)
- [c63]Robert D. Kleinberg, Georgios Piliouras, Éva Tardos: Load balancing without regret in the bulletin board model. PODC 2009: 56-62
- [c62]Robert Kleinberg, Georgios Piliouras, Éva Tardos: Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. STOC 2009: 533-542
- [c61]
- [c60]Thành Nguyen, Éva Tardos: Approximate Pure Nash Equilibria via Lovász Local Lemma. WINE 2009: 160-171
- 2008
- [j37]Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. Algorithmica 50(1): 98-119 (2008)
- [j36]Irit Dinur, Éva Tardos: Special Issue on Foundations of Computer Science. SIAM J. Comput. 37(6) (2008)
- [j35]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)
- [j34]Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler: Strategic network formation with structural holes. SIGecom Exchanges 7(3) (2008)
- [j33]Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler: Near-Optimal Network Design with Selfish Agents. Theory of Computing 4(1): 77-109 (2008)
- [c59]
- [c58]Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler: Strategic network formation with structural holes. ACM Conference on Electronic Commerce 2008: 284-293
- [c57]
- [e3]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel (Eds.): Equilibrium Computation, 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings 07471, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- 2007
- [j32]Ara Hayrapetyan, Éva Tardos, Tom Wexler: A network pricing game for selfish traffic. Distributed Computing 19(4): 255-266 (2007)
- [j31]
- [c56]Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz: 07271 Summary - Computational Social Systems and the Internet. Computational Social Systems and the Internet 2007
- [c55]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
- [c54]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: 07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007
- [c53]Thành Nguyen, Éva Tardos: Approximately maximizing efficiency and revenue in polyhedral environments. ACM Conference on Electronic Commerce 2007: 11-19
- [c52]Larry Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos: Trading networks with price-setting agents. ACM Conference on Electronic Commerce 2007: 143-151
- [e2]Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz (Eds.): 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
- 2006
- [b1]Jon M. Kleinberg, Éva Tardos: Algorithm design. Addison-Wesley 2006, ISBN 978-0-321-37291-8, pp. I-XXIII, 1-838
- [c51]
- [c50]Ara Hayrapetyan, Éva Tardos, Tom Wexler: The effect of collusion in congestion games. STOC 2006: 89-98
- 2005
- [j30]Vardges Melkonian, Éva Tardos: Primal-Dual-Based Algorithms for a Directed Network Design Problem. INFORMS Journal on Computing 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
- [j29]Tim Roughgarden, Éva Tardos: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior 47(2): 389-403 (2004)
- [j28]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]
- [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]
- [c40]Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos: Approximate classification via earthmover metrics. SODA 2004: 1079-1087
- [c39]
- 2003
- [j27]Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. Internet Mathematics 1(2): 129-150 (2003)
- [j26]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]
- [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
- [j25]
- [j24]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)
- [j23]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]
- 2001
- [j22]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]
- 2000
- [j21]
- [j20]Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30(1): 191-217 (2000)
- [c30]
- [c29]Anupam Gupta, Éva Tardos: A constant factor approximation algorithm for a class of classification problems. STOC 2000: 652-658
1990 – 1999
- 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
- [j19]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)
- [j18]Lisa Fleischer, Éva Tardos: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3-5): 71-80 (1998)
- [c22]
- 1997
- [j17]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 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]
- [e1]Éva Tardos (Ed.): Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia. ACM/SIAM 1996, ISBN 0-89871-366-8
- 1995
- [j16]Serge A. Plotkin, Éva Tardos: Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Combinatorica 15(3): 425-434 (1995)
- [c17]
- [c16]
- [c15]Jon M. Kleinberg, Éva Tardos: Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995: 26-35
- 1994
- [j15]Dan Gusfield, Éva Tardos: A Faster Parametric Minimum-Cut Algorithm. Algorithmica 11(3): 278-290 (1994)
- [j14]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
- [j13]É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)
- [j12]James B. Orlin, Serge A. Plotkin, Éva Tardos: Polynomial dual network simplex algorithms. Math. Program. 60: 255-276 (1993)
- [j11]David B. Shmoys, Éva Tardos: An approximation algorithm for the generalized assignment problem. Math. Program. 62: 461-474 (1993)
- [c12]
- [c11]Serge A. Plotkin, Éva Tardos: Improved bounds on the max-flow min-cut ratio for multicommodity flows. STOC 1993: 691-697
- 1992
- [j10]Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos: Using Separation Algorithms in Fixed Dimension. J. Algorithms 13(1): 79-98 (1992)
- [j9]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
- [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
- [j8]Éva Tardos: An intersection theorem for supermatroids. J. Comb. Theory, Ser. B 50(2): 150-159 (1990)
- [j7]Jan Karel Lenstra, David B. Shmoys, Éva Tardos: Approximation Algorithms for Scheduling Unrelated Parallel Machines. Math. Program. 46: 259-271 (1990)
- [c8]
- [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
1980 – 1989
- 1989
- [j6]Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos: On fractional multicommodity flows and distance functions. Discrete Mathematics 73(1-2): 99-109 (1989)
- [j5]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
- [j4]Éva Tardos: The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8(1): 141-142 (1988)
- [j3]
- [c4]Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos: Combinatorial Algorithms for the Generalized Circulation Problem. FOCS 1988: 432-443
- 1987
- [j2]András Frank, Éva Tardos: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 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
- [c2]
- 1985
- [j1]Éva Tardos: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3): 247-256 (1985)
- [c1]András Frank, Éva Tardos: An Application of Simultaneous Approximation in Combinatorial Optimization. FOCS 1985: 459-463
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:08 CEST by the dblp team