| Bidder Subset Selection Problem in Auction Design
|
2023 |
Bei, Xiaohui |
| Sampling Equilibria: Fast No-Regret Learning in Structured Games
|
2023 |
Beaglehole, Daniel |
| Spencer’s Theorem in Nearly Input-Sparsity Time
|
2023 |
Jain, Vishesh |
| Streaming Complexity of CSPs with Randomly Ordered Constraints
|
2023 |
Saxena, Raghuvansh R. |
| Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring
|
2023 |
Davies, Peter |
| Almost-Linear Planted Cliques Elude the Metropolis Process
|
2023 |
Chen, Zongchen |
| Simple Mechanisms for Non-linear Agents
|
2023 |
Feng, Yiding |
| Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
|
2023 |
Oki, Taihei |
| Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
|
2023 |
Huang, Shang-En |
| Massively Parallel Computation on Embedded Planar Graphs
|
2023 |
Holm, Jacob |
| A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
|
2023 |
Deligkas, Argyrios |
| Equivalence Test for Read-Once Arithmetic Formulas
|
2023 |
Gupta, Nikhil |
| Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
|
2023 |
Faour, Salwa |
| A Near-Linear Time Sampler for the Ising Model with External Field
|
2023 |
Chen, Xiaoyu |
| The Need for Seed (in the abstract Tile Assembly Model)
|
2023 |
Alseth, Andrew |
| Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth
|
2023 |
Chatterjee, Krishnendu |
| "Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings
|
2023 |
Ezra, Tomer |
| Foundations of Transaction Fee Mechanism Design
|
2023 |
Chung, Hao |
| Near-Linear Sample Complexity for Lp Polynomial Regression
|
2023 |
Meyer, Raphael A. |
| Beating Greedy Matching in Sublinear Time
|
2023 |
Behnezhad, Soheil |
Tag hinzufügen