| Publication | Date of Publication | Type |
|---|
Communication complexity of discrete fair division
SIAM Journal on Computing | 2025-01-14 | Paper |
Byzantine generals in the permissionless setting
| 2024-07-17 | Paper |
Complexity-approximation trade-offs in exchange mechanisms: AMMs vs. LOBs
| 2024-07-17 | Paper |
scientific article; zbMATH DE number 7829249 (Why is no real title available?)
| 2024-04-09 | Paper |
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation
Operations Research | 2024-03-15 | Paper |
scientific article; zbMATH DE number 7650302 (Why is no real title available?)
| 2023-02-03 | Paper |
Algorithms illuminated
| 2022-10-03 | Paper |
Ignore the extra zeroes: variance-optimal mining pools
| 2022-06-22 | Paper |
Introduction
| 2022-02-04 | Paper |
Resource Augmentation
| 2022-02-04 | Paper |
Distribution-Free Models of Social Networks
| 2022-02-04 | Paper |
Distributional Analysis
| 2022-02-04 | Paper |
The idemetric property: when most distances are (almost) the same
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
When are welfare guarantees robust?
| 2021-07-28 | Paper |
Finding cliques in social networks: a new distribution-free model
| 2021-07-28 | Paper |
The complexity of contracts
SIAM Journal on Computing | 2021-03-24 | Paper |
The Complexity of Contracts
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Robust auctions for revenue via enhanced competition
Operations Research | 2021-01-08 | Paper |
Complexity theory, game theory, and economics: the Barbados lectures
| 2020-11-12 | Paper |
Prior-free multi-unit auctions with ordered bidders
Theoretical Computer Science | 2020-11-06 | Paper |
scientific article; zbMATH DE number 7255156 (Why is no real title available?)
| 2020-10-05 | Paper |
Pricing multi-unit markets
| 2020-06-18 | Paper |
Finding cliques in social networks: a new distribution-free model
SIAM Journal on Computing | 2020-05-28 | Paper |
Stability and recovery for independence systems
| 2020-05-27 | Paper |
Almost envy-freeness with general valuations
SIAM Journal on Discrete Mathematics | 2020-04-22 | Paper |
Communication complexity of discrete fair division
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Sketching valuation functions
| 2019-05-10 | Paper |
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
Journal of the ACM | 2019-02-25 | Paper |
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
Journal of the ACM | 2018-08-02 | Paper |
Intrinsic robustness of the price of anarchy
Journal of the ACM | 2018-08-02 | Paper |
Is Shapley cost sharing optimal?
Games and Economic Behavior | 2018-07-12 | Paper |
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
| 2018-05-23 | Paper |
Making the Most of Your Samples
SIAM Journal on Computing | 2018-05-18 | Paper |
The complexity of the \texttt{k-means} method
| 2018-03-02 | Paper |
The performance of deferred-acceptance auctions
Mathematics of Operations Research | 2017-12-07 | Paper |
Modularity and greed in double auctions
Games and Economic Behavior | 2017-10-24 | Paper |
Local smoothness and the price of anarchy in atomic splittable congestion games
| 2017-09-29 | Paper |
Welfare guarantees for combinatorial auctions with item bidding
| 2017-09-29 | Paper |
The price of anarchy in large games
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
A PAC Approach to Application-Specific Algorithm Selection
SIAM Journal on Computing | 2017-06-28 | Paper |
The Price of Anarchy in Auctions
Journal of Artificial Intelligence Research | 2017-06-08 | Paper |
Decompositions of triangle-dense graphs
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Generalized Efficiency Bounds in Distributed Resource Allocation
IEEE Transactions on Automatic Control | 2017-05-16 | Paper |
Optimal cost-sharing in general resource selection games
Operations Research | 2017-01-26 | Paper |
Private matchings and allocations
SIAM Journal on Computing | 2016-11-15 | Paper |
Twenty lectures on algorithmic game theory
| 2016-07-27 | Paper |
Communication complexity (for algorithm designers)
Foundations and Trends® in Theoretical Computer Science | 2016-07-11 | Paper |
A PAC approach to application-specific algorithm selection
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Decompositions of triangle-dense graphs
SIAM Journal on Computing | 2016-03-23 | Paper |
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM | 2015-11-11 | Paper |
How bad is selfish routing?
Journal of the ACM | 2015-10-30 | Paper |
Preventing unraveling in social networks: the anchored \(k\)-core problem
SIAM Journal on Discrete Mathematics | 2015-08-17 | Paper |
scientific article; zbMATH DE number 6469241 (Why is no real title available?)
| 2015-08-03 | Paper |
scientific article; zbMATH DE number 6469163 (Why is no real title available?)
| 2015-08-03 | Paper |
The sample complexity of revenue maximization
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Private matchings and allocations
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Revenue maximization with a single sample
Games and Economic Behavior | 2015-06-08 | Paper |
Stackelberg scheduling strategies
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Local smoothness and the price of anarchy in splittable congestion games
Journal of Economic Theory | 2015-02-13 | Paper |
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Network cost-sharing without anonymity
Algorithmic Game Theory | 2015-01-14 | Paper |
Optimal cost-sharing in weighted congestion games
Web and Internet Economics | 2015-01-07 | Paper |
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Selfish routing with atomic players
| 2014-10-13 | Paper |
Computing equilibria in multi-player games
| 2014-10-13 | Paper |
Interactive privacy via the median mechanism
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Privately solving linear programs
Automata, Languages, and Programming | 2014-07-01 | Paper |
From convex optimization to randomized mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Black-box randomized reductions in algorithmic mechanism design
SIAM Journal on Computing | 2014-06-04 | Paper |
Prior-free auctions with ordered bidders
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Bottleneck links, variable demand, and the tragedy of the commons
Networks | 2013-08-06 | Paper |
Preventing unraveling in social networks: the anchored \(k\)-core problem
Automata, Languages, and Programming | 2012-11-01 | Paper |
Revenue submodularity
Theory of Computing | 2012-09-27 | Paper |
Stronger bounds on Braess's paradox and the maximum latency of selfish routing
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Truthful approximation schemes for single-parameter agents
SIAM Journal on Computing | 2011-10-18 | Paper |
Restoring Pure Equilibria to Weighted Congestion Games
Automata, Languages and Programming | 2011-07-07 | Paper |
Metric clustering via consistent labeling
Theory of Computing | 2011-05-24 | Paper |
Fully distributed algorithms for convex optimization problems
SIAM Journal on Optimization | 2011-03-21 | Paper |
Braess's Paradox in large random graphs
Random Structures & Algorithms | 2010-12-14 | Paper |
Designing network protocols for good equilibria
SIAM Journal on Computing | 2010-11-04 | Paper |
Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Bottleneck links, variable demand, and the tragedy of the commons
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764861 (Why is no real title available?)
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764821 (Why is no real title available?)
| 2010-08-06 | Paper |
The price of anarchy is independent of the network topology
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Computing equilibria: a computational complexity perspective
Economic Theory | 2010-02-19 | Paper |
Network design with weighted players
Theory of Computing Systems | 2009-10-19 | Paper |
Beyond Moulin mechanisms
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 |
Worst-Case Efficiency Analysis of Queueing Disciplines
Automata, Languages and Programming | 2009-07-14 | Paper |
scientific article; zbMATH DE number 5485518 (Why is no real title available?)
| 2009-01-05 | Paper |
Computing correlated equilibria in multi-player games
Journal of the ACM | 2008-12-21 | Paper |
Approximation via cost sharing
Journal of the ACM | 2008-12-21 | Paper |
Routing games
| 2008-09-12 | Paper |
Introduction to the inefficiency of equilibria
| 2008-09-12 | Paper |
Fully Distributed Algorithms for Convex Optimization Problems
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Bertrand Competition in Networks
Algorithmic Game Theory | 2008-05-02 | Paper |
Is Shapley Cost Sharing Optimal?
Algorithmic Game Theory | 2008-05-02 | Paper |
Optimal Efficiency Guarantees for Network Design Mechanisms
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
The price of anarchy in an exponential multi-server
Operations Research Letters | 2007-10-30 | Paper |
Single-Source Stochastic Routing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Potential functions and the inefficiency of equilibria
| 2006-09-26 | Paper |
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences | 2006-07-12 | Paper |
How much can taxes help selfish routing?
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Stackelberg Scheduling Strategies
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2119661 (Why is no real title available?)
| 2004-11-29 | Paper |
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences | 2004-11-18 | Paper |
Bounding the inefficiency of equilibria in nonatomic congestion games
Games and Economic Behavior | 2004-10-28 | Paper |
Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
Mathematical Programming. Series A. Series B | 2004-10-05 | Paper |
On a game in directed graphs.
Information Processing Letters | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1757947 (Why is no real title available?)
| 2002-06-20 | Paper |
