activity
20062023
most citedLearning Simple Auctions

69 citations · 423 across the 56 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

cs.GT2021★ 1 cited

Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals

Eric Neyman, Tim Roughgarden

The problem of aggregating expert forecasts is ubiquitous in fields as wide-ranging as machine learning, economics, climate science, and national security. Despite this, our theore…

cs.GT2021

Strictly Proper Contract Functions Can Be Arbitrage-Free

Eric Neyman, Tim Roughgarden

We consider mechanisms for truthfully eliciting probabilistic predictions from a group of experts. The standard approach -- using a proper scoring rule to separately reward each ex…

cs.CR2021

How Does Blockchain Security Dictate Blockchain Implementation?

Andrew Lewis-Pye, Tim Roughgarden

Blockchain protocols come with a variety of security guarantees. For example, BFT-inspired protocols such as Algorand tend to be secure in the partially synchronous setting, while…

cs.CR2021

Transaction Fee Mechanism Design

Tim Roughgarden

Demand for blockchains such as Bitcoin and Ethereum is far larger than supply, necessitating a mechanism that selects a subset of transactions to include "on-chain" from the pool o…

cs.LG2021★ 1 cited

Smoothed Analysis with Adaptive Adversaries

Nika Haghtalab, Tim Roughgarden, Abhishek Shetty

We prove novel algorithmic guarantees for several online problems in the smoothed analysis model. In this model, at each time an adversary chooses an input distribution with densit…

cs.GT2021★ 11 cited

From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation

Eric Neyman, Tim Roughgarden

This paper forges a strong connection between two seemingly unrelated forecasting problems: incentive-compatible forecast elicitation and forecast aggregation. Proper scoring rules…