Copertina

Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Daneshvaramoli, Mohammadreza, Karisani, Helia, Lechowicz, Adam, Sun, Bo, Musco, Cameron, Hajiesmaili, Mohammad
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Computer Science and Game Theory 68Q25, 68T05 F.2.2; I.2.6
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fairness in the k-Server Problem
di: Daneshvaramoli, Mohammadreza, et al.
Pubblicazione: (2025)

The Secretary Problem with Predictions and a Chosen Order
di: Karisani, Helia, et al.
Pubblicazione: (2026)

Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs
di: Csáji, Gergely, et al.
Pubblicazione: (2026)

Fair allocations with subadditive and XOS valuations
di: Feige, Uriel, et al.
Pubblicazione: (2025)

On MMS, APS and XOS
di: Feige, Uriel, et al.
Pubblicazione: (2026)

Prediction-Augmented Mechanism Design for Weighted Facility Location
di: Shi, Yangguang, et al.
Pubblicazione: (2025)

Designing Rules to Pick a Rule: Aggregation by Consistency
di: Berker, Ratip Emin, et al.
Pubblicazione: (2025)

Low communication protocols for fair allocation of indivisible goods
di: Feige, Uriel
Pubblicazione: (2024)

Detecting and taking Project Interactions into account in Participatory Budgeting
di: Durand, Martin, et al.
Pubblicazione: (2024)

Ordering Collective Unit Tasks: from Scheduling to Computational Social Choice
di: Durand, Martin, et al.
Pubblicazione: (2024)

Collective schedules: axioms and algorithms
di: Durand, Martin, et al.
Pubblicazione: (2024)

Reinforcement Learning for Reachability: Guaranteeing Asymptotic Optimality
di: Palasamudram, Amogh, et al.
Pubblicazione: (2026)

From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
di: Berker, Ratip Emin, et al.
Pubblicazione: (2025)

Two-player Domino games
di: de Menibus, Benjamin Hellouin, et al.
Pubblicazione: (2023)

A Characterization of Complexity in Public Goods Games
di: Gilboa, Matan
Pubblicazione: (2023)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
di: Kumar, Mrinal, et al.
Pubblicazione: (2018)

The Computational Complexity of Variational Inequalities and Applications in Game Theory
di: Kapron, Bruce M., et al.
Pubblicazione: (2024)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
di: Böhnlein, Toni, et al.
Pubblicazione: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
di: Opris, Andre, et al.
Pubblicazione: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
di: Opris, Andre, et al.
Pubblicazione: (2024)

Optimal Path Planning in Hostile Environments
di: Kaczmarczyk, Andrzej, et al.
Pubblicazione: (2026)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
di: Feldman, Moran, et al.
Pubblicazione: (2025)

Quantum Advantage in Computational Chemistry?
di: Gundlach, Hans, et al.
Pubblicazione: (2025)

Many Objective Problems Where Crossover is Provably Essential
di: Opris, Andre
Pubblicazione: (2024)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
di: Dorochko, Leonid, et al.
Pubblicazione: (2026)

Approaching I/O-optimality for Approximate Attention
di: Papp, Pál András, et al.
Pubblicazione: (2026)

Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies
di: Meng, Lingfa, et al.
Pubblicazione: (2025)

The Word Problem for Products of Symmetric Groups
di: Simon, Hans U.
Pubblicazione: (2025)

DAG Scheduling in the BSP Model
di: Papp, Pál András, et al.
Pubblicazione: (2023)

The Current and Future Perspectives of Zinc Oxide Nanoparticles in the Treatment of Diabetes Mellitus
di: Yousaf, Iqra
Pubblicazione: (2024)

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
di: Lagerkvist, Victor, et al.
Pubblicazione: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

Robust Bichromatic Classification using Two Lines
di: Glazenburg, Erwin, et al.
Pubblicazione: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
di: Opris, Andre
Pubblicazione: (2025)

Learning to Persuade on the Fly: Robustness Against Ignorance
di: Zu, You, et al.
Pubblicazione: (2021)

Regret Bounds for Robust Online Decision Making
di: Appel, Alexander, et al.
Pubblicazione: (2025)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
di: Jiang, Xinwen, et al.
Pubblicazione: (2021)

The Gallai Vertex Problem is $Θ_2^p$-Complete
di: Nikabadi, Amir, et al.
Pubblicazione: (2026)

A Fair and Optimal Approach to Sequential Healthcare Rationing
di: Sun, Zhaohong
Pubblicazione: (2025)

Fair Division in a Variable Setting
di: Chandramouleeswaran, Harish, et al.
Pubblicazione: (2024)