6 papers
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…
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…