Computing approximate roots of monotone functions

DOI10.1016/J.JCO.2025.101930MaRDI QIDQ7006216zbMATH OpenFDO

Authors Alexandros Hollender, Chester Lawrence, Erel Segal-Halevi

Publication date 31 March 2025

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCO.2025.101930

zbMATH Keywords

cake cuttingfixed pointquery complexityroot findingvalue oracle

Mathematics Subject Classification ID

Nonlinear algebraic or transcendental equations (65H99) Complexity and performance of numerical algorithms (65Y20)

Cites work

• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• A convergent process of price adjustment and global Newton methods
• A Faster Algorithm for Finding Tarski Fixed Points
• A rapid generalized method of bisection for solving systems of non-linear equations
• A recursive algorithm for the infinity-norm fixed point problem
• Algorithmic solutions for envy-free cake cutting
• Computations and complexities of Tarski's fixed points and supermodular games
• Envy-free cake divisions cannot be found by finite protocols
• Envy-free cake-cutting for four agents
• Envy-free division of multi-layered cakes
• Exponential lower bounds for finding Brouwer fixed points
• How to Cut a Cake Fairly
• How to cut a cake fairly: a generalization to groups
• On algorithms for discrete and approximate brouwer fixed points
• On the complexity of isolating real roots and computing with certainty the topological degree
• Optimal solution of nonlinear equations satisfying a Lipschitz condition
• Rental Harmony: Sperner's Lemma in Fair Division
• The Approximation of Fixed Points of a Continuous Mapping
• The complexity of Hex and the Jordan curve theorem

This page was built for publication: Computing approximate roots of monotone functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006216)