Tim Roughgarden

From MaRDI portal
Person:733732

Available identifiers

zbMath Open roughgarden.timMaRDI QIDQ733732

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61262422024-04-09Paper
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation2024-03-15Paper
https://portal.mardi4nfdi.de/entity/Q58756372023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50397082022-10-03Paper
Ignore the extra zeroes: variance-optimal mining pools2022-06-22Paper
Introduction2022-02-04Paper
Resource Augmentation2022-02-04Paper
Distributional Analysis2022-02-04Paper
Distribution-Free Models of Social Networks2022-02-04Paper
The idemetric property: when most distances are (almost) the same2021-10-29Paper
When Are Welfare Guarantees Robust2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50027302021-07-28Paper
The Complexity of Contracts2021-03-24Paper
The Complexity of Contracts2021-02-02Paper
Robust Auctions for Revenue via Enhanced Competition2021-01-08Paper
https://portal.mardi4nfdi.de/entity/Q51332202020-11-12Paper
Prior-free multi-unit auctions with ordered bidders2020-11-06Paper
https://portal.mardi4nfdi.de/entity/Q49692102020-10-05Paper
Pricing multi-unit markets2020-06-18Paper
Finding Cliques in Social Networks: A New Distribution-Free Model2020-05-28Paper
Stability and Recovery for Independence Systems2020-05-27Paper
Almost Envy-Freeness with General Valuations2020-04-22Paper
Communication Complexity of Discrete Fair Division2019-10-15Paper
https://portal.mardi4nfdi.de/entity/Q57434552019-05-10Paper
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)2019-02-25Paper
Intrinsic Robustness of the Price of Anarchy2018-08-02Paper
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding2018-08-02Paper
Is Shapley cost sharing optimal?2018-07-12Paper
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization2018-05-23Paper
Making the Most of Your Samples2018-05-18Paper
The Complexity of the k-means Method2018-03-02Paper
The Performance of Deferred-Acceptance Auctions2017-12-07Paper
Modularity and greed in double auctions2017-10-24Paper
The price of anarchy in large games2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650412017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650742017-09-29Paper
A PAC Approach to Application-Specific Algorithm Selection2017-06-28Paper
The Price of Anarchy in Auctions2017-06-08Paper
Decompositions of Triangle-Dense Graphs2017-05-19Paper
Generalized Efficiency Bounds in Distributed Resource Allocation2017-05-16Paper
Optimal Cost-Sharing in General Resource Selection Games2017-01-26Paper
Private Matchings and Allocations2016-11-15Paper
Twenty Lectures on Algorithmic Game Theory2016-07-27Paper
Communication Complexity (for Algorithm Designers)2016-07-11Paper
A PAC Approach to Application-Specific Algorithm Selection2016-04-15Paper
Decompositions of Triangle-Dense Graphs2016-03-23Paper
Quantifying inefficiency in cost-sharing mechanisms2015-11-11Paper
How bad is selfish routing?2015-10-30Paper
Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem2015-08-17Paper
https://portal.mardi4nfdi.de/entity/Q55012762015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013602015-08-03Paper
Private matchings and allocations2015-06-26Paper
The sample complexity of revenue maximization2015-06-26Paper
Revenue maximization with a single sample2015-06-08Paper
Stackelberg scheduling strategies2015-02-27Paper
Local smoothness and the price of anarchy in splittable congestion games2015-02-13Paper
Intrinsic robustness of the price of anarchy2015-02-04Paper
Network Cost-Sharing without Anonymity2015-01-14Paper
Optimal Cost-Sharing in Weighted Congestion Games2015-01-07Paper
New trade-offs in cost-sharing mechanisms2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q29216562014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q29217922014-10-13Paper
Interactive privacy via the median mechanism2014-08-13Paper
Privately Solving Linear Programs2014-07-01Paper
From convex optimization to randomized mechanisms2014-06-05Paper
Black-Box Randomized Reductions in Algorithmic Mechanism Design2014-06-04Paper
Prior-free auctions with ordered bidders2014-05-13Paper
Bottleneck links, variable demand, and the tragedy of the commons2013-08-06Paper
Preventing Unraveling in Social Networks: The Anchored k-Core Problem2012-11-01Paper
https://portal.mardi4nfdi.de/entity/Q29138052012-09-27Paper
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing2012-03-15Paper
Truthful Approximation Schemes for Single-Parameter Agents2011-10-18Paper
Restoring Pure Equilibria to Weighted Congestion Games2011-07-07Paper
https://portal.mardi4nfdi.de/entity/Q30028302011-05-24Paper
Fully Distributed Algorithms for Convex Optimization Problems2011-03-21Paper
Braess's Paradox in large random graphs2010-12-14Paper
Designing Network Protocols for Good Equilibria2010-11-04Paper
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness2010-09-06Paper
Simpler and better approximation algorithms for network design2010-08-16Paper
Pricing network edges for heterogeneous selfish users2010-08-16Paper
Bottleneck links, variable demand, and the tragedy of the commons2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35794102010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35794542010-08-06Paper
The price of anarchy is independent of the network topology2010-08-05Paper
Computing equilibria: a computational complexity perspective2010-02-19Paper
Network design with weighted players2009-10-19Paper
Beyond Moulin mechanisms2009-08-27Paper
The Price of Stability for Network Design with Fair Cost Allocation2009-08-20Paper
Worst-Case Efficiency Analysis of Queueing Disciplines2009-07-14Paper
https://portal.mardi4nfdi.de/entity/Q35496872009-01-05Paper
Computing correlated equilibria in multi-player games2008-12-21Paper
Approximation via cost sharing2008-12-21Paper
https://portal.mardi4nfdi.de/entity/Q35247262008-09-12Paper
https://portal.mardi4nfdi.de/entity/Q35247272008-09-12Paper
Fully Distributed Algorithms for Convex Optimization Problems2008-09-02Paper
Bertrand Competition in Networks2008-05-02Paper
Is Shapley Cost Sharing Optimal?2008-05-02Paper
Optimal Efficiency Guarantees for Network Design Mechanisms2007-11-29Paper
The price of anarchy in an exponential multi-server2007-10-30Paper
Single-Source Stochastic Routing2007-08-28Paper
https://portal.mardi4nfdi.de/entity/Q54910252006-09-26Paper
On the severity of Braess's paradox: designing networks for selfish users is hard2006-07-12Paper
How much can taxes help selfish routing?2006-06-30Paper
Automata, Languages and Programming2006-01-10Paper
Stackelberg Scheduling Strategies2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48289322004-11-29Paper
The price of anarchy is independent of the network topology2004-11-18Paper
Bounding the inefficiency of equilibria in nonatomic congestion games2004-10-28Paper
Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation2004-10-05Paper
On a game in directed graphs.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45377352002-06-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tim Roughgarden