First sample-complexity bounds, up to a gap, for identifying non-redundancy of skew-symmetric games in dueling bandits.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits
First sample-complexity bounds, up to a gap, for identifying non-redundancy of skew-symmetric games in dueling bandits.