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.
The Power of Two-Sided Recruitment in Two-Sided Markets
We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson and Satterthwaite (1983) shows that even for bilateral trade, there is no individually rational (IR), Bayesian incentive ...
Strategic Budget Selection in a Competitive Autobidding World
We study a game played between advertisers in an online ad platform. The platform sells ad impressions by first-price auction and provides autobidding algorithms that optimize bids on each advertiser's behalf, subject to advertiser constraints such as ...
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
We study the problem of regret minimization for a single bidder in a sequence of first-price auctions where the bidder discovers the item’s value only if the auction is won. Our main contribution is a complete characterization, up to logarithmic factors, ...
Bilateral Trade with Correlated Values
We study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are drawn from ...
No-Regret Learning in Bilateral Trade via Global Budget Balance
Bilateral trade models the problem of intermediating between two rational agents — a seller and a buyer — both characterized by a private valuation for an item they want to trade. We study the online learning version of the problem, in which at each time ...
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% |