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
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.· arXiv.org· 1 citation
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.· arXiv.org· 1 citation
Surprisingly, without task-specific fine-tuning or calibration to human bids, the three non-reasoning large models robustly preserve key orderings of auction formats by deviation from theory.
An algorithm is given, requiring no knowledge of the horizon, whose cumulative regret satisfies R_t, whose cumulative regret satisfies 1 + O(\sqrt{\ln \ln n / \ln n})\bigr)\sqrt{t \ln n / 2}$ simultaneously for every $t \ge 1$.
Yang Cai, Vineet Gupta, Yan-Chen Jiang et al.· 2 citations
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
The experiments demonstrate that this new deep learning framework can almost precisely replicate all known solutions from theory, expand to more complex settings, and be used to establish the optimality of new designs for data markets and make conjectures in regard to the structure of optimal designs.
S. Ravindranath, Yan-Chen Jiang, David C. Parkes· Neural Information Processin...· 17 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.