Éva Tardos

According to our database1, Éva Tardos authored at least 136 papers between 1985 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 1998, "For fundamental contributions in the design and analysis of algorithms, combinatorial optimization, network flows, and approximation algorithms.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Invited Article Foreword.
J. ACM, 2020

Adversarial Perturbations of Opinion Dynamics in Networks.
CoRR, 2020

Stability and Learning in Strategic Queuing Systems.
CoRR, 2020

Feedback graph regret bounds for Thompson Sampling and UCB.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Information Asymmetries in Common-Value Auctions with Discrete Signals.
Math. Oper. Res., 2019

The EATCS Award 2020 - Call for Nominations.
Bull. EATCS, 2019

Graph regret bounds for Thompson Sampling and UCB.
CoRR, 2019

2018
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Small-loss bounds for online learning with partial information.
Proceedings of the Conference On Learning Theory, 2018

2017
The Price of Anarchy in Auctions.
J. Artif. Intell. Res., 2017

Invited Articles Foreword.
J. ACM, 2017

Learning and Trust in Auction Markets.
CoRR, 2017

Effect of selfish choices in deferred acceptance with short lists.
CoRR, 2017

Computing Equilibrium in Matching Markets.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Introduction.
ACM Trans. Economics and Comput., 2016

Fast Convergence of Common Learning Algorithms in Games.
CoRR, 2016

Learning and Efficiency in Games with Dynamic Population.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Learning in Games: Robustness of Fast Convergence.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Maximizing the Spread of Influence through a Social Network.
Theory Comput., 2015

Algorithms as mechanisms: the price of anarchy of relax-and-round.
SIGecom Exch., 2015

Bounding the inefficiency of outcomes in generalized second price auctions.
J. Econ. Theory, 2015

Introduction to computer science and economic theory.
J. Econ. Theory, 2015

No-Regret Learning in Repeated Bayesian Games.
CoRR, 2015

Effect of Strategic Grading and Early Offers in Matching Markets.
CoRR, 2015

Econometrics for Learning Agents.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

No-Regret Learning in Bayesian Games.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014
Mechanism with unique learnable equilibria.
Proceedings of the ACM Conference on Economics and Computation, 2014

Strong Price of Anarchy, Utility Games and Coalitional Dynamics.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013
Network Formation in the Presence of Contagious Risk.
ACM Trans. Economics and Comput., 2013

Notes from the EC'13 program chairs.
SIGecom Exch., 2013

Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161).
Dagstuhl Reports, 2013

Strong Price of Anarchy and Coalitional Dynamics.
CoRR, 2013

Equilibrium in Combinatorial Public Projects.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Can Credit Increase Revenue?
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Composable and efficient mechanisms.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
The dining bidder problem: à la russe et à la française.
SIGecom Exch., 2012

On the efficiency of equilibria in generalized second price auctions
CoRR, 2012

On revenue in the generalized second price auction.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Sequential auctions and externalities.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Bayesian sequential auctions.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

The curse of simultaneity.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing.
SIAM J. Discret. Math., 2011

Load balancing without regret in the bulletin board model.
Distributed Comput., 2011

Beyond the Nash Equilibrium Barrier.
Proceedings of the Innovations in Computer Science, 2011

Which Networks are Least Susceptible to Cascading Failures?
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Facility location with hierarchical facility costs.
ACM Trans. Algorithms, 2010

Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Globally optimal pixel labeling algorithms for tree metrics.
Proceedings of the Twenty-Third IEEE Conference on Computer Vision and Pattern Recognition, 2010

2009
Approximating the smallest k-edge connected spanning subgraph by LP-rounding.
Networks, 2009

Trading networks with price-setting agents.
Games Econ. Behav., 2009

Quantifying Outcomes in Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Approximate Pure Nash Equilibria via Lovász Local Lemma.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Near-Optimal Network Design with Selfish Agents.
Theory Comput., 2008

Strategic network formation with structural holes.
SIGecom Exch., 2008

Special Issue on Foundations of Computer Science.
SIAM J. Comput., 2008

The Price of Stability for Network Design with Fair Cost Allocation.
SIAM J. Comput., 2008

Cost-Sharing Mechanisms for Network Design.
Algorithmica, 2008

Balanced outcomes in social exchange networks.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Parallel Imaging Problem.
Proceedings of the Algorithms, 2008

2007
Frugal path mechanisms.
ACM Trans. Algorithms, 2007

A network pricing game for selfish traffic.
Distributed Comput., 2007

Approximately maximizing efficiency and revenue in polyhedral environments.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

07471 Abstracts Collection - Equilibrium Computation.
Proceedings of the Equilibrium Computation, 18.11. - 23.11.2007, 2007

07271 Abstracts Collection - Computational Social Systems and the Internet .
Proceedings of the Computational Social Systems and the Internet, 1.7. - 6.7.2007, 2007

07271 Summary - Computational Social Systems and the Internet.
Proceedings of the Computational Social Systems and the Internet, 1.7. - 6.7.2007, 2007

2006
The effect of collusion in congestion games.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Algorithm design.
Addison-Wesley, ISBN: 978-0-321-37291-8, 2006

2005
Primal-Dual-Based Algorithms for a Directed Network Design Problem.
INFORMS J. Comput., 2005

Network design for information networks.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Influential Nodes in a Diffusion Model for Social Networks.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Algorithms for a network design problem with crossing supermodular demands.
Networks, 2004

Bounding the inefficiency of equilibria in nonatomic congestion games.
Games Econ. Behav., 2004

Network games.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

A stronger bound on Braess's Paradox.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximate classification via earthmover metrics.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Min-Max Multiway Cut.
Proceedings of the Approximation, 2004

2003
Scheduling data transfers in a network and the set scheduling problem.
J. Algorithms, 2003

An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.
Internet Math., 2003

Group Strategyproof Mechanisms via Primal-Dual Algorithms.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Approximation Algorithms and Network Games.
Proceedings of the Algorithms, 2003

2002
A Constant-Factor Approximation Algorithm for the k-Median Problem.
J. Comput. Syst. Sci., 2002

How bad is selfish routing?
J. ACM, 2002

Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields.
J. ACM, 2002

2001
Fairness in Routing and Load Balancing.
J. Comput. Syst. Sci., 2001

Facility Location with Nonuniform Hard Capacities.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Truthful Mechanisms for One-Parameter Agents.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Allocating Bandwidth for Bursty Connections.
SIAM J. Comput., 2000

The Quickest Transshipment Problem.
Math. Oper. Res., 2000

A constant factor approximation algorithm for a class of classification problems.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Separating Maximally Violated Comb Inequalities in Planar Graphs.
Math. Oper. Res., 1999

A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Approximation Algorithms for Some Clustering and Classification Problems.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Approximation Algorithms for a Directed Network Design Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
Efficient continuous-time dynamic network flow algorithms.
Oper. Res. Lett., 1998

Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks.
J. Comput. Syst. Sci., 1998

Simple Generalized Maximum Flow Algorithms.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
Approximation Algorithms for Steiner and Directed Multicuts.
J. Algorithms, 1997

Approximation Algorithms for Facility Location Problems (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Distributed Packet Switching in Arbitrary Networks.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995
Fast Approximation Algorithms for Fractional Packing and Covering Problems.
Math. Oper. Res., 1995

Fast Approximation Algorithms for Multicommodity Flow Problems.
J. Comput. Syst. Sci., 1995

Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.
Combinatorica, 1995

Disjoint Paths in Densely Embedded Graphs.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts.
SIAM J. Comput., 1994

A Faster Parametric Minimum-Cut Algorithm.
Algorithmica, 1994

Polynomial Time Algorithms for Some Evacuation Problems.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Improved Approximation Algorithms for Network Design Problems.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
An approximation algorithm for the generalized assignment problem.
Math. Program., 1993

Polynomial dual network simplex algorithms.
Math. Program., 1993

Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs.
Inf. Process. Lett., 1993

Scheduling Unrelated Machines with Costs.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.
SIAM J. Comput., 1992

Using Separation Algorithms in Fixed Dimension.
J. Algorithms, 1992

Algorithms for Routing around a Rectangle.
Discret. Appl. Math., 1992

1991
Combinatorial Algorithms for the Generalized Circulation Problem.
Math. Oper. Res., 1991

1990
Approximation Algorithms for Scheduling Unrelated Parallel Machines.
Math. Program., 1990

An intersection theorem for supermatroids.
J. Comb. Theory, Ser. B, 1990

Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Improved Dual Network Simplex.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Note on Weintraub's Minimum-Cost Circulation Algorithm.
SIAM J. Comput., 1989

On fractional multicommodity flows and distance functions.
Discret. Math., 1989

Interior-Point Methods in Parallel Computation
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Generalized polymatroids and submodular flows.
Math. Program., 1988

An O(n²(m + n log n)log n) min-cost flow algorithm.
J. ACM, 1988

The gap between monotone and non-monotone circuit complexity is exponential.
Combinatorica, 1988

1987
An application of simultaneous Diophantine approximation in combinatorial optimization.
Combinatorica, 1987

1986
Sensitivity theorems in integer linear programming.
Math. Program., 1986

Layered Augmenting Path Algorithms.
Math. Oper. Res., 1986

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs.
Oper. Res., 1986

An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
A strongly polynomial minimum cost circulation algorithm.
Combinatorica, 1985

An Application of Simultaneous Approximation in Combinatorial Optimization
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985


  Loading...