K-SVFair-FBF uses the new K-Shapley value to achieve meritocratic fairness with O(T^{3/4}) regret in budgeted combinatorial bandits under full-bandit feedback.
Combinato- rial sleeping bandits with fairness constraints.IEEE Trans- actions on Network Science and Engineering, 7(3):1799– 1813
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Meritocratic Fairness in Budgeted Combinatorial Multi-armed Bandits via Shapley Values
K-SVFair-FBF uses the new K-Shapley value to achieve meritocratic fairness with O(T^{3/4}) regret in budgeted combinatorial bandits under full-bandit feedback.