# Chasing Convex Bodies Optimally

@inproceedings{Sellke2020ChasingCB,
title={Chasing Convex Bodies Optimally},
author={Mark Sellke},
booktitle={SODA},
year={2020}
}
• Mark Sellke
• Published in SODA 2020
• Computer Science, Mathematics
• In the chasing convex bodies problem, an online player receives a request sequence of $N$ convex sets $K_1,\dots, K_N$ contained in a normed space $\mathbb R^d$. The player starts at $x_0\in \mathbb R^d$, and after observing each $K_n$ picks a new point $x_n\in K_n$. At each step the player pays a movement cost of $||x_n-x_{n-1}||$. The player aims to maintain a constant competitive ratio against the minimum cost possible in hindsight, i.e. knowing all requests in advance. The existence of a… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES