Copertina

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhai, Jianing, Chau, Sid Chi-Kin, Chen, Minghua
Natura:	Preprint
Pubblicazione:	2019
Soggetti:	Data Structures and Algorithms Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Competitive Online Optimization under Inventory Constraints
di: Lin, Qiulin, et al.
Pubblicazione: (2019)

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

Constant-Factor Algorithms for Revenue Management with Consecutive Stays
di: Hu, Ming, et al.
Pubblicazione: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
di: Gao, Wenzhi, et al.
Pubblicazione: (2021)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
di: Xu, Pan
Pubblicazione: (2025)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
di: Shen, Owen, et al.
Pubblicazione: (2026)

Fair Assortment Planning
di: Chen, Qinyi, et al.
Pubblicazione: (2022)

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

Online Decision Making with Fairness over Time
di: Chen, Rui, et al.
Pubblicazione: (2022)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
di: Chen, Yike, et al.
Pubblicazione: (2024)

Online Matching on $3$-Uniform Hypergraphs
di: Borst, Sander, et al.
Pubblicazione: (2024)

Diversity-Fair Online Selection
di: Hu, Ming, et al.
Pubblicazione: (2025)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
di: Shah, Harsh, et al.
Pubblicazione: (2025)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
di: Bhimaraju, Akhil, et al.
Pubblicazione: (2023)

The Robust Bilevel Selection Problem
di: Henke, Dorothee
Pubblicazione: (2024)

Infrequent Resolving Algorithm for Online Linear Programming
di: Li, Guokai, et al.
Pubblicazione: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
di: Xie, Fangzhou
Pubblicazione: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
di: Encz, Koppány István, et al.
Pubblicazione: (2025)

Online Stochastic Packing with General Correlations
di: Cetin, Sabri, et al.
Pubblicazione: (2025)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
di: Hunkenschröder, Christoph, et al.
Pubblicazione: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
di: Blankenburg, Daniel, et al.
Pubblicazione: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
di: Housni, Omar El, et al.
Pubblicazione: (2024)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
di: Jin, Billy, et al.
Pubblicazione: (2022)

Revenue Maximization in Choice-Based Matching Markets
di: Nissim, Dan, et al.
Pubblicazione: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
di: Shi, Haoyan, et al.
Pubblicazione: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
di: Su, Yuexin, et al.
Pubblicazione: (2026)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
di: Moeini, Mahdi, et al.
Pubblicazione: (2024)

Online Linear Programming with Replenishment
di: Chen, Yuze, et al.
Pubblicazione: (2026)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
di: Chen, Li, et al.
Pubblicazione: (2025)

Entropy Regularization and Faster Decremental Matching in General Graphs
di: Chen, Jiale, et al.
Pubblicazione: (2023)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
di: Besbes, Omar, et al.
Pubblicazione: (2022)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
di: Chen, Shengminjie, et al.
Pubblicazione: (2023)

Learning-Augmented Algorithms for the Bahncard Problem
di: Zhao, Hailiang, et al.
Pubblicazione: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

Active Learning for Non-Parametric Choice Models
di: Susan, Fransisca, et al.
Pubblicazione: (2022)

Private Online Learning via Lazy Algorithms
di: Asi, Hilal, et al.
Pubblicazione: (2024)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
di: Chen, Shengminjie, et al.
Pubblicazione: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2024)