Image de couverture de livre

Optimal Learning-Augmented Algorithm for Online Bidding

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lee, Changyeol, Lee, Dahoon, Lee, Jongseo, Shin, Yongho, Yun, Changki
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
par: Lee, Changyeol, et autres
Publié: (2025)

Chromatic correlation clustering via cluster LP
par: Abbasi, Fateme, et autres
Publié: (2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

Parsimonious Learning-Augmented Online Metric Matching
par: Shin, Yongho, et autres
Publié: (2026)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
par: Lee, Dahoon, et autres
Publié: (2025)

Online Rounding for Set Cover under Subset Arrivals
par: Byrka, Jarosław, et autres
Publié: (2025)

Learning-Augmented Online Bipartite Fractional Matching
par: Choo, Davin, et autres
Publié: (2025)

Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
par: Jiang, Yonggang, et autres
Publié: (2025)

The Pareto Frontier of Randomized Learning-Augmented Online Bidding
par: Degryse, Mathis, et autres
Publié: (2026)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
par: Dinitz, Michael, et autres
Publié: (2025)

Servicing Matched Client Pairs with Facilities
par: Abbasi, Fateme, et autres
Publié: (2026)

Facility Location on High-dimensional Euclidean Spaces
par: Lee, Euiwoong, et autres
Publié: (2025)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Learning-Augmented Online Covering Problems
par: Ameli, Afrouz Jabal, et autres
Publié: (2025)

Learning-Augmented Algorithms for $k$-median via Online Learning
par: Hebbar, Anish, et autres
Publié: (2026)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
par: Angelopoulos, Spyros, et autres
Publié: (2024)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
par: Bansal, Nikhil, et autres
Publié: (2026)

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
par: Udwani, Rajan
Publié: (2024)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
par: Lechowicz, Adam, et autres
Publié: (2023)

Optimal Stopping with a Predicted Prior
par: Bai, Tian, et autres
Publié: (2025)

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
par: Lee, Seoyong, et autres
Publié: (2026)

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
par: Dong, Yinhao, et autres
Publié: (2024)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
par: Lee, Russell, et autres
Publié: (2022)

Optimal Algorithms for Augmented Testing of Discrete Distributions
par: Aliakbarpour, Maryam, et autres
Publié: (2024)

Computing Experiment-Constrained D-Optimal Designs
par: Pillai, Aditya, et autres
Publié: (2024)

Learning-Augmented Online TRP on a Line
par: Guragain, Swapnil, et autres
Publié: (2026)

Streaming Algorithms for Connectivity Augmentation
par: Jin, Ce, et autres
Publié: (2024)

Risk-Sensitive Online Algorithms
par: Christianson, Nicolas, et autres
Publié: (2024)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
par: Bampis, Evripidis, et autres
Publié: (2025)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
par: Vaze, Rahul, et autres
Publié: (2025)

Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
par: Aliakbarpour, Maryam, et autres
Publié: (2026)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Engineering Weighted Connectivity Augmentation Algorithms
par: Faraj, Marcelo Fonseca, et autres
Publié: (2024)

Online Algorithms with Randomly Infused Advice
par: Emek, Yuval, et autres
Publié: (2023)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

Nearly Optimal Bounds for Stochastic Online Sorting
par: Hu, Yang
Publié: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
par: Brand, Jan van den, et autres
Publié: (2026)

Learning Augmented Graph $k$-Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

An Empirical Study of Online Packet Scheduling Algorithms
par: Sakr, Nourhan, et autres
Publié: (2016)