Fetching the paper…
Reading the bibliography…
As predictive models are deployed into the real world, they must increasingly contend with strategic behavior.
Approximation to Bayes risk in repeated play
James Hannan · 1957
Earlier work this paper cites.
The weighted majority algorithm
Nick Littlestone and Manfred K Warmuth · 1994
Earlier work this paper cites.
Reputation and dynamic Stackelberg leadership in infinitely repeated games
Masaki Aoyagi · 1996
Earlier work this paper cites.
Calibrated learning and correlated equilibrium
Dean P Foster and Rakesh V Vohra · 1997
Earlier work this paper cites.
Improving ratings: Audit in the British university system
Marilyn Strathern · 1997
Earlier work this paper cites.
Dynamic Noncooperative Game Theory
Tamer Başar and Geert Jan Olsder · 1998
Earlier work this paper cites.
Dynamics of stochastic approximation algorithms
Michel Benaïm · 1999
Earlier work this paper cites.
A simple adaptive procedure leading to correlated equilibrium
Sergiu Hart and Andreu Mas-Colell · 2000
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Adversarial classification
Nilesh Dalvi, Pedro Domingos, Sumit Sanghai, and Deepak Verma · 2004
Earlier work this paper cites.
Convergence rate of linear two-time-scale stochastic approximation
Vijay R. Konda and John N. Tsitsiklis · 2004
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham D Flaxman, Adam Tauman Kalai, and H Brendan McMahan · 2005
Earlier work this paper cites.
Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games
Avrim Blum, Eyal Even-Dar, and Katrina Ligett · 2006
Earlier work this paper cites.
Regret minimization and the price of total anarchy
Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, and Aaron Roth · 2008
Earlier work this paper cites.
Stochastic Approximation: A Dynamical Systems Viewpoint
Vivek S. Borkar · 2008
Earlier work this paper cites.
Algorithmic game theory
Tim Roughgarden · 2010
Earlier work this paper cites.
Market Structure and Equilibrium
Heinrich von Stackelberg · 2010
Earlier work this paper cites.
Static prediction games for adversarial learning problems
Michael Brückner, Christian Kanzow, and Tobias Scheffer · 2012
Earlier work this paper cites.
Stochastic convex optimization with bandit feedback
Alekh Agarwal, Dean P Foster, Daniel Hsu, Sham M Kakade, and Alexander Rakhlin · 2013
Cited alongside, same era.
Strategic classification
Moritz Hardt, Nimrod Megiddo, Christos Papadimitriou, and Mary Wootters · 2016
Cited alongside, same era.
Linear convergence of gradient and proximal-gradient methods under the Polyak-Łojasiewicz condition
Hamed Karimi, Julie Nutini, and Mark Schmidt · 2016
Cited alongside, same era.
Kernel-based methods for bandit convex optimization
Sébastien Bubeck, Yin Tat Lee, and Ronen Eldan · 2017
Cited alongside, same era.
Hands on the wheel: Navigating algorithmic management and Uber drivers’ autonomy
Marieke Möhlmann and Lior Zalmanson · 2017
Cited alongside, same era.
Bandit learning in concave n-person games
Mario Bravo, David Leslie, and Panayotis Mertikopoulos · 2018
Cited alongside, same era.
Maximizing welfare with incentive-aware evaluation mechanisms
Nika Haghtalab, Nicole Immorlica, Brendan Lucier, and Jack Z. Wang · 2020
Later among the works it cites.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael Jordan · 2020
Later among the works it cites.
On gradient-based learning in continuous games
Eric Mazumdar, Lillian J. Ratliff, and S. Shankar Sastry · 2020
Later among the works it cites.
Stochastic optimization for performative prediction
Celestine Mendler-Dünner, Juan Perdomo, Tijana Zrnic, and Moritz Hardt · 2020
Later among the works it cites.
Strategic classification is causal modeling in disguise
John Miller, Smitha Milli, and Moritz Hardt · 2020
Later among the works it cites.
Performative prediction
Juan Perdomo, Tijana Zrnic, Celestine Mendler-Dünner, and Moritz Hardt · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Strategic classification from revealed preferences
Jinshuo Dong, Aaron Roth, Zachary Schutzman, Bo Waggoner, and Zhiwei Steven Wu · 2018
Cited alongside, same era.
Ian Ball · 2019
Cited alongside, same era.
When users control the algorithms: Values expressed in practices on Twitter
Jenna Burrell, Zoe Kahn, Anne Jonas, and Daniel Griffin · 2019
Cited alongside, same era.
Playing the visibility game: How digital influencers and algorithms negotiate influence on Instagram
Kelley Cotter · 2019
Cited alongside, same era.
The disparate effects of strategic manipulation
Lily Hu, Nicole Immorlica, and Jennifer Wortman Vaughan · 2019
Cited alongside, same era.
How do classifiers induce agents to invest effort strategically?
Jon Kleinberg and Manish Raghavan · 2019
Cited alongside, same era.
Causal strategic linear regression
Yonadav Shavit, Benjamin Edelman, and Brian Axelrod · 2020
Later among the works it cites.
The strategic perceptron
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, and Keziah Naggita · 2021
Closest in time.
Gaming helps! Learning from strategic interactions in natural dynamics
Yahav Bechavod, Katrina Ligett, Steven Wu, and Juba Ziani · 2021
Closest in time.
Local convergence analysis of gradient descent ascent with finite timescale separation
Tanner Fiez and Lillian J Ratliff · 2021
Closest in time.
Strategic classification in the dark
Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, and Nir Rosenfeld · 2021
Closest in time.
How to learn when data reacts to your model: Performative gradient descent
Zachary Izzo, Lexing Ying, and James Zou · 2021
Closest in time.
Alternative microfoundations for strategic classification
Meena Jagadeesan, Celestine Mendler-Dünner, and Moritz Hardt · 2021
Closest in time.
Improved regret for zeroth-order stochastic convex bandits
Tor Lattimore and Andras Gyorgy · 2021
Closest in time.
Strategic classification made practical
Sagi Levanon and Nir Rosenfeld · 2021
Closest in time.
Outside the echo chamber: Optimizing the performative risk
John P Miller, Juan C Perdomo, and Tijana Zrnic · 2021
Closest in time.
Incentive-aware PAC learning
Hanrui Zhang and Vincent Conitzer · 2021
Closest in time.