2 citations · 6 across the 5 of their papers we have counts for
5 papers
Competitive Analysis of Online Path Selection: Impacts of Path Length, Topology, and System-Level Costs
Ying Cao, Siyuan Yu, Xiaoqi Tan +1
Consider a communication network to which a sequence of self-interested users come and send requests for data transmission between nodes. This work studies the question of how to g…
Optimal Regularized Online Allocation by Adaptive Re-Solving
Wanteng Ma, Ying Cao, Danny H. K. Tsang +1
This paper introduces a dual-based algorithm framework for solving the regularized online resource allocation problems, which have potentially non-concave cumulative rewards, hard…
Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications
Ying Cao, Bo Sun, Danny H. K. Tsang
We consider an online version of the well-studied network utility maximization problem, where users arrive one by one and an operator makes irrevocable decisions for each user with…
Delay-Aware Scheduling over mmWave/Sub-6 Dual Interfaces: A Reinforcement Learning Approach
Ying Cao, Bo Sun, Danny H. K. Tsang
We consider a transmitter with mmWave/sub6 dual interfaces. Due to the intermittency of mmWave channel, the transmitter must schedule packets wisely across the interfaces to minimi…
Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis
Ying Cao, Bo Sun, Danny H. K. Tsang
We study two canonical online optimization problems under capacity/budget constraints: the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) u…