2024 Proceeding- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
The papers in this volume were presented at the 56th Annual ACM Symposium on Theory of Computing (STOC 2024), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Vancouver, Canada, June 24--28, 2024, with the papers being presented as live talks.
Approximating Maximum Matching Requires Almost Quadratic Time
We study algorithms for estimating the size of maximum matching. This problem has been subject to extensive research. For n-vertex graphs, Bhattacharya, Kiss, and Saranurak [FOCS’23] (BKS) showed that an estimate that is within є n of the optimal ...
Structural Complexities of Matching Mechanisms
We study various novel complexity measures for two-sided matching mechanisms, applied to the two canonical strategyproof matching mechanisms, Deferred Acceptance (DA) and Top Trading Cycles (TTC). Our metrics are designed to capture the complexity of ...
A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations
We present a constant-factor approximation algorithm for the Nash Social Welfare (NSW) maximization problem with subadditive valuations accessible via demand queries. More generally, we propose a framework for NSW optimization which assumes two ...
Limitations of Stochastic Selection Problems with Pairwise Independent Priors
Motivated by the growing interest in correlation-robust stochastic optimization, we investigate stochastic selection problems beyond independence. Specifically, we consider the instructive case of pairwise-independent priors and matroid constraints. We ...
Prophet Inequalities Require Only a Constant Number of Samples
In a prophet inequality problem, n independent random variables are presented to a gambler one by one. The gambler decides when to stop the sequence and obtains the most recent value as reward. We evaluate a stopping rule by the worst-case ratio between ...
Index Terms
- Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| STOC '15 | 347 | 93 | 27% |
| STOC '14 | 319 | 91 | 29% |
| STOC '13 | 360 | 100 | 28% |
| STOC '11 | 304 | 84 | 28% |
| STOC '08 | 325 | 80 | 25% |
| STOC '03 | 270 | 80 | 30% |
| STOC '02 | 287 | 91 | 32% |
| STOC '01 | 230 | 83 | 36% |
| STOC '00 | 182 | 85 | 47% |
| STOC '98 | 169 | 75 | 44% |
| STOC '97 | 211 | 75 | 36% |
| STOC '96 | 201 | 74 | 37% |
| STOC '89 | 196 | 56 | 29% |
| STOC '88 | 192 | 53 | 28% |
| STOC '87 | 165 | 50 | 30% |
| STOC '80 | 125 | 47 | 38% |
| STOC '79 | 111 | 37 | 33% |
| STOC '78 | 120 | 38 | 32% |
| STOC '77 | 87 | 31 | 36% |
| STOC '76 | 83 | 30 | 36% |
| STOC '75 | 87 | 31 | 36% |
| STOC '74 | 95 | 35 | 37% |
| STOC '71 | 50 | 23 | 46% |
| STOC '70 | 70 | 27 | 39% |
| Overall | 4,586 | 1,469 | 32% |