Dimension-Free Bounds on Chasing Convex Functions

We consider the problem of chasing convex functions, where functions arrive over time. The player takes actions after seeing the function, and the goal is to achieve a small function cost for these actions, as well as a small cost for moving between actions. While the general problem requires a poly...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Argue, C. J, Gupta, Anupam, Guruganesh, Guru
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!