2 citations · 2 across the 2 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2023
Computing approximate roots of monotone functions
Alexandros Hollender, Chester Lawrence, Erel Segal-Halevi
Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f…
cs.GT2019★ 2 cited
Dividing a Graphical Cake
Xiaohui Bei, Warut Suksompong
We consider the classical cake-cutting problem where we wish to fairly divide a heterogeneous resource, often modeled as a cake, among interested agents. Work on the subject typica…