Brief

A new research paper published on arXiv introduces novel randomized algorithms for online strategic classification. The study addresses settings where agents strategically alter their features to influence predictions, aiming to improve mistake or regret bounds. The paper provides the first lower bound applicable to randomized learners in the realizable setting and an improper randomized learner that achieves an optimal regret upper bound in the agnostic setting. AI