Fetching the paper…
Reading the bibliography…
In this paper, we consider a discrete-time stochastic Stackelberg game with a single leader and multiple followers.
Y.-C. Ho, “Team decision theory and information structures,” Proceedings of the IEEE , vol. 68, no. 6, pp. 644–654, 1980
1980
Earlier work this paper cites.
P. Dasgupta, E. Maskin et al. , “The existence of equilibrium in discontinuous economic games, i: Theory,” Review of Economic Studies , vol. 53, no. 1, pp. 1–26, 1986
1986
Earlier work this paper cites.
P. Dasgupta and E. Maskin, “The existence of equilibrium in discontinuous economic games, ii: Applications,” The Review of economic studies , vol. 53, no. 1, pp. 27–41, 1986
1986
Earlier work this paper cites.
2003
Earlier work this paper cites.
2005
Earlier work this paper cites.
V. Conitzer and T. Sandholm, “Computing the optimal strategy to commit to,” in Proceedings of the 7th ACM conference on Electronic commerce . ACM, 2006, pp. 82–90
2006
Earlier work this paper cites.
J. Pita, M. Jain, J. Marecki, F. Ordóñez, C. Portway, M. Tambe, C. Western, P. Paruchuri, and S. Kraus, “Deployed armor protection: the application of a game theoretic model for security at the los angeles international airport,” in Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track . International Foundation for Autonomous Agents and Multiagent Systems, 2008, pp. 125–132
2008
Earlier work this paper cites.
N. Basilico, N. Gatti, and F. Amigoni, “Leader-follower strategies for robotic patrolling in environments with arbitrary topologies,” in Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1 . International Foundation for Autonomous Agents and Multiagent Systems, 2009, pp. 57–64
2009
Earlier work this paper cites.
C. Kiekintveld, M. Jain, J. Tsai, J. Pita, F. Ordóñez, and M. Tambe, “Computing optimal randomized resource allocations for massive security games,” in Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1 . International Foundation for Autonomous Agents and Multiagent Systems, 2009, pp. 689–696
2009
Earlier work this paper cites.
M. Tambe, Security and game theory: algorithms, deployed systems, lessons learned . Cambridge university press, 2011
2011
Cited alongside, same era.
J. Marecki, G. Tesauro, and R. Segal, “Playing repeated stackelberg games with unknown opponents,” in Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2 . International Foundation for Autonomous Agents and Multiagent Systems, 2012, pp. 821–828
2012
Cited alongside, same era.
A. Nayyar, A. Mahajan, and D. Teneketzis, “Decentralized stochastic control with partial history sharing: A common information approach,” Automatic Control, IEEE Transactions on , vol. 58, no. 7, pp. 1644–1658, 2013
2013
Cited alongside, same era.
R. Yang, B. Ford, M. Tambe, and A. Lemieux, “Adaptive resource allocation for wildlife protection against illegal poachers,” in Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems . International Foundation for Autonomous Agents and Multi agent Systems, 2014, pp. 453–460
P. Basu, “Dynamic Bayesian Persuasion with a Privately Informed Receiver,” 2017
2017
Later among the works it cites.
H. Tavafoghi and D. Teneketzis, “Informational Incentives in Congestion Games,” in Proc. of the Allerton , 2017
2017
Later among the works it cites.
D. Vasal, A. Sinha, and A. Anastasopoulos, “A systematic process for evaluating structured perfect bayesian equilibria in dynamic games with asymmetric information,” IEEE Transactions on Automatic Control , 2018
2018
Later among the works it cites.
F. Farhadi, D. Teneketzis, and S. J. Golestani, “Static and Dynamic Informational Incentive Mechanisms for Security Enhancement,” in 2018 European Control Conference (ECC) , jun 2018
2018
Later among the works it cites.
J. Ely and M. Szydlowski, “Moving the Goalposts,” Journal of Political Economy , 2019
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
M.-F. Balcan, A. Blum, N. Haghtalab, and A. D. Procaccia, “Commitment without regrets: Online learning in stackelberg security games,” in Proceedings of the sixteenth ACM conference on economics and computation . ACM, 2015, pp. 61–78
2015
Cited alongside, same era.
P. H. Au, “Dynamic information disclosure,” The RAND Journal of Economics , vol. 46, no. 4, pp. 791–823, 2015
2015
Cited alongside, same era.
2016
Cited alongside, same era.
——, “Signaling equilibria of dynamic LQG games with asymmetric information,” in Conference on Decision and Control , 2016
2016
Cited alongside, same era.
J. C. Ely, “Beeps,” American Economic Review , vol. 107, no. 1, pp. 31–53, jan 2017
2017
Cited alongside, same era.
L. Doval and J. Ely, “Sequential Information Design,” Econometrica , 2019
2019
Later among the works it cites.
E. Meigs, F. Parise, A. Ozdaglar, and D. Acemoglu, “Optimal dynamic information provision in traffic routing,” in Arxiv , 2020
2020
Closest in time.
D. Vasal, “Sequential decomposition of stochastic stackelberg games,” pp. 1266–1271, 2022
2022
Closest in time.