| Player-Optimal Stable Regret for Bandit Learning in Matching Markets
|
2023 |
Kong, Fang |
| Online and Bandit Algorithms Beyond ℓp Norms
|
2023 |
Kesselheim, Thomas |
| Online Min-Max Paging
|
2023 |
Chiplunkar, Ashish |
| Small Shadows of Lattice Polytopes
|
2023 |
Black, Alexander E. |
| Shrunk Subspaces via Operator Sinkhorn Iteration
|
2023 |
Franks, Cole |
| Integrality Gaps for Random Integer Programs via Discrepancy
|
2023 |
Borst, Sander |
| Secretary Problems: The Power of a Single Sample
|
2023 |
Nuti, Pranav |
| A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems
|
2023 |
Chuzhoy, Julia |
| Shortest Cycles with Monotone Submodular Costs
|
2023 |
Fomin, Fedor V. |
| Almost Tight Bounds for Online Facility Location in the Random-Order Model
|
2023 |
Kaplan, Haim |
| Discrepancy Minimization via Regularization
|
2023 |
Pesenti, Lucas |
| Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs
|
2023 |
Chan, Timothy M. |
| Beating (1-1/e)-Approximation for Weighted Stochastic Matching
|
2023 |
Derakhshan, Mahsa |
| The Exact Bipartite Matching Polytope Has Exponential Extension Complexity
|
2023 |
Jia, Xinrui |
| Online Prediction in Sub-linear Space
|
2023 |
Peng, Binghui |
| A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function
|
2023 |
Hirayama, Tsuyoshi |
| A Subquadratic nε-approximation for the Continuous Fréchet Distance
|
2023 |
Horst, Thijs van der |
| Online Sorting and Translational Packing of Convex Polygons
|
2023 |
Aamand, Anders |
| Economical Convex Coverings and Applications
|
2023 |
Arya, Sunil |
| Minimizing Completion Times for Stochastic Jobs via Batched Free Times
|
2023 |
Gupta, Anupam |
Tag hinzufügen