Tim Roughgarden
where else to find them
what they talk about
all 4 in the filters
where they keep going back
no series more than once — all 8 in the filters
on a stage with
- Balaram Beheraonce
- C. Seshadhrionce
- Edin Husićonce
all 4 in the filters
who talks about the same things
- Pasin Manurangsi8 talks
- Mark Braverman5 talks
- Prahladh Harsha4 talks
- Makrand Sinha5 talks
- S. Matthew Weinberg3 talks
- Raghu Meka5 talks
| title | conference | date |
|---|---|---|
| Slashing: Panacea or Pandora's Box? | Scale or Die at Accelerate 2025 | 2025-05-19 |
Defines when slashing actually enforces correctness: two papers claim provable slashing for consistency and the first theory of accountable liveness. Key… | ||
| FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs | ITCS 2022 | 2022-01-31 |
Proves fixed-parameter algorithms that enumerate specific near-cliques in c-closed graphs, with concrete bounds: FPT enumeration of maximal (d+1)-plexes in… | ||
| Incentive-Compatibility in Blockchains and Mining Pools | Large-Scale Consensus and Blockchains 2019 | 2019-10-22 |
Two formal results: an axiomatic, budget‑balanced characterization shows the only rule that is Sybil‑proof, collusion‑proof and anonymous is the proportional… | ||
| How Hard Is Inference for Structured Prediction? | Learning, Algorithm Design and Beyond Worst-Case Analysis | 2016-11-14 |
Asks whether recovering binary vertex labels from noisy edge parity is possible and when; proves the simple minimize-disagreements (correlation‑clustering)… | ||
| Outposts Between Worst- and Average Case Analysis: A Case Study in Auction Design | Uncertainty in Computation 2016 | 2016-10-04 |
Worst-case analysis gives no guidance for reserve prices, while Bayesian (average-case) theory (Myerson) yields closed-form optimal auctions and in the iid… | ||
| Distribution-Free Models of Social and Information Networks | Optimization and Decision-Making Under Uncertainty (Simons Institute, September 2016) | 2016-09-19 |
Proposes two distribution-free graph classes motivated by triadic closure and proves concrete positive results. For triangle-dense graphs (global transitivity… | ||
| The Sample Complexity of Revenue Maximization | Complexity and Simplicity in Economics (Simons Institute workshop, 2015) | 2015-10-12 |
Proposes using the statistical learning notion pseudo-dimension to measure mechanism complexity and shows low pseudo-dimension implies polynomial sample… | ||
| Near-Optimal Equilibria I | Economics and Computation Boot Camp 2015 | 2015-08-24 |
Gives a concrete toolbox that proves worst-case equilibrium efficiency via a lambda–mu smoothness inequality, then uses simple algebra and edge- or bidder-wise… | ||
| Near-Optimal Equilibria II | Economics and Computation Boot Camp 2015 | 2015-08-24 |
Proves a smoothness inequality showing a single-item first-price auction achieves lambda=1/2 (improvable to ~0.63), uses a composition theorem so composition… | ||
| nothing matches | ||