| Publication | Date of Publication | Type |
|---|
| Group strategy proof mechanisms via primal-dual algorithms | 2026-05-29 | Paper |
| The price of stability for network design with fair cost allocation | 2026-05-29 | Paper |
| How bad is selfish routing? | 2026-05-08 | Paper |
| Facility location with nonuniform hard capacities | 2026-05-08 | Paper |
| Truthful mechanisms for one-parameter agents | 2026-05-08 | Paper |
| Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields | 2026-05-06 | Paper |
| Fairness in routing and load balancing | 2026-05-06 | Paper |
| Randomness and fairness in two-sided matching with limited interviews | 2026-04-15 | Paper |
| Algorithm design | 2025-11-04 | Paper |
Liquid welfare guarantees for no-regret learning in sequential budgeted auctions
Mathematics of Operations Research | 2025-06-02 | Paper |
| Pure and Bayes-Nash price of anarchy for generalized second price auction | 2025-04-29 | Paper |
| Feedback graph regret bounds for Thompson sampling and UCB | 2025-02-19 | Paper |
The price of anarchy of strategic queuing systems
Journal of the ACM | 2025-02-05 | Paper |
| Calibrated recommendations for users with decaying attention | 2025-01-31 | Paper |
| Incentives in dominant resource fair allocation under dynamic demands | 2025-01-31 | Paper |
Dynamic pricing provides robust equilibria in stochastic ridesharing networks
Mathematics of Operations Research | 2024-11-07 | Paper |
Small-Loss Bounds for Online Learning with Partial Information
Mathematics of Operations Research | 2022-09-26 | Paper |
Algorithms as mechanisms: the price of anarchy of relax and round
Mathematics of Operations Research | 2021-06-03 | Paper |
Algorithms as mechanisms: the price of anarchy of relax and round
Mathematics of Operations Research | 2021-06-03 | Paper |
| Virtues of Patience in Strategic Queuing Systems | 2020-11-19 | Paper |
Simple and efficient budget feasible mechanisms for monotone submodular valuations
(available as arXiv preprint) | 2020-06-18 | Paper |
Information asymmetries in common-value auctions with discrete signals
Mathematics of Operations Research | 2020-04-30 | Paper |
| Stability and Learning in Strategic Queuing Systems | 2020-03-15 | Paper |
Sequential auctions and externalities
(available as arXiv preprint) | 2019-05-10 | Paper |
| Sequential auctions and externalities | 2019-05-10 | Paper |
Separating maximally violated comb inequalities in planar graphs
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Learning and Efficiency in Games with Dynamic Population
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The Price of Anarchy in Auctions
Journal of Artificial Intelligence Research | 2017-06-08 | Paper |
The curse of simultaneity
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Scheduling data transfers in a network and the set scheduling problem
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
Journal of the ACM | 2015-12-07 | Paper |
How bad is selfish routing?
Journal of the ACM | 2015-10-30 | Paper |
Frugal path mechanisms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
scientific article; zbMATH DE number 6474901 (Why is no real title available?)
Theory of Computing | 2015-08-21 | Paper |
| scientific article; zbMATH DE number 6469163 (Why is no real title available?) | 2015-08-03 | Paper |
| Approximate classification via earthmover metrics | 2015-08-03 | Paper |
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
A network pricing game for selfish traffic
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Bounding the inefficiency of outcomes in generalized second price auctions
Journal of Economic Theory | 2015-02-13 | Paper |
Bounding the inefficiency of outcomes in generalized second price auctions
Journal of Economic Theory | 2015-02-13 | Paper |
Introduction to computer science and economic theory
Journal of Economic Theory | 2015-02-13 | Paper |
Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract)
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Strong price of anarchy, utility games and coalitional dynamics
Algorithmic Game Theory | 2015-01-14 | Paper |
Equilibrium in combinatorial public projects
Web and Internet Economics | 2015-01-12 | Paper |
Can credit increase revenue?
Web and Internet Economics | 2015-01-12 | Paper |
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Facility location with hierarchical facility costs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Network design for information networks | 2014-10-13 | Paper |
| Approximating the smallest k-edge connected spanning subgraph by LP-rounding | 2014-10-13 | Paper |
A constant factor approximation algorithm for a class of classification problems
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Composable and efficient mechanisms
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Which Networks are Least Susceptible to Cascading Failures?
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
A network pricing game for selfish traffic
Distributed Computing | 2013-06-20 | Paper |
Primal-dual-based algorithms for a directed network design problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
Stronger bounds on Braess's paradox and the maximum latency of selfish routing
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Load balancing without regret in the bulletin board model
Distributed Computing | 2012-02-06 | Paper |
Near-optimal network design with selfish agents
Theory of Computing | 2011-05-24 | Paper |
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
Networks | 2010-11-24 | Paper |
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Facility location with hierarchical facility costs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Network games
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Trading networks with price-setting agents
Games and Economic Behavior | 2009-08-27 | Paper |
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing | 2009-08-20 | Paper |
| scientific article; zbMATH DE number 5485541 (Why is no real title available?) | 2009-01-05 | Paper |
Parallel Imaging Problem
Algorithms - ESA 2008 | 2008-11-25 | Paper |
| Introduction to the inefficiency of equilibria | 2008-09-12 | Paper |
| Network formation games and the potential function method | 2008-09-12 | Paper |
Cost-sharing mechanisms for network design
Algorithmica | 2008-02-18 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
Internet Mathematics | 2005-04-11 | Paper |
| scientific article; zbMATH DE number 2119764 (Why is no real title available?) | 2004-11-29 | Paper |
Bounding the inefficiency of equilibria in nonatomic congestion games
Games and Economic Behavior | 2004-10-28 | Paper |
Algorithms for a network design problem with crossing supermodular demands
Networks | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079341 (Why is no real title available?) | 2004-07-28 | Paper |
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms | 2004-03-14 | Paper |
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences | 2003-05-04 | Paper |
Fairness in routing and load balancing
Journal of Computer and System Sciences | 2002-02-27 | Paper |
| scientific article; zbMATH DE number 1263178 (Why is no real title available?) | 2002-02-03 | Paper |
The quickest transshipment problem
Mathematics of Operations Research | 2001-11-26 | Paper |
Separating maximally violated comb inequalities in planar graphs
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1629976 (Why is no real title available?) | 2001-10-23 | Paper |
| scientific article; zbMATH DE number 1559582 (Why is no real title available?) | 2001-03-01 | Paper |
| scientific article; zbMATH DE number 1559542 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1342141 (Why is no real title available?) | 2000-11-27 | Paper |
Allocating Bandwidth for Bursty Connections
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1256754 (Why is no real title available?) | 2000-05-18 | Paper |
| scientific article; zbMATH DE number 1261807 (Why is no real title available?) | 2000-04-26 | Paper |
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters | 1999-12-19 | Paper |
Approximations for the disjoint paths problem in high-diameter planar networks
Journal of Computer and System Sciences | 1999-01-06 | Paper |
| scientific article; zbMATH DE number 1187161 (Why is no real title available?) | 1998-08-10 | Paper |
Approximation Algorithms for Steiner and Directed Multicuts
Journal of Algorithms | 1997-07-06 | Paper |
| scientific article; zbMATH DE number 1003253 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 1003275 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 910909 (Why is no real title available?) | 1996-10-13 | Paper |
| scientific article; zbMATH DE number 863498 (Why is no real title available?) | 1996-08-18 | Paper |
| scientific article; zbMATH DE number 863509 (Why is no real title available?) | 1996-04-08 | Paper |
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Combinatorica | 1996-03-11 | Paper |
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Mathematics of Operations Research | 1995-09-17 | Paper |
Fast approximation algorithms for multicommodity flow problems
Journal of Computer and System Sciences | 1995-07-05 | Paper |
An approximation algorithm for the generalized assignment problem
Mathematical Programming. Series A. Series B | 1995-01-19 | Paper |
| scientific article; zbMATH DE number 432783 (Why is no real title available?) | 1994-09-20 | Paper |
| scientific article; zbMATH DE number 432784 (Why is no real title available?) | 1994-09-19 | Paper |
A faster parametric minimum-cut algorithm
Algorithmica | 1994-09-11 | Paper |
Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
SIAM Journal on Computing | 1994-08-14 | Paper |
| scientific article; zbMATH DE number 437570 (Why is no real title available?) | 1993-12-15 | Paper |
Polynomial dual network simplex algorithms
Mathematical Programming. Series A. Series B | 1993-12-06 | Paper |
Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs
Information Processing Letters | 1993-10-17 | Paper |
Algorithms for routing around a rectangle
Discrete Applied Mathematics | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 66616 (Why is no real title available?) | 1992-09-27 | Paper |
Using separation algorithms in fixed dimension
Journal of Algorithms | 1992-06-28 | Paper |
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
SIAM Journal on Computing | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 15085 (Why is no real title available?) | 1992-06-25 | Paper |
The gap between monotone and non-monotone circuit complexity is exponential
Combinatorica | 1992-06-25 | Paper |
Combinatorial Algorithms for the Generalized Circulation Problem
Mathematics of Operations Research | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4204092 (Why is no real title available?) | 1990-01-01 | Paper |
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
An intersection theorem for supermatroids
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
An application of submodular flows
Linear Algebra and its Applications | 1989-01-01 | Paper |
Note on Weintraub’s Minimum-Cost Circulation Algorithm
SIAM Journal on Computing | 1989-01-01 | Paper |
On fractional multicommodity flows and distance functions
Discrete Mathematics | 1989-01-01 | Paper |
Generalized polymatroids and submodular flows
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
An <i>O</i> (n <sup>2</sup> (m + <i>N</i> log <i>n</i> )log <i>n</i> ) min-cost flow algorithm
Journal of the ACM | 1988-01-01 | Paper |
An application of simultaneous diophantine approximation in combinatorial optimization
Combinatorica | 1987-01-01 | Paper |
Sensitivity theorems in integer linear programming
Mathematical Programming | 1986-01-01 | Paper |
Layered Augmenting Path Algorithms
Mathematics of Operations Research | 1986-01-01 | Paper |
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
Operations Research | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3970769 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3904333 (Why is no real title available?) | 1985-01-01 | Paper |
A strongly polynomial minimum cost circulation algorithm
Combinatorica | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3900474 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3910407 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3904606 (Why is no real title available?) | 1984-01-01 | Paper |
Covering directed and odd cuts
Mathematical Programming Studies | 1984-01-01 | Paper |
