The Online Saddle Point Problem and Online Convex Optimization with Knapsacks: Saddle-Point Follow-the-Leader Has SP-Regret at Most on Strongly Convex-Concave Lipschitz GamesResearch Paper
Many decisions are made by two parties with opposed interests who interact repeatedly while the game between them changes: a seller and a buyer facing shifting demand, a planner and an adversarial environment, or the primal and dual players of a constrained online optimization problem. Rivera Cardoso, Wang and Xu (arXiv:1806.08301v3) formalize this as the on…