article

On convex body chasing

Authors:

Joel Friedman,

Nathan LinialAuthors Info & Claims

Discrete & Computational Geometry, Volume 9, Issue 3

Pages 293 - 321

https://doi.org/10.1007/BF02189324

Published: 01 December 1993 Publication History

Abstract

A player moving in the plane is given a sequence of instructions of the following type: at stepi a planar convex setFi is specified, and the player has to move to a point inFi. The player is charged for the distance traveled. We provide a strategy for the player which is competitive, i.e., for any sequenceFi the cost to the player is within a constant (multiplicative) factor of the "off-line" cost (i.e., the least possible cost when allFi are known in advance). We conjecture that similar strategies can be developed for this game in any Euclidean space and perhaps even in all metric spaces. The analogous statement where convex sets are replaced by more general families of sets in a metric space includes many on-line/off-line problems such as thek-server problem; we make some remarks on these more general problems.

References

[1]

S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson. On the Power of Randomization in On-line Algorithms. InProc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 379---386, May 1990.

Google Scholar

[2]

P. Berman, H. J. Karloff, and G. Tardos. A Competitive Three-Server Algorithm. InProc. of the 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 280---290, January 1990.

Digital Library

Google Scholar

[3]

A. Bordoin, N. Linial, and M. Saks. An Optimal On-Line Algorithm for Metrical Task Systems. InProc. of the 19th Ann. ACM Symp. on Theory of Computing, pages 373---382, May 1987. Final version to appear inJ. Assoc. Comput. Mach.

Google Scholar

[4]

M. Chrobak, H. J. Karloff, T. Payne, and S. Vishwanathan. New Results on Server Problems. InProc. of the 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, pates 291---300, January 1990.

Google Scholar

[5]

D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir. Random Walks on Weighted Graphs and Applications to On-line Algorithms. InProc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 369---378, May 1990.

Digital Library

Google Scholar

[6]

A. Fiat, D. P. Foster, H. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan. Competitive Algorithms for Layered Graph Traversal. Manuscript, 1991.

Google Scholar

[7]

A. Fiat, Y. Rabani, and Y. Ravid. Competitivek-Server Algorithms. InProc. of the 31st Ann. IEEE Symp. on Foundations of Computer Science, pages 454---463, October 1990.

Google Scholar

[8]

E. Grove. The Harmonic Onlinek-Server Algorithm Is Competitive. Manuscript, 1990.

Google Scholar

[9]

M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive Algorithms for On-Line Problems. InProc. of the 20th Ann. ACM Symp. on Theory of Computing, pages 322---333, May 1988.

Google Scholar

[10]

C. H. Papadimitriou and M. Yannakakis. Shortest Paths Without a Map. InProc. 16th ICALP, pages 610---620, July 1989.

Crossref

Google Scholar

[11]

D. D. Slator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules.Comm. ACM, 28:202---208, 1985.

Google Scholar

Cited By

View all

Cohen LSharifi-Malvajerdi SStangl KVakilian AZiani JKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Sequential strategic screeningProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3618658(6279-6295)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3618658
Wang KSong ZTheocharous GMahadevan SWilliams BChen YNeville J(2023)Smoothed online combinatorial optimization using imperfect predictionsProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i10.26430(12130-12137)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i10.26430
Zhang WJacquillat AWang KWang S(2023)Routing Optimization with Vehicle–Customer CoordinationManagement Science10.1287/mnsc.2023.473969:11(6876-6897)Online publication date: 29-Mar-2023
https://dl.acm.org/doi/10.1287/mnsc.2023.4739
Show More Cited By

Index Terms

On convex body chasing
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Design and analysis of algorithms
  2. Randomness, geometry and discrete structures

Index terms have been assigned to the content through auto-classification.

Recommendations

Convex hulls of spheres and convex hulls of disjoint convex polytopes

Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@__ __"1"=<"i"<>"j"=<"mn"in"j^@__ __^d^2^@__ __), ...
The Chvátal-Gomory Closure of a Strictly Convex Body

In this paper, we prove that the Chvátal-Gomory closure of a set obtained as an intersection of a strictly convex body and a rational polyhedron is a polyhedron. Thus, we generalize a result of Schrijver [Schrijver, A. 1980. On cutting planes. Ann. ...
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometry

Given a set Σ of spheres in E^d, with d≥3 and d odd, having a fixed number of m distinct radii ρ₁,ρ₂,...,ρ_m, we show that the worst-case combinatorial complexity of the convex hull CH_d(Σ) of Σ is Θ(Σ_{{1≤i≠j≤m}}n_in_j^{⌊ d/2 ⌋}), where n_i is the number of ...

Comments

Information & Contributors

Information

Published In

cover image Discrete & Computational Geometry

Discrete & Computational Geometry Volume 9, Issue 3

March 1993

114 pages

ISSN:0179-5376

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 December 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cohen LSharifi-Malvajerdi SStangl KVakilian AZiani JKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Sequential strategic screeningProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3618658(6279-6295)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3618658
Wang KSong ZTheocharous GMahadevan SWilliams BChen YNeville J(2023)Smoothed online combinatorial optimization using imperfect predictionsProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i10.26430(12130-12137)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i10.26430
Zhang WJacquillat AWang KWang S(2023)Routing Optimization with Vehicle–Customer CoordinationManagement Science10.1287/mnsc.2023.473969:11(6876-6897)Online publication date: 29-Mar-2023
https://dl.acm.org/doi/10.1287/mnsc.2023.4739
Lechowicz AChristianson NZuo JBashir NHajiesmaili MWierman AShenoy P(2023)The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load ShiftingProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36267767:3(1-32)Online publication date: 7-Dec-2023
https://dl.acm.org/doi/10.1145/3626776
Argue CGupta AMolinaro M(2023)Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body ChasingDiscrete & Computational Geometry10.1007/s00454-023-00491-370:3(773-789)Online publication date: 5-Jul-2023
https://dl.acm.org/doi/10.1007/s00454-023-00491-3
Zhang LJiang WYi JYang TKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Smoothed online convex optimization based on discounted-normal-predictorProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3600626(4928-4942)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3600626
Li PYang JRen S(2022)Expert-Calibrated Learning for Online Optimization with Switching CostsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35308946:2(1-35)Online publication date: 6-Jun-2022
https://dl.acm.org/doi/10.1145/3530894
Pruhs K(2022)Green Computing AlgorithmicsComputing and Software Science10.1007/978-3-319-91908-9_10(161-183)Online publication date: 11-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-319-91908-9_10
Zhang LJiang WLu SYang TRanzato MBeygelzimer ADauphin YLiang PVaughan J(2021)Revisiting smoothed online learningProceedings of the 35th International Conference on Neural Information Processing Systems10.5555/3540261.3541303(13599-13612)Online publication date: 6-Dec-2021
https://dl.acm.org/doi/10.5555/3540261.3541303
Bubeck SRabani YSellke MMarx D(2021)Online multiserver convex chasing and optimizationProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458189(2093-2104)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458189
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Convex hulls of spheres and convex hulls of disjoint convex polytopes

The Chvátal-Gomory Closure of a Strictly Convex Body

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations