The following pages link to Tim Roughgarden (Q733732):
Displaying 50 items.
- Network design with weighted players (Q733733) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Is Shapley cost sharing optimal? (Q1651261) (← links)
- On a game in directed graphs. (Q1853026) (← links)
- Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation (Q1881568) (← links)
- Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
- Ignore the extra zeroes: variance-optimal mining pools (Q2147244) (← links)
- Pricing multi-unit markets (Q2190388) (← links)
- Prior-free multi-unit auctions with ordered bidders (Q2210509) (← links)
- Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← links)
- Revenue maximization with a single sample (Q2347785) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- The price of anarchy in an exponential multi-server (Q2457255) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Decompositions of Triangle-Dense Graphs (Q2796209) (← links)
- A PAC Approach to Application-Specific Algorithm Selection (Q2800559) (← links)
- Private Matchings and Allocations (Q2832895) (← links)
- Interactive privacy via the median mechanism (Q2875203) (← links)
- (Q2913805) (← links)
- (Q2921656) (← links)
- (Q2921792) (← links)
- New trade-offs in cost-sharing mechanisms (Q2931372) (← links)
- Optimal Cost-Sharing in Weighted Congestion Games (Q2936977) (← links)
- Network Cost-Sharing without Anonymity (Q2938653) (← links)
- Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
- Generalized Efficiency Bounds in Distributed Resource Allocation (Q2983223) (← links)
- (Q3002830) (← links)
- Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
- Designing Network Protocols for Good Equilibria (Q3053150) (← links)
- Braess's Paradox in large random graphs (Q3061184) (← links)
- Truthful Approximation Schemes for Single-Parameter Agents (Q3093628) (← links)
- Preventing Unraveling in Social Networks: The Anchored k-Core Problem (Q3167033) (← links)
- Intrinsic Robustness of the Price of Anarchy (Q3177741) (← links)
- Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding (Q3177806) (← links)
- Communication Complexity (for Algorithm Designers) (Q3178295) (← links)
- How bad is selfish routing? (Q3196642) (← links)
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing (Q3225146) (← links)
- Robust Auctions for Revenue via Enhanced Competition (Q3387955) (← links)
- The Price of Stability for Network Design with Fair Cost Allocation (Q3395046) (← links)
- Quantifying inefficiency in cost-sharing mechanisms (Q3452219) (← links)
- (Q3524726) (← links)
- (Q3524727) (← links)
- Approximation via cost sharing (Q3546337) (← links)
- (Q3549687) (← links)
- (Q3579410) (← links)
- (Q3579454) (← links)
- Simpler and better approximation algorithms for network design (Q3581250) (← links)
- Pricing network edges for heterogeneous selfish users (Q3581254) (← links)
