Skip to content

Author

Aranyak Mehta

We have 6 of 25 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Markets

We study Bulow-Klemperer-style competition complexity in two-sided double auctions with $m$ unit-demand buyers drawn i.i.d. from $F_B$ and $n$ unit-supply sellers drawn i.i.d. from $F_S$. When $m \ge n$ and buyer valuations first-order stochastically dominate seller costs ($F_B \succeq_{\mathrm{FSD}} F_S$), we prove th...

Yang Cai, Vineet Gupta, Yan-Chen Jiang et al. · 1 citation
Preprint Sep 2026

Two-sided Market Design Meets Autobidding

Autobidding has become a dominant paradigm in online advertising by enabling advertisers to set high-level goals while algorithms handle real-time bid optimization. A prominent example is the Return-on-Spend (RoS) value maximizer, which maximizes total value subject to an aggregate value-per-spend constraint. While mos...

Yang Cai, Christopher Liaw, Aranyak Mehta et al. · 0 citations
Preprint Sep 2026

Efficiency of Generalized Proportional First-Price Auctions Under Auto-bidding

Auto-bidding is now widely adopted in online advertising platforms, allowing advertisers to specify high-level campaign objectives--such as maximizing total value subject to a return-on-spend (ROS) constraint--rather than manual per-query bids. A central question in algorithmic mechanism design is characterizing the wo...

Yang Cai, Vineet Gupta, Yan-Chen Jiang et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Cogentic: Multi-Agent Orchestration for Automated Proof Discovery

We present Cogentic, a multi-agent harness for automated proof discovery on open research problems. While frontier language models can generate strong mathematical ideas in a single shot, single-shot generation is often insufficient for open problems that require exploring multiple competing conjectures, overcoming sub...

Yang Cai, Vineet Gupta, Yan-Chen Jiang et al. · 0 citations
#machine learning Preprint Sep 2026

Efficient Online Inverse Optimization with $O(d)$ Regret

This work builds on the variable-metric framework of Sakaue et al., adding a self-normalized rank-one update, and replaces the $\log\det$ potential by the trace power $\tr(H^{-1/2})$, which is bounded outright and removes the $\ln T$.

Yang Cai, Anupam Gupta, Vineet Gupta et al. · 3 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.