Fetching the paper…
Reading the bibliography…
In a noncooperative dynamic game, multiple agents operating in a changing environment aim to optimize their utilities over an infinite time horizon.
T. Apostol, Calculus: Multi-variable calculus and linear algebra, with applications to differential equations and probability . Wiley, 1969
1969
Earlier work this paper cites.
F. Kydland, “Noncooperative and dominant player solutions in discrete dynamic games,” International Economic Review , pp. 321–335, 1975
1975
Earlier work this paper cites.
A. P. Sage and C. C. White, Optimum systems control , 2nd ed. Prentice-Hall, 1977
1977
Earlier work this paper cites.
W. D. Dechert, “Optimal control problems from second-order difference equations,” Journal of Economic Theory , vol. 19, no. 1, pp. 50–63, Oct. 1978
1978
Earlier work this paper cites.
D. Bertsekas, “Distributed dynamic programming,” IEEE Transactions on Automatic Control , vol. 27, no. 3, pp. 610–616, Jun 1982
1982
Earlier work this paper cites.
E. Dockner, “On the relation between dynamic oligopolistic competition and long-run competitive equilibrimn,” European Journal of Political Economy , vol. 4, no. 1, pp. 47–64, 1988
1988
Earlier work this paper cites.
T. J. Sargent, Linear Optimal Control, filtering, and rational expectations . Federal Reserve Bank of Minneapolis, Nov. 1988, no. 224
1988
Earlier work this paper cites.
A. Jalali and M. Ferguson, “On distributed dynamic programming,” IEEE Transactions on Automatic Control , vol. 37, no. 5, pp. 685–689, May 1992
1992
Earlier work this paper cites.
M. E. Slade, “What does an oligopoly maximize?” The Journal of Industrial Economics , vol. 42, no. 1, pp. 45–61, Mar. 1994
1994
Earlier work this paper cites.
D. Monderer and L. S. Shapley, “Potential games,” Games and Economic Behavior , vol. 14, no. 1, pp. 124–143, May 1996
1996
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming . Athena Scientific, 1996
1996
Earlier work this paper cites.
——, “Non cooperative dynamic games: a control theoretic approach,” Tech. Rep., 1997
1997
Earlier work this paper cites.
F. Kelly, “Charging and rate control for elastic traffic,” European Transactions on Telecommunications , vol. 8, no. 1, pp. 33–37, 1997
1997
Earlier work this paper cites.
D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods . Athena Scientific, 1997
1997
Earlier work this paper cites.
F. Kelly, A. Maulloo, and D. Tan, “Rate control in communication networks: shadow prices, proportional fairness and stability,” vol. 49, 1998
1998
Earlier work this paper cites.
R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction . MIT Press, 1998
1998
Earlier work this paper cites.
D. Bertsekas, Nonlinear programming . Athena Scientific, 1999
1999
Cited alongside, same era.
T. Basar and G. J. Olsder, Dynamic Noncooperative Game Theory . Society for Industrial and Applied Mathematics, 1999
1999
Cited alongside, same era.
S. Low, “Optimization flow control with on-line measurement or multiple paths,” in Int. Teletraffic Congress , 1999, Edinburgh, UK, pp. 237–249
1999
Cited alongside, same era.
W. D. Dechert and W. A. Brock, “The lake game,” Tech. Rep., 2000
2000
Cited alongside, same era.
J. Mo and J. Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Transactions on Networking , vol. 8, no. 5, pp. 556–567, Oct. 2000
2000
Cited alongside, same era.
L. Busoniu, R. Babuska, D. Schutter, and D. Ernst, Reinforcement Learning and Dynamic Programming Using Function Approximators . CRC Press, 2010
2010
Later among the works it cites.
F. Facchinei, V. Piccialli, and M. Sciandrone, “Decomposition algorithms for generalized potential games,” Computational Optimization and Applications , vol. 50, no. 2, pp. 237–262, 2011
2011
Later among the works it cites.
H. Zhou, P. Fan, and J. Li, “Global proportional fair scheduling for networks with multiple base stations,” IEEE Transactions on Vehicular Technology , vol. 60, no. 4, pp. 1867–1879, May 2011
2011
Later among the works it cites.
Z. Han, D. Niyato, W. Saad, T. Baar, and A. Hjrungnes, Game Theory in Wireless and Communication Networks: Theory, Models, and Applications . Cambridge University Press, 2012
2012
Later among the works it cites.
J. R. Marden, “State based potential games,” Automatica , vol. 48, no. 12, pp. 3075–3088, Dec. 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
W.-H. Wang, M. Palaniswami, and S. H. Low, “Optimal flow control and routing in multi-path networks,” Performance Evaluation , vol. 52, no. 2-3, pp. 119–132, Apr. 2003
2003
Cited alongside, same era.
R. Amir and N. Nannerup, “Information structure and the tragedy of the commons in resource extraction,” Journal of Bioeconomics , vol. 8, no. 2, pp. 147–165, Aug. 2006
2006
Cited alongside, same era.
G. Scutari, S. Barbarossa, and D. Palomar, “Potential games: A framework for vector power control problems with coupled constraints,” in Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP) , May 2006, Toulouse, France
2006
Cited alongside, same era.
J. M. Porta, N. Vlassis, M. T. Spaan, and P. Poupart, “Point-based value iteration for continuous pomdps,” Journal of Machine Learning Research , vol. 7, pp. 2329–2367, 2006
2006
Cited alongside, same era.
D. P. Bertsekas, Dynamic Programming and Optimal Control , 3rd ed. Athena Scientific, 2007, vol. 2
2007
Cited alongside, same era.
M. Chiang, S. Low, A. Calderbank, and J. Doyle, “Layering as optimization decomposition: a mathematical theory of network architectures,” Proceedings of the IEEE , vol. 95, no. 1, pp. 255–312, Jan. 2007
2007
Cited alongside, same era.
D. Dragone, L. Lambertini, G. Leitmann, and A. Palestini, “Hamiltonian potential functions for differential games,” Proceedings of IFAC CAO , vol. 9, 2009
2009
Cited alongside, same era.
2012
Later among the works it cites.
L. Ljungqvist and T. J. Sargent, Recursive Macroeconomic Theory . MIT Press, 2012
2012
Later among the works it cites.
O. Hernández-Lerma and D. González-Sánchez, Discrete Time Stochastic Control and Dynamic Potential Games: The Euler Equation Approach . Springer, Aug. 2013
2013
Later among the works it cites.
N. Li and J. Marden, “Designing games for distributed optimization,” IEEE Journal of Selected Topics in Signal Processing , vol. 7, no. 2, pp. 230–242, April 2013
2013
Later among the works it cites.
Z. Wang, S.-C. Fang, and W. Xing, “On constraint qualifications: motivation, design and inter-relations,” Journal of Industrial and Management Optimization , vol. 9, no. 4, pp. 983–1001, 2013
2013
Later among the works it cites.
S. Brechtel, T. Gindele et al. , “Solving continuous pomdps: Value iteration with incremental learning of an efficient space representation,” in Proc. Int. Conf. on Machine Learning (ICML) , 2013, Atlanta, GA, USA, pp. 370–378
2013
Later among the works it cites.
D. González-Sánchez and O. Hernández-Lerma, “Dynamic potential games: The discrete-time stochastic case,” Dynamic Games and Applications , pp. 1–20, Mar. 2014
2014
Later among the works it cites.
——, “Decoupling coupled constraints through utility design,” IEEE Transactions on Automatic Control , vol. 59, no. 8, pp. 2289–2294, Aug 2014
2014
Later among the works it cites.
S. Zazo, J. Zazo, and M. Sánchez-Fernández, “A control theoretic approach to solve a constrained uplink power dynamic game,” in Proc. European Signal Processing Conference (EUSIPCO) , Sept. 2014, Lisbon, Portugal
2014
Later among the works it cites.
M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” http://cvxr.com/cvx, Mar. 2014
2014
Later among the works it cites.
S. Zazo, S. Valcarcel Macua, M. Sánchez-Fernández, and J. Zazo, “A new framework for solving dynamic schedulling games,” in Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP) , Apr. 2015, Brisbane, QLD, Australia
2015
Closest in time.