Image de couverture de livre

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kevi, Eniko, Thang, Nguyen Kim
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Discrete Mathematics Computer Science and Game Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
par: Bilò, Vittorio, et autres
Publié: (2025)

Distortion of Metric Voting with Bounded Randomness
par: Cai, Ziyi, et autres
Publié: (2026)

The Secretary Problem with Predictions and a Chosen Order
par: Karisani, Helia, et autres
Publié: (2026)

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
par: Ekbatani, Farbod, et autres
Publié: (2026)

Stationary Online Contention Resolution Schemes
par: Aminian, Mohammad Reza, et autres
Publié: (2026)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
par: Csáji, Gergely
Publié: (2023)

Online Combinatorial Allocations and Auctions with Few Samples
par: Dütting, Paul, et autres
Publié: (2024)

Monotone Randomized Apportionment
par: Correa, José, et autres
Publié: (2024)

Some variations of the secretary problem
par: Agrawal, Sarthak, et autres
Publié: (2026)

Unbalanced Random Matching Markets with Partial Preferences
par: Potukuchi, Aditya, et autres
Publié: (2024)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
par: Harks, Tobias, et autres
Publié: (2021)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
par: Csáji, Gergely
Publié: (2024)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
par: Xue, Jinghui, et autres
Publié: (2024)

Six Candidates Suffice to Win a Voter Majority
par: Charikar, Moses, et autres
Publié: (2024)

The Popular Dimension of Matchings
par: Connor, Frank, et autres
Publié: (2025)

Approximately Dominating Sets in Elections
par: Charikar, Moses, et autres
Publié: (2025)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
par: Takazawa, Kenjiro
Publié: (2024)

Formal Primal-Dual Algorithm Analysis
par: Abdulaziz, Mohammad, et autres
Publié: (2026)

Breaking the Metric Voting Distortion Barrier
par: Charikar, Moses, et autres
Publié: (2023)

Combinatorial Bernoulli Factories
par: Niazadeh, Rad, et autres
Publié: (2020)

Worst-case Error Bounds for Online Learning of Smooth Functions
par: Xie, Weian
Publié: (2025)

Prophet Upper Bounds for Online Matching and Auctions
par: Soto, José, et autres
Publié: (2024)

Single-Sample and Robust Online Resource Allocation
par: Ghuge, Rohan, et autres
Publié: (2025)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
par: Proença, Nathan Benedetto, et autres
Publié: (2023)

Efficiency of Proportional Mechanisms in Online Auto-Bidding Advertising
par: Thang, Nguyen Kim
Publié: (2026)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
par: Harada, Tsubasa, et autres
Publié: (2024)

Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis
par: Peng, Bo, et autres
Publié: (2025)

Partial Optimality in the Preordering Problem
par: Stein, David, et autres
Publié: (2026)

Strategizing against No-Regret Learners in First-Price Auctions
par: Rubinstein, Aviad, et autres
Publié: (2024)

Procurement Auctions via Approximately Optimal Submodular Optimization
par: Deng, Yuan, et autres
Publié: (2024)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
par: Davies, Sami, et autres
Publié: (2025)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2023)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
par: Chen, Yixin, et autres
Publié: (2024)

An Approximation Algorithm for Monotone Submodular Cost Allocation
par: Mizutani, Ryuhei
Publié: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
par: Veldt, Nate, et autres
Publié: (2025)

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
par: He, Xi
Publié: (2025)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
par: Golrezaei, Negin, et autres
Publié: (2024)

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

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
par: Podimata, Chara, et autres
Publié: (2020)