| 2026 | SODA | Robust Equilibria in Shared Resource Allocation via Strengthening Border's Theorem. | David X. Lin, Siddhartha Banerjee, Giannis Fikioris, va Tardos |
| 2025 | IJCAI | Online Resource Sharing: Better Robust Guarantees via Randomized Strategies. | David X. Lin, Daniel Hall, Giannis Fikioris, Siddhartha Banerjee, va Tardos |
| 2025 | SIGMETRICS | Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria. | Chido Onyeze, Siddhartha Banerjee, Giannis Fikioris, va Tardos |
| 2024 | SAGT | Incentives in Dominant Resource Fair Allocation Under Dynamic Demands. | Giannis Fikioris, Rachit Agarwal, va Tardos |
| 2024 | SAGT | Calibrated Recommendations for Users with Decaying Attention. | Jon M. Kleinberg, Emily Ryu, va Tardos |
| 2023 | COLT | Approximately Stationary Bandits with Knapsacks. | Giannis Fikioris, va Tardos |
| 2023 | OSDI | Karma: Resource Allocation for Dynamic Demands. | Midhul Vuppalapati, Giannis Fikioris, Rachit Agarwal, Asaf Cidon, Anurag Khandelwal, va Tardos |
| 2020 | ALT | Feedback graph regret bounds for Thompson Sampling and UCB. | Thodoris Lykouris, va Tardos, Drishti Wali |
| 2018 | COLT | Small-loss bounds for online learning with partial information. | Thodoris Lykouris, Karthik Sridharan, va Tardos |
| 2016 | SODA | Learning and Efficiency in Games with Dynamic Population. | Thodoris Lykouris, Vasilis Syrgkanis, va Tardos |
| 2015 | SAGT | Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets. | Hedyeh Beyhaghi, Nishanth Dikkala, va Tardos |
| 2014 | SAGT | Strong Price of Anarchy, Utility Games and Coalitional Dynamics. | Yoram Bachrach, Vasilis Syrgkanis, va Tardos, Milan Vojnovic |
| 2013 | STOC | Composable and efficient mechanisms. | Vasilis Syrgkanis, va Tardos |
| 2012 | WWW | On revenue in the generalized second price auction. | Brendan Lucier, Renato Paes Leme, va Tardos |
| 2012 | SODA | Sequential auctions and externalities. | Renato Paes Leme, Vasilis Syrgkanis, va Tardos |
| 2011 | FOCS | Which Networks are Least Susceptible to Cascading Failures? | Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, va Tardos |
| 2010 | CVPR | Globally optimal pixel labeling algorithms for tree metrics. | Pedro F. Felzenszwalb, Gyula Pap, va Tardos, Ramin Zabih |
| 2010 | FOCS | Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction. | Renato Paes Leme, va Tardos |
| 2009 | PODC | Load balancing without regret in the bulletin board model. | Robert D. Kleinberg, Georgios Piliouras, va Tardos |
| 2009 | STOC | Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. | Robert Kleinberg, Georgios Piliouras, va Tardos |
| 2008 | ESA | Parallel Imaging Problem. | Thnh Nguyen, va Tardos |
| 2008 | STOC | Balanced outcomes in social exchange networks. | Jon M. Kleinberg, va Tardos |
| 2006 | SODA | Facility location with hierarchical facility costs. | Zoya Svitkina, va Tardos |
| 2006 | STOC | The effect of collusion in congestion games. | Ara Hayrapetyan, va Tardos, Tom Wexler |
| 2005 | ICALP | Influential Nodes in a Diffusion Model for Social Networks. | David Kempe, Jon M. Kleinberg, va Tardos |
| 2005 | ICALP | Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. | Henry C. Lin, Tim Roughgarden, va Tardos, Asher Walkover |
| 2005 | PODC | A network pricing game for selfish traffic. | Ara Hayrapetyan, va Tardos, Tom Wexler |
| 2005 | SODA | Approximating the smallest | Harold N. Gabow, Michel X. Goemans, va Tardos, David P. Williamson |
| 2005 | SODA | Network design for information networks. | Ara Hayrapetyan, Chaitanya Swamy, va Tardos |
| 2004 | FOCS | The Price of Stability for Network Design with Fair Cost Allocation. | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, va Tardos, Tom Wexler, Tim Roughgarden |
| 2004 | SODA | Approximate classification via earthmover metrics. | Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, va Tardos |
| 2004 | SODA | A stronger bound on Braess's Paradox. | Henry C. Lin, Tim Roughgarden, va Tardos |
| 2004 | STOC | Network games. | va Tardos |
| 2003 | ESA | Approximation Algorithms and Network Games. | va Tardos |
| 2003 | FOCS | Group Strategyproof Mechanisms via Primal-Dual Algorithms. | Martin Pl, va Tardos |
| 2003 | KDD | Maximizing the spread of influence through a social network. | David Kempe, Jon M. Kleinberg, va Tardos |
| 2003 | SODA | An approximate truthful mechanism for combinatorial auctions with single parameter agents. | Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, va Tardos |
| 2003 | STOC | Near-optimal network design with selfish agents. | Elliot Anshelevich, Anirban Dasgupta, va Tardos, Tom Wexler |
| 2002 | SODA | Frugal path mechanisms. | Aaron Archer, va Tardos |
| 2001 | FOCS | Truthful Mechanisms for One-Parameter Agents. | Aaron Archer, va Tardos |
| 2001 | FOCS | Facility Location with Nonuniform Hard Capacities. | Martin Pl, va Tardos, Tom Wexler |
| 2000 | FOCS | How Bad is Selfish Routing? | Tim Roughgarden, va Tardos |
| 2000 | STOC | A constant factor approximation algorithm for a class of classification problems. | Anupam Gupta, va Tardos |
| 1999 | FOCS | Fairness in Routing and Load Balancing. | Jon M. Kleinberg, Yuval Rabani, va Tardos |
| 1999 | FOCS | Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. | Jon M. Kleinberg, va Tardos |
| 1999 | IPCO | Approximation Algorithms for a Directed Network Design Problem. | Vardges Melkonian, va Tardos |
| 1999 | ISAAC | Approximation Algorithms for Some Clustering and Classification Problems. | va Tardos |
| 1999 | STOC | A Constant-Factor Approximation Algorithm for the | Moses Charikar, Sudipto Guha, va Tardos, David B. Shmoys |
| 1999 | STOC | Scheduling Data Transfers in a Network and the Set Scheduling Problem. | Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, va Tardos |
| 1998 | IPCO | Simple Generalized Maximum Flow Algorithms. | va Tardos, Kevin D. Wayne |
| 1997 | STOC | Allocating Bandwidth for Bursty Connections. | Jon M. Kleinberg, Yuval Rabani, va Tardos |
| 1997 | STOC | Approximation Algorithms for Facility Location Problems (Extended Abstract). | David B. Shmoys, va Tardos, Karen I. Aardal |
| 1996 | IPCO | Separating Maximally Violated Comb Inequalities in Planar Graphs. | Lisa Fleischer, va Tardos |
| 1996 | STOC | Distributed Packet Switching in Arbitrary Networks. | Yuval Rabani, va Tardos |
| 1995 | FOCS | Disjoint Paths in Densely Embedded Graphs. | Jon M. Kleinberg, va Tardos |
| 1995 | SODA | The Quickest Transshipment Problem. | Bruce Hoppe, va Tardos |
| 1995 | STOC | Approximations for the disjoint paths problem in high-diameter planar networks. | Jon M. Kleinberg, va Tardos |
| 1994 | SODA | Improved Approximation Algorithms for Network Design Problems. | Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, va Tardos, David P. Williamson |
| 1994 | SODA | Polynomial Time Algorithms for Some Evacuation Problems. | Bruce Hoppe, va Tardos |
| 1993 | SODA | Scheduling Unrelated Machines with Costs. | David B. Shmoys, va Tardos |
| 1993 | STOC | Improved bounds on the max-flow min-cut ratio for multicommodity flows. | Serge A. Plotkin, va Tardos |
| 1991 | FOCS | Fast Approximation Algorithms for Fractional Packing and Covering Problems | Serge A. Plotkin, David B. Shmoys, va Tardos |
| 1991 | STOC | Fast Approximation Algorithms for Multicommodity Flow Problems | Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, va Tardos, Spyros Tragoudas |
| 1990 | SODA | Using Separation Algorithms in Fixed Dimension. | Carolyn Haibt Norton, Serge A. Plotkin, va Tardos |
| 1990 | SODA | Improved Dual Network Simplex. | Serge A. Plotkin, va Tardos |
| 1990 | STOC | Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities | Philip N. Klein, Clifford Stein, va Tardos |
| 1989 | FOCS | Interior-Point Methods in Parallel Computation | Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, va Tardos |
| 1988 | FOCS | Combinatorial Algorithms for the Generalized Circulation Problem | Andrew V. Goldberg, Serge A. Plotkin, va Tardos |
| 1987 | FOCS | Approximation Algorithms for Scheduling Unrelated Parallel Machines | Jan Karel Lenstra, David B. Shmoys, va Tardos |
| 1986 | FOCS | An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm | Zvi Galil, va Tardos |
| 1985 | FOCS | An Application of Simultaneous Approximation in Combinatorial Optimization | Andrs Frank, va Tardos |