A truthful near-optimal mechanism for online linear packing-covering problem in the random order model

Jinshan Zhang, Xiaoye Miao, Meng Xi, Tianyu Du, Jianwei Yin

Abstract: Our focus is on the online linear packing-covering problem (OLPCP). Within this domain, we present an algorithm that attains near-optimal performance based on generalized Chernoff bounds for general random variables, assuming inputs are received in a uniformly random order and under almost stringent conditions. Through VCG protocols, we are able to unveil the inaugural truthful near-optimal mechanism for OLPCP, all within the confines of nearly tight conditions.