| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos |
Sequential auctions and externalities. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Brendan Lucier, Renato Paes Leme, Éva Tardos |
On revenue in the generalized second price auction. |
WWW |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos |
The curse of simultaneity. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos |
Sequential Auctions and Externalities |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Kleinberg, Georgios Piliouras, Éva Tardos |
Load balancing without regret in the bulletin board model. |
Distributed Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos |
Beyond the Nash Equilibrium Barrier. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos |
Which Networks are Least Susceptible to Cascading Failures? |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoya Svitkina, Éva Tardos |
Facility location with hierarchical facility costs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro F. Felzenszwalb, Gyula Pap, Éva Tardos, Ramin Zabih |
Globally optimal pixel labeling algorithms for tree metrics. |
CVPR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Renato Paes Leme, Éva Tardos |
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson |
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos |
Trading networks with price-setting agents. |
Games and Economic Behavior |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Tardos |
Quantifying Outcomes in Games. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thành Nguyen, Éva Tardos |
Approximate Pure Nash Equilibria via Lovász Local Lemma. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert D. Kleinberg, Georgios Piliouras, Éva Tardos |
Load balancing without regret in the bulletin board model. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
game theory, price of anarchy, learning theory |
| 1 | Robert Kleinberg, Georgios Piliouras, Éva Tardos |
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
game theory, price of anarchy, learning theory |
| 1 | Anupam Gupta, Aravind Srinivasan, Éva Tardos |
Cost-Sharing Mechanisms for Network Design. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler |
Near-Optimal Network Design with Selfish Agents. |
Theory of Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler |
Strategic network formation with structural holes. |
SIGecom Exchanges |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Éva Tardos |
Special Issue on Foundations of Computer Science. |
SIAM J. Comput. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Thành Nguyen, Éva Tardos |
Parallel Imaging Problem. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel (eds.) |
Equilibrium Computation, 18.11. - 23.11.2007 |
Equilibrium Computation |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler |
Strategic network formation with structural holes. |
ACM Conference on Electronic Commerce |
2008 |
DBLP DOI BibTeX RDF |
structural holes, social networks, algorithmic game theory |
| 1 | Jon M. Kleinberg, Éva Tardos |
Balanced outcomes in social exchange networks. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
network exchange theory, social networks, game theory, bargaining |
| 1 | Aaron Archer, Éva Tardos |
Frugal path mechanisms. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Truthful mechanism design, overpayment, game theory, dominant strategies, Vickrey-Clarke-Groves mechanism |
| 1 | Ara Hayrapetyan, Éva Tardos, Tom Wexler |
A network pricing game for selfish traffic. |
Distributed Computing |
2007 |
DBLP DOI BibTeX RDF |
Network pricing games, Game theory, Price of anarchy |
| 1 | P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel |
07471 Abstracts Collection - Equilibrium Computation. |
Equilibrium Computation |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz |
07271 Summary - Computational Social Systems and the Internet. |
Computational Social Systems and the Internet |
2007 |
DBLP BibTeX RDF |
|
| 1 | Peter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz (eds.) |
Computational Social Systems and the Internet, 1.7. - 6.7.2007 |
Computational Social Systems and the Internet |
2007 |
DBLP BibTeX RDF |
|
| 1 | Thành Nguyen, Éva Tardos |
Approximately maximizing efficiency and revenue in polyhedral environments. |
ACM Conference on Electronic Commerce |
2007 |
DBLP DOI BibTeX RDF |
game theory, efficiency, mechanism design, revenue |
| 1 | Larry Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos |
Trading networks with price-setting agents. |
ACM Conference on Electronic Commerce |
2007 |
DBLP DOI BibTeX RDF |
trading networks, markets, algorithmic game theory |
| 1 | Jon M. Kleinberg, Éva Tardos |
Algorithm design. |
|
2006 |
RDF |
|
| 1 | Zoya Svitkina, Éva Tardos |
Facility location with hierarchical facility costs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ara Hayrapetyan, Éva Tardos, Tom Wexler |
The effect of collusion in congestion games. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
price of collusion, load-balancing, games, game theory, price of anarchy, congestion games, coalitions |
| 1 | Vardges Melkonian, Éva Tardos |
Primal-Dual-Based Algorithms for a Directed Network Design Problem. |
INFORMS Journal on Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos |
Network design for information networks. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson |
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David Kempe, Jon M. Kleinberg, Éva Tardos |
Influential Nodes in a Diffusion Model for Social Networks. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover |
Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ara Hayrapetyan, Éva Tardos, Tom Wexler |
A network pricing game for selfish traffic. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
network pricing games, game theory, price of anarchy |
| 1 | Vardges Melkonian, Éva Tardos |
Algorithms for a network design problem with crossing supermodular demands. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos |
Approximate classification via earthmover metrics. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry C. Lin, Tim Roughgarden, Éva Tardos |
A stronger bound on Braess's Paradox. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Aravind Srinivasan, Éva Tardos |
Cost-Sharing Mechanisms for Network Design. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoya Svitkina, Éva Tardos |
Min-Max Multiway Cut. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Tardos |
Network games. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos |
Scheduling data transfers in a network and the set scheduling problem. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos |
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. |
Internet Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Tardos |
Approximation Algorithms and Network Games. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos |
An approximate truthful mechanism for combinatorial auctions with single parameter agents. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Pál, Éva Tardos |
Group Strategyproof Mechanisms via Primal-Dual Algorithms. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler |
Near-optimal network design with selfish agents. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
network design, price of anarchy |
| 1 | David Kempe, Jon M. Kleinberg, Éva Tardos |
Maximizing the spread of influence through a social network. |
KDD |
2003 |
DBLP DOI BibTeX RDF |
social networks, approximation algorithms, diffusion of innovations, viral marketing |
| 1 | Tim Roughgarden, Éva Tardos |
How bad is selfish routing? |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
Braess's Paradox, network flow, Nash equilibria, selfish routing |
| 1 | Jon M. Kleinberg, Éva Tardos |
Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
metric labeling, classification, Approximation algorithms, Markov random fields |
| 1 | Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys |
A Constant-Factor Approximation Algorithm for the k-Median Problem. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Éva Tardos |
Frugal path mechanisms. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Fairness in Routing and Load Balancing. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Pál, Éva Tardos, Tom Wexler |
Facility Location with Nonuniform Hard Capacities. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Éva Tardos |
Truthful Mechanisms for One-Parameter Agents. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce Hoppe, Éva Tardos |
The Quickest Transshipment Problem. |
Math. Oper. Res. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Allocating Bandwidth for Bursty Connections. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden, Éva Tardos |
How Bad is Selfish Routing? |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
congested network, latency function, large-scale communication networks, network traffic regulation, optimal route assignment, minimum-latency path, edge congestion, Internet, Internet, performance optimization, telecommunication network routing, telecommunication traffic, telecommunication congestion control, selfish routing, traffic routing |
| 1 | Anupam Gupta, Éva Tardos |
A constant factor approximation algorithm for a class of classification problems. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vardges Melkonian, Éva Tardos |
Approximation Algorithms for a Directed Network Design Problem. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Fairness in Routing and Load Balancing. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
load balancing, Network routing, bandwidth allocation, maximum flow, max-min fairness, unsplittable flow |
| 1 | Jon M. Kleinberg, Éva Tardos |
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
clustering, image processing, Markov random fields, graph partitioning, facility location, Classification problems |
| 1 | Éva Tardos |
Approximation Algorithms for Some Clustering and Classification Problems. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos |
Scheduling Data Transfers in a Network and the Set Scheduling Problem. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys |
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Fleischer, Éva Tardos |
Efficient continuous-time dynamic network flow algorithms. |
Oper. Res. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Éva Tardos |
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Tardos, Kevin D. Wayne |
Simple Generalized Maximum Flow Algorithms. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos |
Approximation Algorithms for Steiner and Directed Multicuts. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Éva Tardos, Karen Aardal |
Approximation Algorithms for Facility Location Problems (Extended Abstract). |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Allocating Bandwidth for Bursty Connections. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Tardos (eds.) |
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia. |
SODA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Lisa Fleischer, Éva Tardos |
Separating Maximally Violated Comb Inequalities in Planar Graphs. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Éva Tardos |
Distributed Packet Switching in Arbitrary Networks. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge A. Plotkin, Éva Tardos |
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. |
Combinatorica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce Hoppe, Éva Tardos |
The Quickest Transshipment Problem. |
SODA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Éva Tardos |
Disjoint Paths in Densely Embedded Graphs. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
densely embedded graphs, communication paths, nearly-Eulerian graphs, locally planar interconnection networks, constant-factor approximation algorithm, maximum disjoint paths, on-line setting, routing, computational geometry, heuristics, multiprocessor interconnection networks, trees (mathematics), high-speed networks, operations research, disjoint paths, two-dimensional mesh |
| 1 | Jon M. Kleinberg, Éva Tardos |
Approximations for the disjoint paths problem in high-diameter planar networks. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Gusfield, Éva Tardos |
A Faster Parametric Minimum-Cut Algorithm. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce Hoppe, Éva Tardos |
Polynomial Time Algorithms for Some Evacuation Problems. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | É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. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Serge A. Plotkin, Éva Tardos |
Polynomial dual network simplex algorithms. |
Math. Program. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Éva Tardos |
An approximation algorithm for the generalized assignment problem. |
Math. Program. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Éva Tardos |
Scheduling Unrelated Machines with Costs. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge A. Plotkin, Éva Tardos |
Improved bounds on the max-flow min-cut ratio for multicommodity flows. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos |
Using Separation Algorithms in Fixed Dimension. |
J. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1992 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")