Copertina

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Goyal, Vineet, Iyengar, Garud, Udwani, Rajan
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
di: Kang, Suho, et al.
Pubblicazione: (2025)

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
di: Udwani, Rajan
Pubblicazione: (2023)

Almost Tight Bounds for Online Hypergraph Matching
di: Tröbst, Thorben, et al.
Pubblicazione: (2024)

Adwords with Unknown Budgets and Beyond
di: Udwani, Rajan
Pubblicazione: (2021)

Submodular Order Functions and Assortment Optimization
di: Udwani, Rajan
Pubblicazione: (2021)

Near-Optimal Bayesian Online Assortment of Reusable Resources
di: Feng, Yiding, et al.
Pubblicazione: (2025)

When Location Shapes Choice: Placement Optimization of Substitutable Products
di: Housni, Omar El, et al.
Pubblicazione: (2023)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
di: Sun, Shuo, et al.
Pubblicazione: (2024)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
di: Ganz, Amit, et al.
Pubblicazione: (2023)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
di: Ma, Will, et al.
Pubblicazione: (2019)

Approximating Optimum Online for Capacitated Resource Allocation
di: Braun, Alexander, et al.
Pubblicazione: (2024)

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
di: Tang, Zhihao Gavin
Pubblicazione: (2026)

Distributionally Robust Newsvendor on a Metric
di: Foussoul, Ayoub, et al.
Pubblicazione: (2024)

Beating Competitive Ratio 4 for Graphic Matroid Secretary
di: Banihashem, Kiarash, et al.
Pubblicazione: (2025)

Competitive Online Transportation Simplified
di: Arndt, Stephen, et al.
Pubblicazione: (2025)

MNL-Bandit with Knapsacks: a near-optimal algorithm
di: Aznag, Abdellah, et al.
Pubblicazione: (2021)

Competitive Policies for Online Collateral Maintenance
di: Almashaqbeh, Ghada, et al.
Pubblicazione: (2024)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
di: Balseiro, Santiago R., et al.
Pubblicazione: (2023)

Asymptotically Optimal Representation of Palindromic Structure
di: Itzhaki, Michael
Pubblicazione: (2024)

Online Allocation with Concave, Diminishing-Returns Objectives
di: Patton, Kalen
Pubblicazione: (2025)

Online Resource Allocation with Cancellations
di: Ekbatani, Farbod, et al.
Pubblicazione: (2022)

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

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
di: Ma, Will
Pubblicazione: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
di: Kalavas, Andreas, et al.
Pubblicazione: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
di: Kalavas, Andreas, et al.
Pubblicazione: (2025)

Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
di: Bienkowski, Marcin, et al.
Pubblicazione: (2026)

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
di: Singh, Rajpreet, et al.
Pubblicazione: (2025)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
di: Basiak, Mateusz, et al.
Pubblicazione: (2025)

Efficient Resource Allocation under Adversary Attacks: A Decomposition-Based Approach
di: Davoodi, Mansoor, et al.
Pubblicazione: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
di: Hu, Yang
Pubblicazione: (2025)

Optimal Learning-Augmented Algorithm for Online Bidding
di: Lee, Changyeol, et al.
Pubblicazione: (2026)

Online Matching under KIID: Enhanced Competitive Analysis through Ordinary Differential Equation Systems
di: Xu, Pan
Pubblicazione: (2025)

The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof
di: Addanki, Vamsi, et al.
Pubblicazione: (2025)

Optimal Testing of Reed-Muller Codes with an Online Adversary
di: Kelman, Esty, et al.
Pubblicazione: (2026)

Competitive Analysis of Online Facility Assignment Algorithms on Discrete Grid Graphs: Performance Bounds and Remediation Strategies
di: Alif, Lamya, et al.
Pubblicazione: (2026)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
di: Das, Rathish, et al.
Pubblicazione: (2025)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
di: Chen, Liyan, et al.
Pubblicazione: (2024)

Online Allocation with Unknown Shared Supply
di: Neoh, Tzeh Yuan, et al.
Pubblicazione: (2026)

Bounding the Optimal Performance of Online Randomized Primal-Dual Methods
di: Xu, Pan
Pubblicazione: (2025)