Advances in Optimization and Learning for Complex Systems

The field of optimization and learning is rapidly evolving, with a focus on developing innovative methods to tackle complex systems. Recent research has emphasized the importance of considering uncertainties, dynamic environments, and multi-objective optimization. Notably, the development of Bayesian optimization techniques has shown promise in addressing dynamic pricing and learning problems. Additionally, there has been significant progress in online convex optimization, with a focus on multi-objective min-max regret and near-optimal regret-queue length tradeoffs. These advancements have far-reaching implications for various applications, including logistics, finance, and energy management. Noteworthy papers include: Utilizing Bayesian Optimization for Timetable-Independent Railway Junction Performance Determination, which introduces a methodology for determining timetable-independent capacity within the traffic rate assignment problem. Bayesian Optimization for Dynamic Pricing and Learning, which proposes a Gaussian Process based nonparametric approach to dynamic pricing that avoids restrictive modeling assumptions. Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets, which establishes a tradeoff among regret, average queue length, and maximum queue length for a two-sided market.

Sources

Modeling the Impact of Communication and Human Uncertainties on Runway Capacity in Terminal Airspace

Crane Scheduling Problem with Energy Saving

Utilizing Bayesian Optimization for Timetable-Independent Railway Junction Performance Determination

An $O(n\log n)$ Algorithm for Single-Item Capacitated Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices

A mathematical model for pricing perishable goods for quick-commerce applications

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games

Bayesian Optimization for Dynamic Pricing and Learning

Repeated Sales with Heterogeneous Buyer Sophistication

Order Retrieval in Compact Storage Systems

Multi-Objective $\textit{min-max}$ Online Convex Optimization

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets

Built with on top of