10 papers
Beyond a Single Optimal Design: A Dynamical Systems Characterization of Online Allocation with Convex Costs
Haoxin Sang, Bo Sun, Xiaoqi Tan
We study online allocation with convex costs (\OACC), a generalization of limited-supply models in which additional resources can be produced dynamically at convex cost. Prior work…
Data-Driven Online Slice Admission Control and Resource Allocation in NextG Mobile Networks
Muhammad Sulaiman, Bo Sun, Mohammad Ali Salahuddin +2
Virtualization in 5G and beyond networks enables the creation of virtual networks (i.e., network slices) tailored to the needs of different applications. To maximize revenue under…
Offline-to-Online Learning in Linear Bandits
Kushagra Chandak, Toshinori Kitamura, Xiaoqi Tan
We study online learning with an additional offline dataset in the stochastic linear bandit setting. Although this problem arises frequently in practice, the offline-to-online trad…
Risk-Sensitive Online Selection with Bounded Adaptivity
Hossein Nekouyan, Bo Sun, Raouf Boutaba +1
Designing randomized online algorithms that perform reliably not only in expectation but also under unfavorable realizations of randomness is a fundamental challenge in online deci…
Computational Hardness of Reinforcement Learning with Partial -Realizability
Shayan Karimi, Xiaoqi Tan
This paper investigates the computational complexity of reinforcement learning in a novel linear function approximation regime, termed partial -realizability. In this framewor…
Online Multi-Class Selection with Group Fairness Guarantee
Faraz Zargari, Hossein Nekouyan, Lyndon Hallett +2
We study the online multi-class selection problem with group fairness guarantees, where limited resources must be allocated to sequentially arriving agents. Our work addresses two…
Online Rounding Schemes for -Rental Problems
Hossein Nekouyan, Bo Sun, Raouf Boutaba +1
We study two online resource allocation problems with reusability in an adversarial setting, namely kRental-Fixed and kRental-Variable. In both problems, a decision-maker manages $…
Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty
Yanzhao Wang, Hasti Nourmohammadi Sigaroudi, Bo Sun +2
This paper investigates the online conversion problem, which involves sequentially trading a divisible resource (e.g., energy) under dynamically changing prices to maximize profit.…
Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
Hossein Nekouyan Jazi, Bo Sun, Raouf Boutaba +1
This paper addresses the online -selection problem with diseconomies of scale (OSDoS), where a seller seeks to maximize social welfare by optimally pricing items for sequentiall…
Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
Faraz Zargari, Hossein Nekouyan Jazi, Bo Sun +1
We introduce and study a multi-class online resource allocation problem with group fairness guarantees. The problem involves allocating a fixed amount of resources to a sequence of…