Hiding the classifier and letting agents best respond to a discounted average of past classifiers multiplies the deterministic worst-case mistake bound by about 1/(1-gamma) or by the maximum in-degree of the manipulation graph.
3Again, assume thath i⋆,j⋆ is the last hypothesis that remains in the version space
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
-
Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
Hiding the classifier and letting agents best respond to a discounted average of past classifiers multiplies the deterministic worst-case mistake bound by about 1/(1-gamma) or by the maximum in-degree of the manipulation graph.