J. Abernethy, P. L. Bartlett, A. Rakhlin, and A. Tewari, Optimal Strategies and Minimax Lower Bounds for Online Convex Games, 2008.

S. Agrawal and N. R. Devanur, Bandits with Concave Rewards and Convex Knapsacks, Proceedings of the Fifteenth ACM Conference on Economics and Computation, 2014.

A. Badanidiyuru, R. Kleinberg, and A. Slivkins, Bandits with Knapsacks, IEEE 54th Annual Symposium on Foundations of Computer Science, 2013.

E. V. Belmega, P. Mertikopoulos, R. Negrel, and L. Sanguinetti, Online Convex Optimization and No-Regret Learning: Algorithms, Guarantees and Applications, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01891562

O. Besbes, Y. Gur, and A. Zeevi, Non-Stationary Stochastic Optimization, Operations Research, vol.63, issue.5, pp.1227-1244, 2015.

X. Cao and K. J. Liu, Online Convex Optimization with Time-Varying Constraints and Bandit Feedback, IEEE Transactions on Automatic Control, 2018.

L. Chen, C. Harshaw, H. Hassani, and A. Karbasi, Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity, ICML, 2018.

T. Chen, Q. Ling, and G. B. Giannakis, An Online Convex Optimization Approach to Proactive Network Resource Allocation, IEEE Transactions on Signal Processing, vol.65, issue.24, pp.6350-6364, 2017.

L. Georgiadis, M. J. Neely, and L. Tassiulas, Resource Allocation and Cross-Layer Control in Wireless Networks, Foundations and Trends R in Networking, 2006.

R. Jenatton, J. C. Huang, and C. Archambeau, Adaptive Algorithms for Online Convex Optimization with Long-Term Constraints. ICML, pp.402-411, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01247933

M. Mahdavi, R. Jin, Y. , and T. , Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints, Journal of Machine Learning Research, 2012.

S. Mannor, J. N. Tsitsiklis, Y. , and J. Y. , Online Learning with Sample Path Constraints, Journal of Machine Learning Research, 2009.

M. J. Neely, Stochastic Network Optimization with Application to Communication and Queueing Systems. Synthesis Lectures on Communication Networks, 2010.

M. J. Neely, Universal Scheduling for Networks with Arbitrary Traffic, Channels, and Mobility, IEEE Decision and Control (CDC), pp.1822-1829, 2010.

M. J. Neely and H. Yu, Online Convex Optimization with Time-Varying Constraints, 2017.

S. Shalev-shwartz, Online Learning and Online Convex Optimization. Foundations and Trends R in Machine Learning, 2012.

W. Sun, D. Dey, and A. Kapoor, Safety-Aware Algorithms for Adversarial Contextual Bandit, ICML, pp.3280-3288, 2017.

, Click Fraud Poses a Threat to the Boom in Internet Advertising, 2005.

H. Yu, M. J. Neely, W. , and X. , Online Convex Optimization with Stochastic Constraints, NeurIPS, 2017.

J. Yuan and A. Lamperski, Online Convex Optimization for Cumulative Constraints, NeurIPS, 2018.

M. Zinkevich, Online Convex Programming and Generalized Infinitesimal Gradient Ascent. ICML, 2003.