activity
20202026
most citedOptimal Local Bayesian Differential Privacy over Markov Chains

1 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

cs.GT2026

Price of Censorship: Censorship Resistance and Throughput under Rational Concurrent Proposers

Aditya Saraf, Ioannis Kaklamanis, Sarisht Wadhwa +1

Censorship resistance is the defining advantage of blockchains over their centralized counterparts. Yet block proposers censor transactions for many reasons, from legal consequence…

cs.GT2026

Blockspace Under Pressure: An Analysis of Spam MEV on High-Throughput Blockchains

Wenhao Wang, Aditya Saraf, Lioba Heimbach +2

On high-throughput, low-fee blockchains, a qualitatively new form of maximal extractable value (MEV), spam MEV, has emerged: searchers submit large volumes of speculative transacti…

cs.GT2023

Chunking Tasks for Present-Biased Agents

Joe Halpern, Aditya Saraf

Everyone puts things off sometimes. How can we combat this tendency to procrastinate? A well-known technique used by instructors is to break up a large project into more manageable…

cs.CR2022★ 1 cited

Optimal Local Bayesian Differential Privacy over Markov Chains

Darshan Chakrabarti, Jie Gao, Aditya Saraf +2

In the literature of data privacy, differential privacy is the most popular model. An algorithm is differentially private if its outputs with and without any individual's data are…

cs.GT2020

Competition Alleviates Present Bias in Task Completion

Aditya Saraf, Anna R. Karlin, Jamie Morgenstern

We build upon recent work [Kleinberg and Oren, 2014, Kleinberg et al., 2016, 2017] that considers present biased agents, who place more weight on costs they must incur now than cos…

math.ST2020★ 1 cited

Robust Bayesianism and Likelihoodism

Conor Mayo-Wilson, Aditya Saraf

We defend a new theory of statistical evidence, which we call Robust Bayesianism (RB). We prove that, under widely accepted assumptions, RB entails the law of likelihood [Royall, 1…