activity
20162026
most citedBounds on expected propagation time of probabilistic zero forcing

6 citations · 9 across the 13 of their papers we have counts for

collaborators

15 papers

cs.GT2026

Auctions with Price Predictions

Muthu Sundar, Alec Sun, Siddharth Prasad +1

We design auctions for the sale of a single item with unlimited supply given a single prediction of the revenue-maximizing uniform price. This departs from prior work on auctions w…

cs.LG2026

Algorithmic Principles For Multiclass Learning Are Hard To Come By: Limits of Regularization and Proper Learning

Julian Asilis, Shaddin Dughmi, Vatsal Sharan +3

Two of the most fundamental questions in statistical learning theory are the following: which prediction problems are learnable, and how should they be learned? For the former, ele…

cs.AI2026

When do prophets profit in prediction markets?

Anri Gu, Nicole Kagan, Alec Sun +2

Prediction markets aggregate dispersed beliefs into prices that act as probabilistic forecasts of uncertain events. Classical theory establishes how a better-than-market forecast c…

cs.GT2026

Deterministic Metric Distortion of Top-2 Voting

Alec Sun, Daniel Zhu

We give tight bounds on the metric distortion of top-2 deterministic voting mechanisms. We first exploit the restrictive structure of top-2 voting to reduce the space of worst-case…

cs.GT2025

The price of uncertainty for social consensus

Yunzhe Bai, Alec Sun

How hard is it to achieve consensus in a social network under uncertainty? In this paper we model this problem as a social graph of agents where each vertex is initially colored re…

cs.LG2025

Conservative classifiers do consistently well with improving agents: characterizing statistical and online learning

Dravyansh Sharma, Alec Sun

Machine learning is now ubiquitous in societal decision-making, for example in evaluating job candidates or loan applications, and it is increasingly important to take into account…

cs.GT2025

How to sell a service with uncertain outcomes

Krishnamurthy Iyer, Alec Sun, Haifeng Xu +1

Motivated by the recent popularity of machine learning training services, we introduce a contract design problem in which a provider sells a service that results in an outcome of u…

math.NT2023★ 1 cited

Amending the Lonely Runner Spectrum Conjecture

Ho Tin Fan, Alec Sun

Let be the absolute distance from to the nearest integer. For a set of distinct positive integral speeds , we define its maximum loneliness, also know…

cs.DS2022

The trace reconstruction problem for spider graphs

Alec Sun, William Yue

We study the trace reconstruction problem for spider graphs. Let be the number of nodes of a spider and be the length of each leg, and suppose that we are given independent…

cs.DS2022

The White-Box Adversarial Data Stream Model

Miklos Ajtai, Vladimir Braverman, T. S. Jayram +4

We study streaming algorithms in the white-box adversarial model, where the stream is chosen adaptively by an adversary who observes the entire internal state of the algorithm at e…

math.CO2020★ 1 cited

Probabilistic Zero Forcing on Grid, Regular, and Hypercube Graphs

David Hu, Alec Sun

Probabilistic zero-forcing is a coloring process on a graph. In this process, an initial set of vertices is colored blue, and the remaining vertices are colored white. At each time…

math.NT2020★ 1 cited

A Bombieri-Vinogradov Theorem for primes in short intervals and small sectors

Tanmay Khale, Cooper O'Kuhn, Apoorva Panidapu +2

Let be a finite Galois extension of . We count primes in short intervals represented by the norm of a prime ideal of satisfying a small sector condition determi…

math.CO2019★ 6 cited

Bounds on expected propagation time of probabilistic zero forcing

Shyam Narayanan, Alec Sun

Probabilistic zero forcing is a coloring game played on a graph where the goal is to color every vertex blue starting with an initial blue vertex set. As long as the graph is conne…

math.CO2019

Zero-sum subsequences in bounded-sum -sequences

Alec Sun

We study the problem of finding zero-sum blocks in bounded-sum sequences, which was introduced by Caro, Hansberg, and Montejano. Caro et al. determine the minimum -sequen…

math.RT2016

Towards a classification of finite-dimensional representations of rational Cherednik algebras of type D

Seth Shelley-Abrahamson, Alec Sun

Using a combinatorial description due to Jacon and Lecouvey of the wall crossing bijections for cyclotomic rational Cherednik algebras, we show that the irreducible representations…