4 papers · 1 filter
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…
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…
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…