Fetching the paper…
Reading the bibliography…
We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action.
Marktform und Gleichgewicht
H. von Stackelberg · 1934
Earlier work this paper cites.
An efficient approach to solving the road network equilibrium traffic assignment problem
Larry J. LeBlanc, Edward K. Morlok, and William P. Pierskalla · 1975
Earlier work this paper cites.
The Weighted Majority Algorithm
N. Littlestone and M.K. Warmuth · 1994
Earlier work this paper cites.
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
Yoav Freund and Robert E Schapire · 1997
Earlier work this paper cites.
Achieving Network Optima Using Stackelberg Routing Strategies
Yannis A. Korilis, Aurel A. Lazar, and Ariel Orda · 1997
Earlier work this paper cites.
The Nonstochastic Multiarmed Bandit Problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 2003
Earlier work this paper cites.
Gaussian processes in machine learning
Carl Edward Rasmussen · 2003
Earlier work this paper cites.
Prediction, learning, and games
Nicolò Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
A survey of Stackelberg differential game models in supply and marketing channels
Xiuli He, Ashutosh Prasad, Suresh P. Sethi, and Genaro J. Gutierrez · 2007
Earlier work this paper cites.
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordóñez, and Sarit Kraus · 2008
Earlier work this paper cites.
Learning and Approximating the Optimal Strategy to Commit To
Joshua Letchford, Vincent Conitzer, and Kamesh Munagala · 2009
Earlier work this paper cites.
Using Game Theory for Los Angeles Airport Security
James Pita, Manish Jain, Fernando Ordóñez, Christopher Portway, Milind Tambe, Craig Western, Praveen Paruchuri, and Sarit Kraus · 2009
Earlier work this paper cites.
Gaussian process optimization in the bandit setting: No regret and experimental design
Niranjan Srinivas, Andreas Krause, Sham M Kakade, and Matthias Seeger · 2010
Earlier work this paper cites.
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
Manish Jain, Christopher Kiekintveld, and Milind Tambe · 2011
Cited alongside, same era.
A Double Oracle Algorithm for Zero-Sum Security Games on Graphs
Manish Jain, Dmytro Korzhyk, Ondřej Vaněk, Vincent Conitzer, Michal Pěchouček, and Milind Tambe · 2011
Cited alongside, same era.
Regret bounds for deterministic Gaussian process bandits
Nando de Freitas, Alex Smola, and Masrour Zoghi · 2012
Cited alongside, same era.
Playing Repeated Stackelberg Games with Unknown Opponents
Janusz Marecki, Gerry Tesauro, and Richard Segal · 2012
Cited alongside, same era.
Online learning for linearly parametrized control problems
Yasin Abbasi-Yadkori · 2013
Cited alongside, same era.
Analyzing the Effectiveness of Adversary Modeling in Security Games
Regret Minimization Algorithms for the Followers Behaviour Identification in Leadership Games
Lorenzo Bisi, Giuseppe De Nittis, Francesco Trovò, Marcello Restelli, and Nicola Gatti · 2017
Later among the works it cites.
On Kernelized Multi-armed Bandits
Sayak Ray Chowdhury and Aditya Gopalan · 2017
Later among the works it cites.
Cloudy with a Chance of Poaching: Adversary Behavior Modeling and Forecasting with Real-World Poaching Data
Debarun Kar, Benjamin J. Ford, Shahrzad Gholami, Fei Fang, Andrew J. Plumptre, Milind Tambe, Margaret Driciru, Fred Wanyama, Aggrey Rwetsiba, Mustapha Nsubaga, and Joshua Mabonga · 2017
Later among the works it cites.
A review on bilevel optimization: from classical to evolutionary approaches and applications
Ankur Sinha, Pekka Malo, and Kalyanmoy Deb · 2017
Later among the works it cites.
Bilevel Programming for Hyperparameter Optimization and Meta-Learning
Luca Franceschi, Paolo Frasconi, Saverio Salzo, Riccardo Grazzi, and Massimilano Pontil · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Thanh H. Nguyen, Rong Yang, Amos Azaria, Sarit Kraus, and Milind Tambe · 2013
Cited alongside, same era.
Learning Optimal Commitment to Overcome Insecurity
Avrim Blum, Nika Haghtalab, and Ariel D. Procaccia · 2014
Cited alongside, same era.
Adaptive resource allocation for wildlife protection against illegal poachers
Rong Yang, Benjamin J. Ford, Milind Tambe, and Andrew Lemieux · 2014
Cited alongside, same era.
Commitment Without Regrets: Online Learning in Stackelberg Security Games
Maria-Florina Balcan, Avrim Blum, Nika Haghtalab, and Ariel D. Procaccia · 2015
Cited alongside, same era.
"A Game of Thrones": When Human Behavior Models Compete in Repeated Stackelberg Security Games
Debarun Kar, Fei Fang, Francesco Maria Delle Fave, Nicole D. Sintov, and Milind Tambe · 2015
Cited alongside, same era.
Opponent Modeling in Deep Reinforcement Learning
He He, Jordan Boyd-Graber, Kevin Kwok, and Hal Daumé · 2016
Cited alongside, same era.
Learning Adversary Behavior in Security Games: A PAC Model Perspective
Arunesh Sinha, Debarun Kar, and Milind Tambe · 2016
Cited alongside, same era.
Later among the works it cites.
Modeling Others using Oneself in Multi-Agent Reinforcement Learning
Roberta Raileanu, Emily L. Denton, Arthur Szlam, and Rob Fergus · 2018
Later among the works it cites.
Opponent Aware Reinforcement Learning
Víctor Gallego, Roi Naveiro, David Ríos Insua, and David Gomez-Ullate Oteiza · 2019
Later among the works it cites.
A Regularized and Smoothed Fischer–Burmeister Method for Quadratic Programming With Applications to Model Predictive Control
D. Liao-McPherson, M. Huang, and I. Kolmanovsky · 2019
Later among the works it cites.
Learning Optimal Strategies to Commit To
Binghui Peng, Weiran Shen, Pingzhong Tang, and Song Zuo · 2019
Later among the works it cites.
No-Regret Learning in Unknown Games with Correlated Payoffs
Pier Giuseppe Sessa, Ilija Bogunovic, Maryam Kamgarpour, and Andreas Krause · 2019
Later among the works it cites.
A Regularized Opponent Model with Maximum Entropy Objective
Zheng Tian, Ying Wen, Zhichen Gong, Faiz Punakkath, Shihao Zou, and Jun Wang · 2019
Later among the works it cites.
LESS is More: Rethinking Probabilistic Models of Human Behavior
Andreea Bobu, Dexter R. R. Scobee, Jaime F. Fisac, S. Shankar Sastry, and Anca D. Dragan · 2020
Closest in time.