3 problems

In a two-way dynamic matching network, let $\mathbf{TP}$ denote the local availability-based policy proposed by Kerimov et al. The policy makes matching decisions using agent avail…

Nonintegral-decision extension conjecture. A similar $\Omega(T)$ regret lower bound should hold even without the integrality assumption on the online algorithm's decisions.

The system has linear holding costs $c\cdot \hat Q(t)$ with cost-rate vector $c=(0.1,0.2,0.3,0.4,0.4,0.3,0.2,0.1)$, and matching rewards are specified by the matching-reward table…