Fetching the paper…
Reading the bibliography…
We study an online linear classification problem, in which the data is generated by strategic agents who manipulate their features in an effort to change the classification outcome.
Convex analysis
Rockafellar, R. T. (1970) · 1970
Earlier work this paper cites.
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Ben-Tal, A. and Nemirovski, A. (2001) · 2001
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Zinkevich, M. (2003) · 2003
Earlier work this paper cites.
Adversarial classification
Dalvi, N., Domingos, P., Sanghai, S., and Verma, D. (2004) · 2004
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, A. D., Kalai, A. T., and McMahan, H. B. (2005) · 2005
Earlier work this paper cites.
Learning from revealed preference
Beigman, E. and Vohra, R. (2006) · 2006
Earlier work this paper cites.
Nash equilibria of static prediction games
Brückner, M. and Scheffer, T. (2009) · 2009
Earlier work this paper cites.
A game theoretical model for adversarial learning
Liu, W. and Chawla, S. (2009) · 2009
Earlier work this paper cites.
Complexity of computing optimal stackelberg strategies in security resource allocation games
Korzhyk, D., Conitzer, V., and Parr, R. (2010) · 2010
Cited alongside, same era.
Stackelberg games for adversarial prediction problems
Brückner, M. and Scheffer, T. (2011) · 2011
Cited alongside, same era.
Security and game theory: algorithms, deployed systems, lessons learned
Tambe, M. (2011) · 2011
Cited alongside, same era.
Static prediction games for adversarial learning problems
Brückner, M., Kanzow, C., and Scheffer, T. (2012) · 2012
Cited alongside, same era.
Efficiently learning from revealed preference
Zadimoghaddam, M. and Roth, A. (2012) · 2012
Cited alongside, same era.
Bayesian games for adversarial regression problems
Großhans, M., Sawade, C., Brückner, M., and Scheffer, T. (2013) · 2013
Cited alongside, same era.
Online learning and profit maximization from revealed preferences
Amin, K., Cummings, R., Dworkin, L., Kearns, M., and Roth, A. (2015) · 2015
Later among the works it cites.
Commitment without regrets: Online learning in stackelberg security games
Balcan, M., Blum, A., Haghtalab, N., and Procaccia, A. D. (2015) · 2015
Later among the works it cites.
Convex optimization: Algorithms and complexity
Bubeck, S. (2015) · 2015
Later among the works it cites.
Strategic classification
Hardt, M., Megiddo, N., Papadimitriou, C., and Wootters, M. (2016) · 2016
Later among the works it cites.
Learning from rational behavior: Predicting solutions to unknown linear programs
Jabbari, S., Rogers, R. M., Roth, A., and Wu, S. Z. (2016) · 2016
Later among the works it cites.
Watch and learn: Optimizing from revealed preferences feedback
Roth, A., Ullman, J., and Wu, Z. S. (2016) · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Metric learning: A survey
Kulis, B. et al. (2013) · 2013
Cited alongside, same era.
Learning economic parameters from revealed preferences
Balcan, M.-F., Daniely, A., Mehta, R., Urner, R., and Vazirani, V. V. (2014) · 2014
Cited alongside, same era.
Later among the works it cites.
Kernel-based methods for bandit convex optimization
Bubeck, S., Lee, Y. T., and Eldan, R. (2017) · 2017
Closest in time.
Multidimensional dynamic pricing for welfare maximization
Roth, A., Slivkins, A., Ullman, J., and Wu, Z. S. (2017) · 2017
Closest in time.