The arboricity of a graph is the minimum number of forests needed to partition its edges. We present a randomized algorithm that computes the exact arboricity of a simple graph and constructs an optimal forest partition in $\min\{n^{2+o(1)},m^{4/3+o(1)}\}$ time both in expectation and with high probability, where $n$ a...
Iman Gholami, M. Hajiaghayi, Mahdi JafariRaviz et al.· 0 citations
We study the optimal design of a self-financing event, a problem that requires balancing the recruitment of costly, positive-value participants with revenue-generating agents who may impose negative values on the event.
We introduce a novel two-sided mechanism design framework with plus agents equipped with private cos...
M. Hajiaghayi, Sébastien Lahaie, Mohammad Mahdavi et al.· Proceedings of the Thirty-Fi...· 0 citations
This work introduces *Theo*, an agentic autoformalization framework powered by general coding LLMs, and successfully formalizes their main theorems and proofs and validate the generated formalizations with human experts.
Arshia Soltani Moakhar, Iman Gholami, Max Springer et al.· arXiv.org· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
